US 11,949,788 B1
System and method to shorten cryptographic proofs
Jerónimo Irazábal, Buenos Aires (AR); Moshe Bar, Houston, TX (US); and Dennis Zimmer, Kuessnacht am Rigi (CH)
Assigned to CodeNotary Inc., Bellaire, TX (US)
Filed by CodeNotary Inc., Bellaire, TX (US)
Filed on Oct. 22, 2021, as Appl. No. 17/508,916.
Claims priority of provisional application 63/116,847, filed on Nov. 21, 2020.
Int. Cl. H04L 9/32 (2006.01)
CPC H04L 9/3218 (2013.01) [H04L 9/3242 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A computer-implemented method of constructing cryptographic proofs, comprising:
under control of one or more computer systems configured with executable instructions and operatively coupled to a communications channel and non-transitory data store comprising a cryptographically-linked transaction data file, said cryptographically-linked transaction data file comprising a plurality of cryptographically-linked transaction records, and an incremental hash tree having a plurality of leaves, wherein each leaf corresponds to a different cryptographically-linked transaction record in the cryptographically-linked transaction file, receiving over the communications channel a first cryptographic proof request pertaining to a subject transaction that has been stored in a subject transaction record in the cryptographically-linked transaction data file;
generating first cryptographic proof data pertaining to the subject transaction, wherein the first cryptographic proof data comprises binary cryptographic proof data from the incremental hash tree and linear cryptographic proof data from the cryptographically-linked transaction data file; and
transmitting the first cryptographic proof data over the communications channel in response to the cryptographic proof request.