Asynchronously determining relational data integrity using cryptographic data structures
US-2021377037-A1 · Dec 2, 2021 · US
US12541802B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-12541802-B2 |
| Application number | US-202117494817-A |
| Country | US |
| Kind code | B2 |
| Filing date | Oct 5, 2021 |
| Priority date | Oct 5, 2020 |
| Publication date | Feb 3, 2026 |
| Grant date | Feb 3, 2026 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A trusted node in a distributed ledger audit system may identify first audit event data for a first audit event from a first computing resource on a messaging bus; generate a first hash of a subset of the first audit event data; write the first audit event data to a storage location; create a first block comprising a subset of the first audit event data and a header comprising the first hash; and write the first block to a scoped distributed ledger. A verification node may generate a third hash from the first hash and a second hash for a second block for a second audit event; create a third block comprising the third hash in a header of the third block and the subset of first audit event data and the subset of second audit even data; and write the second block to an audit distributed ledger.
Opening claim text (preview).
What is claimed is: 1 . A method, comprising: identifying, by a trusted node in a distributed ledger audit system and on a message bus that interfaces with a plurality of computing resources that generate audit events, first audit event data for a first audit event published by a first computing resource of the plurality of computing resources, wherein the first audit event comprises a hardware lifecycle event and the first audit event data comprises a unique identifier for the first computing resource; generating, by the trusted node, a first hash of a subset of the first audit event data; creating, by the trusted node, a first block comprising the subset of the first audit event data and a header comprising the first hash, wherein the first block further comprises an identifier for the first computing resource; writing, by the trusted node, the first block to a first scoped distributed ledger, wherein the first scoped distributed ledger is a private ledger and is associated with infrastructure associated with the first audit event; writing, by the trusted node, a location of the first audit event data on the first scoped distributed ledger to an off-chain storage location; periodically generating, by a verification node in the distributed ledger audit system, a Merkle tree hash of each of a plurality of scoped distributed ledgers including the first scoped distributed ledger, that are associated with the verification node; verifying, by the verification node, the first audit event data by comparing the first audit event data to the first audit event data written to the off-chain storage location; creating, by the verification node, a third block comprising the Merkle tree hash for the first scoped distributed ledger in a header of the third block and the subset of the first audit event data and a subset of second audit event data in a second block on the first scoped distributed ledger; and writing, by the verification node, the third block to an audit distributed ledger. 2 . The method of claim 1 , wherein the plurality of computing resources comprises a computer system, an application, and/or an electronic device that generates first audit event data. 3 . The method of claim 1 , wherein the first hash comprises a SHA-256 hash. 4 . The method of claim 1 , wherein the first hash is generated by a first smart contract. 5 . The method of claim 1 , wherein the Merkle tree hash is generated by a second smart contract. 6 . A system comprising: a plurality of computing resources; a plurality of messaging busses, each of the messaging busses interfacing with the plurality of computing resources; a plurality of trusted nodes, each trusted node associated with one of the plurality of messaging busses; an off-chain storage location in communication with one or more of the plurality of trusted nodes; a plurality of scoped disturbed ledgers, each scoped distributed ledger associated with one of the trusted nodes, wherein each of the scoped distributed ledgers is a private ledger and is associated with infrastructure associated with a first audit event; a plurality of verification nodes, each verification node associated with one of the trusted nodes and with a subset of the plurality of the scoped distributed ledgers; and an audit distributed ledger in communication with the verification nodes; wherein: one of the trusted nodes is configured to receive first audit event data for a first audit event published by a first computing resource of the plurality of computing resources, wherein the first audit event comprises a hardware lifecycle event and the first audit event data comprises a unique identifier for the first computing resource; the trusted node is configured to generate a first hash of a subset of the first audit event data; the trusted node is configured to create a first block comprising the subset of the first audit event data and a header comprising the first hash, wherein the first block further comprises an identifier for the first computing resource; the trusted node is configured to write the first block to a first scoped distribute ledger of the plurality of scoped distributed ledgers; the trusted node is configured to write a location of the first audit event data on the scoped distributed ledger to the off-chain storage location; the verification node is configured to periodically generate a Merkle tree hash of each of a plurality of scoped distributed ledgers including the first scoped distributed ledger, that are associated with the verification node; the verification node is configured to verify the first audit event data by comparing the first audit event data to the first audit event data written to the off-chain storage location; the verification node is configured to create a third block comprising the Merkle tree hash for the first scoped distributed ledger in a header of the third block and the subset of the first audit event data and a subset of second audit event data in a second block on the first scoped distributed ledger; and the verification node is configured to write the third block to the audit distributed ledger. 7 . The system of claim 6 , wherein the audit distributed ledger is a private distributed ledger. 8 . The system of claim 6 , further comprising: an audit viewing computer program executed by an electronic device and in communication with the audit distributed ledger. 9 . The system of claim 8 , wherein the audit viewing computer program is configured to receive an audit query comprising an audit identifier for one of the plurality of computing resource, retrieve audit event data for the audit identifier, verify a chain of custody of the retrieved audit event data, and present the retrieved audit event data and the chain of custody. 10 . A non-transitory computer readable storage medium, including instructions stored thereon, which when read and executed by one or more computer processors, cause the one or more computer processors to perform steps comprising: identifying on a message bus that interfaces with a plurality of computing resources that generate audit events, first audit event data for a first audit event published by a first computing resource of the plurality of computing resources, wherein the first audit event comprises a hardware lifecycle event and the first audit event data comprises a unique identifier for the first computing resource; generating a first hash of a subset of the first audit event data; creating, a first block comprising the subset of the first audit event data and a header comprising the first hash, wherein the first block further comprises an identifier for the first computing resource; writing the first block to a first scoped distributed ledger, wherein the first scoped distributed ledger is a private ledger and is associated with infrastructure associated with the first audit event; writing a location of the first audit event data on the first scoped distributed ledger to an off-chain storage location; periodically generating a Merkle tree hash of each of a plurality of scoped distributed ledgers including the first scoped distributed ledger, that are associated with a verification node; verifying the first audit event data by comparing the first audit event data to the first audit event data written to the off-chain storage location; creating a third block comprising Merkle tree hash for the first scoped distributed ledger in a header of the third block and the subset of first audit event data and the subset of the first audit event data and a subset of second audit event data in a second block on the first scoped distributed ledger; and writing the third block to an audit distribut
using hash chains, e.g. blockchains or hash trees · CPC title
involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD · CPC title
Hash functions, e.g. MD5, SHA, HMAC or f9 MAC · CPC title
Accounting · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.