IP Library › Granted Patent US 12,531,720
Granted Patent B2
US 12,531,720 · App. 18/142,452 · Granted Jan 20, 2026

Committing data to blockchain based on approximate hash verification

Inventor: Praveen Jayachandran (Bangalore, IN)
Assignee: International Business Machines Corporation
H04L9/0643G06F16/1805G06F16/1824G06F16/1834G06F16/2246G06Q20/382H04L9/50
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,531,720
App. No.
18/142,452
Filed
May 2, 2023
Granted
Jan 20, 2026
Kind
B2
Art Unit
2431
USPC
713/150
Abstract

An example operation may include one or more of receiving a data block for storage on a blockchain from an orderer node, the data block comprising a full-step hash of a storage request and a reduced-step hash of the storage request, performing an approximate hash verification on the data block based on the reduced-step hash of the storage request included in the data block, and in response to a success of the approximate hash verification, committing the data block among a hash-linked chain of data blocks stored within a distributed ledger of a blockchain.

Claims (45)

1 . A computing system comprising:

a hardware processor configured to

receive a data block comprising a blockchain transaction stored therein and a reduced-step hash value of the blockchain transaction and a full-step hash value of the blockchain transaction;

determine to verify the blockchain transaction using the reduced-step hash value instead of the full-step hash value based on an identifier stored in the blockchain transaction;

in response to the determination, verify the data block against a current state of the blockchain ledger via execution of a predefined hash function a predetermined number of times to generate a corresponding reduced-step hash value and compare the corresponding reduced-step hash value to the reduced-step hash value; and

commit the verified data block to a blockchain ledger.

2 . The computing system of claim 1 , wherein in response to a success of the reduced hash verification, the hardware processor is configured to commit the data block including the blockchain transaction to a hash-linked chain of data blocks within the blockchain ledger of the computing system.

3 . The computing system of claim 1 , wherein the blockchain transaction is represented within a Merkle tree data structure of the data block.

4 . The computing system of claim 1 , wherein the hardware processor is further configured to determine whether to perform a full hash verification or the reduced hash verification to verify the blockchain transaction using the reduced-step hash value based on a blockchain policy of the blockchain ledger.

5 . The computing system of claim 1 , wherein the hardware processor is configured to execute the predefined hash function on the blockchain transaction the predetermined number of times to generate a corresponding reduced-step hash value of the blockchain transaction for verification without generation of a corresponding full-step hash value of the blockchain transaction.

6 . The computing system of claim 1 , wherein the hardware processor is further configured to, in response to a failed verification, commit the data block to the blockchain ledger with an indicator that the verification of the blockchain transaction failed.

7 . The computing system of claim 1 , wherein the hardware processor is configured to store verification results in the data block of the hash-linked chain of blocks and store a file included in the blockchain transaction within an off-chain storage device.

8 . A method comprising:

receiving a data block comprising a blockchain transaction stored therein, a reduced-step hash value of the blockchain transaction, and a full-step hash value of the blockchain transaction;

determining to verify the blockchain transaction using the reduced-step hash value instead of the full-step hash value based on an identifier stored in the blockchain transaction;

in response to the determination, verifying the data block against a current state of the blockchain ledger via execution of a predefined hash function a predetermined number of times to generate a corresponding reduced-step hash value and compare the corresponding reduced-step hash value to the reduced-step hash value; and

commit the verified data block to a blockchain ledger.

9 . The method of claim 8 , wherein in response to a success of the reduced hash verification, the method comprises committing the data block including the blockchain transaction to a hash-linked chain of data blocks within the blockchain ledger of the computing system.

10 . The method of claim 8 , wherein the blockchain transaction is represented within a Merkle tree data structure of the data block.

11 . The method of claim 8 , further comprising determining to verify the blockchain transaction using the reduced-step hash value based on a blockchain policy.

12 . The method of claim 8 , wherein the verifying comprises executing the predefined hash function on the blockchain transaction the predetermined number of times to generate a corresponding reduced-step hash value of the blockchain transaction without generating a corresponding full-step hash value of the blockchain transaction.

13 . The method of claim 8 , further comprising in response to a failed verification, committing the data block to the blockchain ledger with an indicator that verification of the blockchain transaction failed.

14 . The method of claim 8 , wherein the committing comprises storing verification results in the data block of the hash-linked chain of blocks and storing a file included in the blockchain transaction within an off-chain storage device.

15 . A non-transitory computer readable medium comprising instructions, that when read by a processor, cause the processor to perform a method comprising:

