Blockchain endorsement with approximate hash verification
View Patent ↗An example operation may include one or more of transmitting, from a client application, a proposed storage request to a plurality of endorser nodes of a blockchain, receiving a first endorsement of the storage request from a first endorser node, the first endorsement comprising a full-step hash verification of the proposed storage request, receiving a second endorsement of the storage request from a second endorser node, the second endorsement comprising a reduced-step hash verification of the storage request, and transmitting a storage proposal including the full-step hash endorsement and the reduced-step hash endorsement to an ordering node of the blockchain.
1. A computing system comprising:
a network interface configured to receive, from a client application, a storage request that comprises a full-step hash of a data value signed by the client application and a reduced-step hash of the data value signed by the client application; and
a hardware processor configured to determine whether to verify the full-step hash of the storage request or the reduced-step hash of the storage request, and in response to a determination to verify the reduced-step hash of the storage request, generate an approximate hash verification for the reduced-step hash of the data value,
wherein the processor further controls the network interface to transmit an endorsement response which includes the generated approximate hash verification.
2. The computing system of claim 1 , wherein the network interface further transmits an indicator within the endorsement response which indicates that the approximate hash verification has been performed.
3. The computing system of claim 1 , wherein the full-step hash of the data value is generated by repeated performance of a function a first predetermined number of times, and the reduced-step hash of the data value is generated by repeated performance of the function a second predetermined number of times that is less than the first predetermined number of times.
4. The computing system of claim 1 , wherein the storage request comprises a blockchain entry to be stored in a data block among a hash-linked chain of data blocks.
5. The computing system of claim 1 , wherein the processor is further configured to execute the proposed storage request and generate a hash of the proposed storage request with a reduced-step hash.
6. A method comprising:
receiving, from a client application, a storage request that comprises a full-step hash of a data value signed by the client application and a reduced-step hash of the data value signed by the client application;
determining whether to verify the full-step hash of the storage request or the reduced-step hash of the storage request;
in response to a determination to verify the reduced-step hash of the storage request, generating an approximate hash verification for the reduced-step hash of the data value; and
transmitting an endorsement response to the client application which includes the generated approximate hash verification.
7. The method of claim 6 , wherein the transmitting further comprises transmitting an indicator within the endorsement response indicating the approximate hash verification has been performed.
8. The method of claim 6 , wherein the full-step hash of the data value is generated by repeated performance of a function a first predetermined number of times, and the reduced-step hash of the data value is generated by repeated performance of the function a second predetermined number of times that is less than the first predetermined number of times.
9. The method of claim 6 , wherein the storage request comprises a blockchain entry for storage within a data block among a hash-linked chain of data blocks.
10. The method of claim 9 , further comprising executing the proposed storage request and generating a hash of the proposed storage request with a reduced-step hash.