I-D Action: draft-reilly-plants-bulk-subtree-proofs-00.txt

Internet-Draft draft-reilly-plants-bulk-subtree-proofs-00.txt is now
available.

   Title:   Bulk Subtree Consistency Proofs for Merkle Tree Certificates
   Author:  Lawrence J. Reilly
   Name:    draft-reilly-plants-bulk-subtree-proofs-00.txt
   Pages:   13
   Dates:   2026-07-27

Abstract:

   Merkle Tree Certificates require relying parties to periodically
   obtain a set of active landmark subtrees and verify each is
   consistent with a reference checkpoint of the issuance log.  As
   specified, this requires one subtree consistency proof per landmark
   subtree.  Because the active landmark subtrees form a contiguous
   range of the log, their individual consistency proofs share the great
   majority of their interior nodes, and verifying them independently
   carries substantial redundancy.

   This document defines a bulk subtree consistency proof, which
   verifies an entire set of landmark subtrees against a single
   reference checkpoint using proof material logarithmic in the size of
   the log, rather than logarithmic per subtree.  It is a size
   optimization for the relying party update channel and introduces no
   change to certificate verification or to the security properties of
   Merkle Tree Certificates.

   The construction in this document has not yet been validated against
   a reference implementation.  It is published to solicit review of the
   approach.  Open items are recorded in an appendix.

The IETF datatracker status page for this Internet-Draft is:
https://datatracker.ietf.org/doc/draft-reilly-plants-bulk-subtree-proofs/

There is also an HTMLized version available at:
https://datatracker.ietf.org/doc/html/draft-reilly-plants-bulk-subtree-proofs-00

Internet-Drafts are also available by rsync at:
rsync.ietf.org::internet-drafts


_______________________________________________
I-D-Announce mailing list -- [email protected]
To unsubscribe send an email to [email protected]