receiving a data block comprising a blockchain transaction stored therein, a reduced-step hash value of the blockchain transaction, and a full-step hash value of the blockchain transaction;

determining to verify the blockchain transaction using the reduced-step hash value instead of the full-step hash value based on an identifier stored in the blockchain transaction; and

in response to the determination, verifying the data block against a current state of the blockchain ledger via execution of a predetermined hash function a predetermined number of times to generate a corresponding reduced-step hash value and compare the corresponding reduced-step hash value to the reduced-step hash value; and

commit the verified data block to a blockchain ledger.

16 . A computing system comprising:

a hardware processor configured to arrange a blockchain transaction within a data block based on time information, wherein the blockchain transaction includes a full-step hash value and a reduced-step hash value for verification of the blockchain transaction with respect to a blockchain ledger, and the hardware processor is further configured to add an identifier to the blockchain transaction which identifies whether to verify the blockchain transaction using the full-step hash value or the reduced-step hash value; and

a network interface configured to broadcast the data block to a plurality of blockchain peer nodes of the blockchain ledger,

wherein the full-step hash value is generated by application of a predefined hash function a first predetermined number of times on a blockchain transaction and the reduced-step hash value is generated by application of the predefined hash function a second predetermined number of times on the blockchain transaction that is less than the first predetermined number of times.

17 . The computing system of claim 16 , wherein the function comprises a non-linear hash function that is applied to content within the blockchain transaction.

18 . The computing system of claim 16 , wherein a length of a data value created by a full-step hash operation on the blockchain transaction is equal to a length of a data value created by a reduced-step hash operation on the blockchain transaction.

19 . The computing system of claim 16 , wherein the hardware processor is configured to arrange the reduced-step hash value within the data block in a chronological order.

20 . The computing system of claim 16 , wherein the hardware processor is further configured to store the full-step hash value with the reduced-step hash value in the data block.

21 . A method comprising:

arranging a blockchain transaction within a data block based on timing information, wherein the blockchain transaction includes a full-step hash value and a reduced-step hash value for verification of the blockchain transaction with respect to a blockchain ledger;

adding an identifier to the blockchain transaction which identifies whether to verify the blockchain transaction using the full-step hash value or the reduced-step hash value; and

broadcasting the data block to a plurality of blockchain peer nodes of the blockchain ledger,

wherein the full-step hash value is generated by application of a predefined hash function a first predetermined number of times on the blockchain transaction and the reduced-step hash value is generated by application of the predefined hash function a second predetermined number of times on the blockchain transaction that is less than the first predetermined number of times.

22 . The method of claim 21 , wherein the function comprises a non-linear hash function that is applied to content within the blockchain transaction.

23 . The method of claim 21 , wherein a length of a data value created by a full-step hash operation on the blockchain transaction is equal to a length of a data value created by a reduced-step hash operation on the blockchain transaction.

24 . The method of claim 21 , wherein the arranging comprises arranging the reduced-step hash value within the data block in a chronological order.

