REVEAL THE PROOF.
NOT THE INFORMATION.
Prove that a statement is true without exposing the private data behind it. Explore privacy-preserving verification built around cryptographic commitments and zero-knowledge proof systems.
Private input
not disclosed
Proof engine
simulated
Verifier
claim + receipt
A claim can be public. The witness does not have to be.
The interface below separates the secret used by a prover from the statement a verifier receives. In this MVP, the engine is intentionally simulated.
Private input
A local witness is supplied to the proof-generation interface.
Define the claim
Only the condition required by the verifier becomes public.
Generate proof
A real system would apply a circuit, witness, and proof algorithm.
Verify
The verifier checks the proof against public inputs and configuration.
GHOSTSTATE PROOF LAB
A browser-only simulation of a private threshold claim.
01 / Private input
Private values never leave this browser in the demonstration.
02 / Public statement
COMMITMENT LAB
Bind a private value to a canonical SHA-256 payload while keeping the salt private.
Create a commitment to calculate a digest.
ONE AUTHORIZATION. ONE VALID USE.
A local registry demonstration for duplicate-use prevention. Browser-only and bypassable.
Unset
Unused
—
—
PUBLIC VERIFICATION EXPLORER
Example records only. No live verification metrics.
Design for the system you want to verify.
Circuit
Defines the mathematical conditions.
Private witness
Secret inputs used to construct a proof.
Public inputs
Values intentionally disclosed to the verifier.
Prover / verifier
Generate and check a proof under known assumptions.
A proof may still leak information if the circuit, public inputs, or application design are incorrect. The simulation above makes no claim of zero-knowledge security.
Documentation is part of the security boundary.
A credible privacy system documents what is private, what is public, and what assumptions verification relies on.