Using a tree structure to segment and distribute records across one or more decentralized, acylic graphs of cryptographic hash pointers
US10193696B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Mar 10, 2018 |
| Grant date | Jan 29, 2019 |
| Priority date | — |
| Expiry date | Mar 10, 2038 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L9/50
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
Provided is a process including: receiving with one or more processors, a first request to store a record from a computing entity; encoding, with one or more processors, the record in a first plurality of segments; arranging, with one or more processors, the first plurality of segments in respective content nodes of a first content graph, wherein at least some content nodes of the first content graph have two or more content edges of the first content graph pointing to two or more respective other content nodes of the first content graph; and storing, with one or more processors, the content nodes of the first content graph in a verification graph.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.