25 . The method of claim 21 , wherein the method further comprises storing the full-step hash value with the reduced-step hash value in the data block.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 2, 2023
From: JAYACHANDRAN, PRAVEEN
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 063512/0290 →
Continuity (2)
Continuation 16424765 · May 29, 2019
Related Publication 20230275743A1 · Aug 31, 2023
References Cited (114)
US 5990810A · Williams · 1999 [cited by applicant]
US 6769060B1 · Dent · 2004 [cited by examiner]
US 7363500B2 · Funk · 2008 [cited by applicant]
US 7451325B2 · Aaron · 2008 [cited by applicant]
US 7921283B2 · Hayes · 2011 [cited by applicant]
US 8024488B2 · Salowey et al. · 2011 [cited by applicant]
US 8099605B1 · Billsröm et al. · 2012 [cited by applicant]
US 8316442B2 · Prahalad · 2012 [cited by applicant]
US 8614641B2 · Yule et al. · 2013 [cited by applicant]
US 8705734B2 · Lee et al. · 2014 [cited by applicant]
US 8914641B2 · Gopal et al. · 2014 [cited by applicant]
US 9038133B2 · Chellappa et al. · 2015 [cited by applicant]
US 9396243B1 · Halevi et al. · 2016 [cited by applicant]
US 9906552B1 · Brown et al. · 2018 [cited by applicant]
US 10678654B2 · Pogosyan et al. · 2020 [cited by applicant]
US 10719373B1 · Koponen et al. · 2020 [cited by applicant]
US 10747883B2 · Packer et al. · 2020 [cited by applicant]
US 10756904B1 · Perlman et al. · 2020 [cited by applicant]
US 11005664B2 · Chalkias · 2021 [cited by applicant]
US 11038857B1 · Paczkowski et al. · 2021 [cited by applicant]
US 11140077B2 · Munson et al. · 2021 [cited by applicant]
US 11151276B1 · Wang et al. · 2021 [cited by applicant]
US 11164115B1 · Todd et al. · 2021 [cited by applicant]
US 11297500B2 · Jain · 2022 [cited by applicant]
US 11308036B2 · Gonczi et al. · 2022 [cited by applicant]
US 11386217B2 · Greven · 2022 [cited by applicant]
US 11711202B2 · Jayachandran · 2023 [cited by applicant]
US 12034859B2 · Davies et al. · 2024 [cited by applicant]
US 20040111610A1 · Slick · 2004 [cited by examiner]
US 20050125663A1 · Funk · 2005 [cited by applicant]
US 20060072144A1 · Dowling et al. · 2006 [cited by applicant]
US 20060075246A1 · Suga · 2006 [cited by applicant]
US 20070162894A1 · Noller et al. · 2007 [cited by applicant]
US 20090089584A1 · Bender et al. · 2009 [cited by applicant]
US 20090254754A1 · Bellur et al. · 2009 [cited by applicant]
US 20100318989A1 · Dureau et al. · 2010 [cited by applicant]
US 20110066628A1 · Jayaraman · 2011 [cited by applicant]
US 20120233693A1 · Stites et al. · 2012 [cited by applicant]
US 20130246378A1 · Hearnden et al. · 2013 [cited by applicant]
US 20140019764A1 · Gopal et al. · 2014 [cited by applicant]
US 20140075180A1 · Farrugia et al. · 2014 [cited by applicant]
US 20140164775A1 · Wu et al. · 2014 [cited by applicant]
US 20160099810A1 · Li et al. · 2016 [cited by applicant]
US 20160379212A1 · Bowman · 2016 [cited by examiner]
US 20170255765A1 · Anderson et al. · 2017 [cited by applicant]
US 20170286233A1 · Dain et al. · 2017 [cited by applicant]
US 20170300877A1 · Mann et al. · 2017 [cited by applicant]
US 20170324555A1 · Wu et al. · 2017 [cited by applicant]
US 20180006807A1 · Suresh et al. · 2018 [cited by applicant]
US 20180095941A1 · Ciabarra, Jr. et al. · 2018 [cited by applicant]
US 20180097779A1 · Karame et al. · 2018 [cited by applicant]
US 20180097842A1 · Roskind et al. · 2018 [cited by applicant]
US 20180109516A1 · Song et al. · 2018 [cited by applicant]
US 20180157839A1 · Pearson · 2018 [cited by applicant]
US 20180174037A1 · Henry · 2018 [cited by applicant]
US 20190147190A1 · Marin · 2019 [cited by applicant]
US 20190228386A1 · Onnainty et al. · 2019 [cited by applicant]
US 20190279241A1 · DiTomaso · 2019 [cited by applicant]
US 20190394023A1 · Menon et al. · 2019 [cited by applicant]
US 20200005282A1 · Kim · 2020 [cited by applicant]
US 20200027093A1 · Volk · 2020 [cited by applicant]
US 20200034039A1 · Jiang et al. · 2020 [cited by applicant]
US 20200143469A1 · Stewart et al. · 2020 [cited by applicant]
US 20200167339A1 · Manevich et al. · 2020 [cited by applicant]
US 20200174679A1 · Scott et al. · 2020 [cited by applicant]
US 20200204349A1 · Sardesai · 2020 [cited by examiner]
US 20200252202A1 · Madl et al. · 2020 [cited by applicant]
US 20200278963A1 · Destefanis et al. · 2020 [cited by applicant]
US 20200294048A1 · Ye · 2020 [cited by applicant]
US 20200327098A1 · Gonczi · 2020 [cited by examiner]
US 20200358612A1 · Vigneron et al. · 2020 [cited by applicant]
US 20200358619A1 · Ding et al. · 2020 [cited by applicant]
US 20200364205A1 · Novotny et al. · 2020 [cited by applicant]
US 20200374113A1 · Noam et al. · 2020 [cited by applicant]
US 20200379856A1 · Jayachandran · 2020 [cited by applicant]
US 20200380154A1 · Jayachandran · 2020 [cited by applicant]
US 20200382279A1 · Jayachandran · 2020 [cited by applicant]
US 20200382280A1 · Jayachandran · 2020 [cited by applicant]
US 20200382309A1 · Jayachandran · 2020 [cited by applicant]
US 20200382310A1 · Jayachandran · 2020 [cited by applicant]
US 20200412549A1 · Endo · 2020 [cited by applicant]
US 20210201328A1 · Gunther · 2021 [cited by applicant]
US 20210243007A1 · Kramer et al. · 2021 [cited by applicant]
US 20210377041A1 · Covaci et al. · 2021 [cited by applicant]
US 20220147961A1 · Yoon et al. · 2022 [cited by applicant]
US 20220164791A1 · Yoon et al. · 2022 [cited by applicant]
US 20220292214A1 · Jayachandran · 2022 [cited by applicant]
US 20230046965A1 · Jayachandran · 2023 [cited by applicant]
US 20230078996A1 · Jayachandran · 2023 [cited by applicant]
US 20230334036A1 · Covaci · 2023 [cited by examiner]
CN 105243320A · 2016 [cited by applicant]
CN 107807951A · 2018 [cited by applicant]
CN 109409889A · 2019 [cited by applicant]
CN 112019586A · 2020 [cited by applicant]
WO 2018207064A1 · 2018 [cited by applicant]
List of IBM Patents or Patent Applications Treated as Related, Jun. 3, 2023. [cited by applicant]
P. Jayachandran , “Approximate Hash Verification for Blockchain”, U.S. Appl. No. 16/424,588, filed May 5, 2019. [cited by applicant]
P. Jayachandran , “Peer Node Recovery Via Approximate Hash Verification”, U.S. Appl. No. 16/424,612, filed May 5, 2019. [cited by applicant]
P. Jayachandran , “Peer Node Recovery Via Approximate Hash Verification”, U.S. Appl. No. 17/981,402, filed Nov. 5, 2022. [cited by applicant]
P. Jayachandran , “Approximate Hash Verification Of Unused Blockchain Output”, U.S. Appl. No. 16/424,644, filed May 5, 2019. [cited by applicant]
P. Jayachandran , “Approximate Hash Verification Of Unused Blockchain Output”, U.S. Appl. No. 17/948,324, filed Sep. 20, 2022. [cited by applicant]
P. Jayachandran , “Reduced-Step Blockchain Verification Of Media File”, U.S. Appl. No. 16/424,671, filed May 5, 2019. [cited by applicant]
P. Jayachandran , “Reduced-Step Blockchain Verification Of Media File”, U.S. Appl. No. 17/976,834, filed Oct. 30, 2022. [cited by applicant]
P. Jayachandran , “Blockchain Endorsement With Approximate Hash Verification”, U.S. Appl. No. 16/424,706, filed May 29, 2019. [cited by applicant]
P. Jayachandran , “Blockchain Endorsement With Approximate Hash Verification”, U.S. Appl. No. 17/751,353, filed May 23, 2022. [cited by applicant]
P. Jayachandran , “Committing Data to Blockchain Based on Approximate Hash Verification”, U.S. Appl. No. 16/424,765, filed May 29, 2019. [cited by applicant]
Carraher, “Approximate Clustering Algorithms for High Dimensional Streaming and Distributed Data”, Diss. University of Cincinnati, 2018. [cited by applicant]
Dryja, Utreexo: a dynamic hash-based accumulator optimized for the Bitcoin UTXO set, Cryptology ePrint Archive, 2019. [cited by applicant]
Kruber et al., “Approximate hash-based set reconciliation for distributed replica repair.” Reliable Distributed Systems (SRDS), 2015 IEEE 34th Symposium on. IEEE, 2015. [cited by applicant]
Lai et al. “Simultaneous feature learning and hash coding with deep neural networks.” Proceedings of the IEEE conference on computer vision and pattern recognition. 2015. [cited by applicant]
Luo et al., Fast Scalable Supervised Hashing. Proceedings SIGIR' 18, Jul. 8-12, 2018, Ann Arbor, MI, USA, pp. 735-744 (Year: 2018). [cited by applicant]
Sethumadhavan et al. “Scalable hardware memory disambiguation for high ILP processors.” Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture. IEEE Computer Society, 2003. [cited by applicant]
Xia et al. “Supervised hashing for image retrieval via image representation learning.” AAAI. vol. 1. No. 2014. 2014. [cited by applicant]
Yang et al., “Supervised learning of semantics-preserving hash via deep convolutional neural networks.” IEEE transactions on pattern analysis and machine intelligence 40.2 (2018): 437-451. [cited by applicant]