US 12,381,720 B2
System and method for decentralized confirmation of entries in a directed acyclic graph for rapidly confirming as authentic ledger entries without requiring centralized arbitration of authenticity
Daniel P. Chapple, Falls Church, VA (US)
Assigned to BESKAR, INC., Falls Church, VA (US)
Filed by BESKAR, INC., Falls Church, VA (US)
Filed on Jul. 11, 2023, as Appl. No. 18/220,702.
Claims priority of provisional application 63/368,458, filed on Jul. 14, 2022.
Prior Publication US 2024/0022398 A1, Jan. 18, 2024
Int. Cl. H04L 29/06 (2006.01); H04L 9/00 (2022.01); H04L 9/08 (2006.01); H04L 9/32 (2006.01)
CPC H04L 9/085 (2013.01) [H04L 9/0852 (2013.01); H04L 9/3218 (2013.01); H04L 9/50 (2022.05)] 20 Claims
OG exemplary drawing
 
1. A method for decentralized confirmation of entries in a directed acyclic graph (DAG) for rapidly confirming as authentic ledger entries without centralized arbitration of authenticity, the method comprising:
providing access to at least one user account by applying Shamir Secret Sharing (SSS) to the at least one account, wherein the user account is accessible to a single user and to combined efforts of multiple authorized third-party users appointed by the single user;
cryptographically obfuscating an identity of at least one user account using post-quantum cryptography and transmitting a DAG communication having a quantity of data from the at least one user account to the DAG;
weighting DAG communications via proof-of-work hashing conducted on randomly-selected third-party DAG users;
recording and reconciling DAG communications at nodes that compete to achieve consensus using Secure Asynchronous Byzantine-Resilient Paxos (SABRPaxos) protocol, thereby confirming entries in the DAG; and
incentivizing nodes for quickly recording and reconciling DAG communications by rewarding tokens that are variably determined by calculating the number of communications in a fixed time period and a total number of communications.