The Fintech Builder · D30-F05-A05

Trace the path. State what it proves.

Three groups, four journals. Verify the whole correction group with one sibling hash, then explore odd-size paths and tampering under an independently supplied demonstration root.

Proof scenario

Speed

Submitted tree size · entries

Selected zero-based leaf index

Declared global group index

Submitted sibling count

Diagram labels are digest prefixes for navigation. Full exact hashes below are the proof data.

Selected leaf hash · SHA256(00 || entry)

Reconstructed root · exact hex

Independent expected root · exact hex

Every revealed sibling hash step

Declared batch tree

Inspect exact entry bytes, proof and expected commitment

The submitted proof can differ from the declared original tree in tampering scenarios. Source financial validity is not evaluated by this byte core.

Explain the outcome

Financial source and G framing: not evaluated by this mathematical core.

Selected fixture
Scope and batch
Byte-entry kind
Native SHA-256
Declared source tree root
Full verification outcome
Metadata mismatch fields

This is a guided reveal of one completed calculation, not a claim of partial assurance while a path is unfinished.

A trusted root is a separate verification input. Recomputing a root from the same caller data establishes local consistency, not independent trust.

Opaque bytes do not authenticate their adjacent scope labels. The Hash adapter must validate canonical G, its semantic scope and complete source coverage.

A full-prefix checkpoint additionally requires start group 1 and actual complete history. Inclusion does not prove freshness, signer authority, non-equivocation or external retention.