Your data stays private.
Your claims remain verifiable.
Reusable primitives for applications that need to verify conditions about private information — without requiring users to reveal the underlying values.
Privacy is not the absence of proof.
It is proof without disclosure.
RESEARCH NOTE 001
Prove a condition.
Keep the value.
A local demonstration of the prover / verifier boundary. Your private value never leaves this browser session.
The private value is used only to evaluate this local demonstration.
A boundary between
knowledge and proof.
Private information remains with the prover. The verifier receives only what is needed to evaluate the claim.
The witness lives with the prover.
A claim is encoded as a proof.
Only the proof crosses the boundary.
The verifier checks public inputs.
Condition confirmed. State undisclosed.
PUBLIC INPUT
The condition and parameters the verifier is allowed to see.
PRIVATE WITNESS
The underlying value known only to the prover.
COMMITMENT
A binding, hiding representation of a value.
VERIFICATION KEY
The public material used to check a proof.
Bind a value.
Reveal it later.
Commitments let a prover publish a fingerprint of hidden data. The salt prevents simple guessing attacks.
What this proves
The committer cannot change the value later without changing the hash.
What this does not prove
A commitment is not a zero-knowledge proof. It does not prove a condition about the value by itself.
Build with
minimal disclosure.
API surface is evolving
Understand the prover / verifier model.
VERIFICATION WORKFLOWTrace a claim from input to result.
SECURITY ASSUMPTIONSKnow what each primitive can and cannot guarantee.