A verifier checks a proof that a state transition follows the encoded rules.
LET’S PICTURE IT
A worked solution can come with a compact certificate that a checker validates under a specified mathematical system.
SEE IT FOR YOURSELF
Build a root and follow one membership proofStep 1 / 4
This example hashes UTF-8 A, B, C and D. The displayed hashes are abbreviated, and the tree uses the playground’s sorted-pair convention.
This example hashes UTF-8 A, B, C and D. The displayed hashes are abbreviated, and the tree uses the playground’s sorted-pair convention.Each pair of raw child hashes is sorted, concatenated and hashed. The resulting parent fingerprints commit to their children.Hash the two parents under the same rule to obtain one root commitment. Changing a leaf changes the hashes on its path.The highlighted siblings are B and hash(C,D). Starting with A, the verifier recomputes its path and compares the final result with a trusted root.
Animated local teaching model. No wallet, RPC or live blockchain data. Some labels and hashes are abbreviated for readability.
Proofs relate inputs and outputs
A validity system proves a statement about a state transition or computation. The verifier must bind the correct starting state, resulting state and relevant inputs. A proof is meaningful only for the statement actually checked.
Correct verification is part of the design
Proof-system assumptions, circuits, verifier implementation and upgrade controls affect security. Calling something a proof does not establish that the intended application property was encoded correctly.
Availability is another requirement
Proving a transition is valid does not alone guarantee every user can retrieve all data needed to reconstruct state or exercise an exit. Examine the design’s data-availability arrangement separately.
Validity is not automatic privacy
Zero-knowledge techniques can be used in these systems, but a rollup using proofs does not necessarily hide transaction details. Privacy depends on what the protocol publishes and proves.
QUICK CHECK · NO PRESSURE
Does a validity proof alone guarantee that all underlying data remains available?
Validity and data availability are distinct properties.