Sovereign Verification Architecture · Public Proving Ground
Prove It Yourself
Run the challenges. Verify the math. Trust nothing on our word.
Anchor fa39bbe8 · Watermark PBTG-PROVE-IT-v1.0 · 4 of 15 challenges live · Full gauntlet by Day 10
Most companies say trust us. Genesis Protocol says don't.
Below are sovereign challenges that demonstrate specific properties of the substrate without revealing implementation. Each challenge is empirically falsifiable. Each can be repeated by you with adversarial input. Each operates within the Deterministic Verification Boundary defined in SVA Architecture v1.0.
This is not a demo. This is the public proving ground for the standard.
"Genesis replaces institutional trust assumptions with empirically reproducible cryptographic verification."
How this works: Each challenge has a clear input, expected output, and run-it-yourself instructions. The verifier code is public. The prover (the Genesis substrate) is sovereign. This is the standard cryptographic asymmetry that protects sovereign IP while enabling public falsifiability.
Challenge C1
Receipt Validity
Mint a receipt for arbitrary content. Verify it offline using the public verifier. Verification succeeds without contact with our server.
Live
Run C1 →
Challenge C2
Tamper Detection
Modify any byte of the receipt: content, signature, field index, or anchor. Each modification breaks a specific gate. The verifier reports which.
Live
Run C2 →
Challenge C7
Server-Independent Verification
Download the verifier. Disconnect from the network. Verify your receipt offline. The substrate plays no role in verification. Pull the plug and try it.
Live
Get Verifier →
Challenge C11
Pubkey-Insufficient Forgery
Take our public key from any receipt. Try to forge a valid receipt using only it. Your forgery will fail Gate 7 (Ed25519 signature). Public key is not sufficient.
Live
Try C11 →
Challenge C3
Anti-Replay Resistance
Submit the same receipt twice. Second submission is rejected as a replay. Demonstrates anti-replay state without revealing nonce derivation.
Day 3
Challenge C4
Temporal Anchoring
Verify a receipt's Bitcoin OpenTimestamps proof against an independent block explorer. Confirms the receipt existed before a specified block height.
Day 4
Challenge C5
Non-Correlation
Generate ten receipts under one session. Run a correlation analysis. No statistically significant linkage between them.
Day 4
Challenge C6
Invalidation Resistance
Request that we invalidate your receipt. We provide no mechanism. The substrate is append-only with respect to receipts. Forever.
Day 5
Challenge C8
Bitcoin Anchor Realness
Verify the OTS commitment hash against a Bitcoin block explorer not operated by PBTG. Proves the anchor is real, not simulated.
Day 3
Challenge C9
O(1) Performance Scaling
Submit batches of 1, 10, 100, 1000 receipts. Per-receipt verification time stays constant. Confirms architectural O(1) verification.
Day 5
Challenge C10
Zero-Knowledge Property
Submit a hash commitment to value V. Receive a ZK proof that V satisfies a predicate. V remains hidden. Property is proven.
Day 6
Challenge C12
Honest Gate Count
Disable each verification gate independently. Each yields a distinct vulnerability class. No overlapping or redundant gates.
Day 7
Challenge C13
Verifier Integrity
Hash the verifier binary you downloaded. Compare against the canonical hash in the SVA manifest. Confirms verifier was not silently modified.
Day 8
Challenge C14
Reproducible Build
Build the verifier locally from public source. Resulting binary hash matches canonical published hash. No injected logic.
Day 9
Challenge C15
Silent Failure Resistance
Corrupt signatures, timestamps, anchors, receipts. System fails visibly, identifies the failing layer, refuses partial validation. No silent degradation.
Day 10
The verifier code is public. The prover is sovereign.
Buyers verify what they need to verify.
Operators preserve what they must preserve.
The math holds itself.