Skip to main content

Module proof

Module proof 

Source
Expand description

Entry-relative SHA-384 proofs. Integrity against a supplied root is not authority.

Structs§

OutboardNode
SpanLimits
Caller policy bounds only. Actual buffers need their existing runtime charge; these numeric ceilings are never a resource reservation or authority token.
TreeBuilder
Fixed-memory sequential builder. A failed or panicking observer poisons the builder: no root can subsequently be obtained. Sink durability/commit remains a separate publication gate; emitted nodes are only candidate digests.
TreeSpec
Structurally checked tree parameters, not authenticated publisher metadata.
VerifiedLeafSpan

Enums§

ProofError
Representation

Constants§

LEAF_BYTES
MAX_LOGICAL_BYTES
MAX_SIBLINGS
MAX_SPAN_BYTES
MAX_SPAN_LEAVES

Functions§

decode_proof
empty_root
encode_proof
leaf_hash
verify_leaf
Verify exact bytes against a supplied root. This does not authorize consumption.
verify_leaf_span
Each proof uses the existing exact sibling codec. Proof i authenticates leaf first+i; omitted/trailing bytes, partial boundary leaves and trailing proof bytes refuse. Typed sibling scratch is reused, not allocated. The caller must match BOTH the complete TreeSpec and root to its recognized entry selection.