Privacy

Proof gates

Progress is gated, not promised. Each gate is a concrete, runnable check, and the project does not move past a gate until it passes.

Gates, not milestones

A milestone is a date; a gate is a test. NoviQ organizes its development as a ladder of gates, each one a specific claim you can reproduce. This keeps the roadmap honest: a feature is not "done" because it shipped, it is done because its gate passes.

ACorrectnesstoken-identical split vs wholeBReal WANtwo machines, first receiptCKV cachedecode at speedDPrivacyadversary below threshold
The gate ladder. Gate A (correctness) and Gate D (privacy obfuscation) are proven on a CPU harness today; B and C are the WAN and cache gates in between.

The ladder

Gate A - Correctness
Greedy output is token-identical between the split run and the single-process reference. Proven today on CPU.
Gate B - Real WAN
Two machines across the real internet run the pipeline and emit the first correctness receipt with genuine round-trip latency.
Gate C - KV cache
Key-value caching across the sharded pipeline so multi-token decode runs at speed, not just single forward passes.
Gate D - Privacy
The reconstruction adversary's recovery on any untrusted node falls below the declared threshold, with a quantified and acceptable quality cost. Obfuscation proven today on a mini model.

Run them yourself

The gates are not screenshots - they are scripts that finish in seconds on a laptop CPU.

# correctness: bit-identical split vs whole
.venv/bin/python -m proof.correctness_gate

# privacy diagnostic: shows boundary pinning alone is NOT enough
.venv/bin/python -m proof.privacy_probe

# privacy gate: obfuscation drops recovery to near chance, output identical
.venv/bin/python -m proof.obfuscation_gate

The diagnostic is included on purpose

The privacy_probe is the failing case: it demonstrates that pinning the boundary leaves the embedding in the residual stream and the prompt fully recoverable. Shipping the failure alongside the fix is the honesty rule in code.

The sequencing rule

Order is load-bearing

Correctness (A), then real WAN (B), then cache (C), then the privacy proof (D). Speed optimizations and the permissionless economy come after the network can prove the two things the product name promises: the output is right, and the input stayed hidden.