Expand description
Entry-relative SHA-384 proofs. Integrity against a supplied root is not authority.
Structs§
- Outboard
Node - Span
Limits - Caller policy bounds only. Actual buffers need their existing runtime charge; these numeric ceilings are never a resource reservation or authority token.
- Tree
Builder - 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.
- Tree
Spec - Structurally checked tree parameters, not authenticated publisher metadata.
- Verified
Leaf Span
Enums§
Constants§
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.