I-D Action: draft-reilly-rem-triple-fingerprint-01.txt

Internet-Draft draft-reilly-rem-triple-fingerprint-01.txt is now available.

   Title:   The Triple-Fingerprint Permanence Chain and the First Attested Triple-Fingerprint Record Under the Reilly EternaMark (REM) Protocol
   Author:  Lawrence John Reilly Jr.
   Name:    draft-reilly-rem-triple-fingerprint-01.txt
   Pages:   34
   Dates:   2026-08-24

Abstract:

   This document specifies the Triple-Fingerprint Permanence Chain, a
   hash-linked record chain in which every link is computed
   independently under SHA-256 [RFC6234], SHA3-512 [FIPS202], and
   BLAKE3 [BLAKE3SPEC], and in which each link commits to all three
   predecessor links so that the three chains are entangled rather
   than parallel.  A verifier that checks all three link algorithms
   must be defeated by simultaneous collisions in three structurally
   distinct hash constructions on the same input.

   This document also re-attests, with corrections, the genesis record
   of that chain: the permanence record produced on 22 March 2026 by a
   live implementation of the Reilly EternaMark (REM) Protocol
   [DRAFT-REM-02], carrying simultaneous SHA-256, SHA3-512, and BLAKE3
   fingerprints of a single artifact anchored across Bitcoin
   timestamping via OpenTimestamps [OTS], IPFS [IPFS], Zenodo DOI
   registration [ZENODO], the Internet Archive Wayback Machine [IA], a
   persistent database layer, and a resolvable REMID identifier.

   This revision supersedes draft-reilly-rem-triple-fingerprint-00 and
   corrects three defects in it.  First, -00 published the Bitcoin
   layer's OpenTimestamps receipts as evidence of blockchain anchoring
   when those receipts were pending calendar commitments carrying no
   Bitcoin attestation.  Second, -00's post-quantum analysis applied
   Grover's algorithm [GROVER] to preimage resistance while the
   security property that actually binds a permanence record is
   collision resistance, which Grover does not meaningfully reduce.
   Third, -00 asserted that combining three hash algorithms multiplies
   security; by the multicollision result of [JOUX], the collision
   resistance of such a combination is bounded near that of its
   strongest member rather than the sum of its members.  The value of
   the combination is algorithmic hedging, which is a different and
   more defensible claim.

   Precedence claims made in -00 are narrowed to scoped, falsifiable
   statements and are accompanied by an expanded treatment of prior
   art, in particular the Evidence Record Syntax [RFC4998].

The IETF datatracker status page for this Internet-Draft is:
https://datatracker.ietf.org/doc/draft-reilly-rem-triple-fingerprint/

There is also an HTMLized version available at:
https://datatracker.ietf.org/doc/html/draft-reilly-rem-triple-fingerprint-01

A diff from the previous version is available at:
https://author-tools.ietf.org/iddiff?url2=draft-reilly-rem-triple-fingerprint-01

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]