Transaction assignment method and apparatus based on structured directed acyclic graph
US12079804B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jan 8, 2019 |
| Grant date | Sep 3, 2024 |
| Priority date | — |
| Expiry date | Jan 6, 2041 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L67/1097
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Transaction assignment method and apparatus based on a structured directed acyclic graph (DAG) executed by node devices in a peer-to-peer network are provided including: obtaining data structure of a local database; calculating relative hashing power of each node device by connection information between blocks in the structured DAG; partitioning transactions in the local transaction pool according to the relative hashing power of each node device; based on partitioning result, selecting a first transaction, creating a first new block, establishing connection(s) between the first new block and other blocks in the structured DAG, and removing the first transaction from the local transaction pool; broadcasting the first new block to other node devices in the peer-to-peer network. The invention effectively eliminates waste of hashing power caused by processing transactions with high fees by multiple nodes and increases the chance of processing transactions with low or no fees without sacrificing security and decentralization.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.