Blockchain endorsement with approximate hash verification

1. A computing system comprising:

a network interface configured to transmit, from a client application, a proposed storage request to a plurality of endorser nodes of a blockchain; and

a processor configured to receive, via the network interface, a first endorsement of the storage request from a first endorser node, where the first endorsement comprises a full-step hash verification of the proposed storage request, and receive a second endorsement of the storage request from a second endorser node, where the second endorsement comprises a reduced-step hash verification of the storage request,

wherein the network interface is further configured to transmit full-step hash of the storage request signed by the client application and a reduced-step hash of the storage request signed by the client application to the plurality of endorser nodes.

2. The computing system of claim 1 , wherein the processor is further configured to control the network interface to transmit a storage proposal that includes the full-step hash endorsement and the reduced-step hash endorsement to an orderer node of the blockchain.

3. The computing system of claim 1 , wherein the full-step hash verification comprises a verification of the full-step hash signed by the client application and the reduced-step hash verification comprises an approximate verification of the reduced-step hash signed by the client application.

4. The computing system of claim 1 , wherein a length of a data value created by the reduced-step hash of the proposed storage request is equal to a length of a data value created by the full-step hash of the proposed storage request.

5. The computing system of claim 1 , wherein the full-step hash comprises repeated performance of a function on a data value of the proposed storage request a first predetermined number of times, and the reduced-step hash comprises repeated performance of the function on the data value of the proposed storage request a second predetermined number of times that is less than the first predetermined number of times.

6. The computing system of claim 1 , wherein the second endorsement is received via a message which comprises a message element that indicates the message comprises the reduced-step hash verification.

7. The computing system of claim 1 , wherein the proposed storage request comprises a blockchain entry to be stored in a data block among a hash-linked chain of data blocks.

8. A method comprising:

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; and

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;

wherein a full-step hash of the proposed storage request signed by the client application and a reduced-step hash of the storage request signed by the client application to the plurality of endorser nodes is transmitted.

9. The method of claim 8 , wherein the transmitting further comprises transmitting a storage proposal including the full-step hash endorsement and the reduced-step hash endorsement to an ordering node of the blockchain.

10. The method of claim 8 , wherein the full-step hash verification comprises a verification of the full-step hash of the proposed storage request signed by the client application and the reduced-step hash verification comprises an approximate verification of the reduced-step hash of the proposed storage request signed by the client application.

11. The method of claim 8 , wherein a length of a data value created by the reduced-step hash of the proposed storage request is equal to a length of a data value created by the full-step hash of the proposed storage request.

12. The method of claim 8 , wherein the full-step hash comprises repeated performance of a function on a data value of the proposed storage request a first predetermined number of times, and the reduced-step hash comprises repeated performance of the function on the data value of the proposed storage request a second predetermined number of times that is less than the first predetermined number of times.

13. The method of claim 8 , wherein the second endorsement is received via a message which comprises a message element indicating the message comprises the reduced-step hash verification.

14. The method of claim 8 , wherein the proposed storage request comprises a blockchain entry to be stored in a data block among a hash-linked chain of data blocks.

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

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

a full-step hash of the proposed storage request signed by the client application and a reduced-step hash of the storage request signed by the client application to the plurality of endorser nodes is transmitted.

16. The non-transitory computer readable medium of claim 15 , wherein the transmitting further comprises transmitting a storage proposal including the full-step hash endorsement and the reduced-step hash endorsement to an ordering node of the blockchain.

17. The non-transitory computer readable medium of claim 15 , wherein the full-step hash verification comprises a verification of the full-step hash of the proposed storage request signed by the client application and the reduced-step hash verification comprises an approximate verification of the reduced-step hash of the proposed storage request signed by the client application.

18. The non-transitory computer readable medium of claim 15 , wherein a length of a data value created by the reduced-step hash of the proposed storage request is equal to a length of a data value created by the full-step hash of the proposed storage request.

19. The non-transitory computer readable medium of claim 15 , wherein the full-step hash comprises repeated performance of a function on a data value of the proposed storage request a first predetermined number of times, and the reduced-step hash comprises repeated performance of the function on the data value of the proposed storage request a second predetermined number of times that is less than the first predetermined number of times.

20. The non-transitory computer readable medium of claim 15 , wherein the second endorsement is received via a message which comprises a message element indicating the message comprises the reduced-step hash verification.