20240022398. 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 simplified abstract (BESKAR, INC.)

From WikiPatents
Jump to navigation Jump to search

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

Organization Name

BESKAR, INC.

Inventor(s)

DANIEL P. Chapple of FALLS CHURCH VA (US)

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 - A simplified explanation of the abstract

This abstract first appeared for US patent application 20240022398 titled '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

Simplified Explanation

The patent application describes a method and system for decentralized confirmation of entries in a directed acyclic graph (DAG) to quickly verify the authenticity of ledger entries without the need for centralized arbitration. Here are the key points:

  • User access to an account is granted using Shamir secret sharing, allowing a single user and authorized third-party users to access the account.
  • The identity of the user account is cryptographically obfuscated using post-quantum cryptography, ensuring privacy and security.
  • Data in the form of a DAG communication is transmitted from the user account to the DAG.
  • DAG communications are weighted through proof-of-work hashing conducted by randomly-selected third-party DAG users.
  • Nodes in the network compete to achieve consensus using the SabrPaxos protocol, recording and reconciling the DAG communications to confirm entries in the DAG.
  • Nodes are incentivized by rewarding tokens, the amount of which is determined by the number of communications in a fixed time period and the total number of communications.

Potential applications of this technology:

  • Decentralized financial systems and cryptocurrencies.
  • Supply chain management and tracking.
  • Decentralized identity verification and authentication.
  • Secure and private communication networks.
  • Distributed computing and storage systems.

Problems solved by this technology:

  • Eliminates the need for centralized arbitration, reducing reliance on trusted third parties.
  • Provides a decentralized and tamper-proof ledger system.
  • Enhances privacy and security through cryptographic obfuscation.
  • Enables rapid confirmation of ledger entries without sacrificing authenticity.

Benefits of this technology:

  • Increased transparency and trust in ledger systems.
  • Improved efficiency and scalability compared to traditional centralized systems.
  • Enhanced privacy and security through cryptographic techniques.
  • Incentivizes participation and contribution to the network through token rewards.


Original Abstract Submitted

method and systems for decentralized confirmation of entries in a directed acyclic graph (dag) for rapidly confirming as authentic ledger entries without centralized arbitration of authenticity are provided. access is provided to a user account by applying shamir secret sharing, the user account being accessible to a single user and to combined efforts of multiple authorized third-party users appointed by the single user. an identity of the user account is cryptographically obfuscated using post-quantum cryptography. a dag communication having data is transmitted from the user account to the dag. dag communications are weighted via proof-of-work hashing conducted on randomly-selected third-party dag users, and are recorded and reconciled at nodes that compete to achieve consensus using sabrpaxos protocol, thereby confirming entries in the dag. nodes are incentivized by rewarding tokens that are variably determined by calculating the number of communications in a fixed time period and a total number of communications.