Blockchain transaction comprising runnable code for hash-based verification
A computer-implemented method comprising, at a verifying nodes of a blockchain network: obtaining a first transaction which comprises runnable code; receiving a second transaction which includes information comprising at least a submitted instance of an r-part and an s-part of a first ECDSA signature, and further comprising a nonce; and miming the code from the first transaction. The code is configured to verify that H PoW (ƒ(r, d)) meets a predetermined condition defined in the code, and to return a result of true on condition thereof, where r is the submitted instance of the r-part, d is the nonce, H PoW is a hash function, and f is a function combining q and d.
1. A computer-implemented method comprising, at a verifying node of a blockchain network:
obtaining a first transaction which comprises runnable code;
receiving a second transaction which includes information comprising at least a submitted instance of an r-part and an s-part of a first Elliptic Curve Digital Signature Algorithm (ECDSA) signature, and further comprising a nonce;
running the code from the first transaction, wherein the code is configured to verify that H PoW (f(r,d)) meets a predetermined condition defined in the code, wherein said predetermined condition is that H PoW (f(r,d)) is less than or greater than a predetermined target value, is within a predetermined range, or has a predetermined minimum number of leading zeros, and to return a result of true on condition of said verifying that H PoW (f(r,d)) meets the predetermined condition defined in the code, where r is the submitted instance of the r-part, d is the nonce, H PoW is a hash function, and f is a function combining r and d.
2. The method of claim 1 , wherein f is a concatenation r∥d.
3. The method of claim 1 , further comprising:
obtaining a public key wherein the first ECDSA signature signs a message based on a private key corresponding to the public key, wherein the message is a part of the second transaction; and
applying an ECDSA verification function to verify the first ECDSA signature received in the second transaction based on the public key and the message, wherein the code is configured to return the result of true on further condition of said verification of the first ECDSA signature.
4. The method of any of claim 3 , wherein the code further comprises a reference value corresponding to the r-part of the first ECDSA signature, wherein the reference value is a reference instance of the r-part or a transformation of the r-part; and
the code is configured to check that the reference value corresponds to the reference instance of the r-part received in the second transaction, and return the result of true on further condition that the reference value corresponds to the reference instance of the r-part received in the second transaction based on said check.
5. The method of claim 4 , wherein said reference value is a reference instance of the r-part of the ECDSA signature.
6. The method of claim 5 , wherein the code is configured to perform:
check that H PoW (f(r,d)) meets the predetermined condition, and
said ECDSA verification function performs:
compute R′=H sig ( m ) s −1 ·G+r′s −1 ·P , and
check that [ R′] x =r′,
where r′ is the reference instance of the r-part of the first ECDSA signature, s is the s-part of the first ECDSA signature, P is the first public key, m is the part of the second transaction signed by the first ECDSA signature, H sig is a hash function that was used to hash m in generating the first ECDSA signature, G is an elliptic generator point, [R′] x denotes an x-coordinate of R′, and “·” denotes an elliptic curve scalar multiplication; and
wherein the code is configured to return the result of true on condition that both said checks are true, but to return a result of false otherwise.
7. The method of claim 6 , wherein the code is configured to perform:
check that H PoW (f(r,d)) meets the predetermined condition, and
check that r′=r, and
wherein the ECDSA verification function performs:
compute R′=H sig ( m ) s −1 ·G+rs −1 ·P , and
check that [ R′] x =r,
where r is the submitted instance of the r-part of the first ECDSA signature, r′ is the reference instance of the r-part of the first ECDSA signature, s is the s-part of the first ECDSA signature, P is the first public key, m is the part of the second transaction signed by a first ECC signature, H sig is a hash function that was used to hash m in generating the first ECDSA signature, G is an elliptic generator point, [R′] x denotes an x-coordinate of R′, and “·” denotes an elliptic curve scalar multiplication; and
wherein the code is configured to return the result of true on condition that all three of said checks are true, but to return the result of false otherwise.
8. The method of claim 4 , wherein said reference value is a transformation of a reference instance of the r-part of the first ECDSA signature, wherein the code is configured to perform said check that the submitted instance corresponds to the reference value by: performing the same transformation on the submitted instance and comparing to the reference value.
9. The method of claim 8 , wherein said reference value is a hash value, and wherein the hash value is a hash of the reference instance of the r-part of the first ECDSA signature.
10. The method of claim 9 , wherein the code is configured to perform:
check that H PoW (f(r,d)) meets the predetermined condition, and
check that h=H puz (r), and
wherein the ECDSA verification function performs:
compute R′=H sig ( m ) s −1 ·G+rs −1 ·P , and
check that [ R′] x =r,
where r′ is the reference instance of the r-part of the first ECDSA signature, r is the submitted instance of the r-part of the first ECDSA signature, s is the s-part of the first ECDSA signature, h is the hash value, H puz is the hash function that was used to hash r′ to generate h, P is the first public key, m is the part of the second transaction signed by the first ECC signature, H sig is a hash function that was used to hash m in generating the first ECDSA signature, G is an elliptic generator point, [R′] x denotes an x-coordinate of R′, and “·” denotes an elliptic curve scalar multiplication; and
wherein the code is configured to return the result of true on condition that all three of said checks are true, but to return a result of false otherwise.
11. The method of claim 3 , wherein said obtaining of the first public key comprises receiving the first public key as part of the information in the second transaction.
12. The method of claim 1 , wherein the submitted instance of the r-part and s-part of the first ECDSA were generated by a second party using: an ephemeral key given to the second party by a first party or vice versa, and a first private key which is a private key of the second party; and
the nonce was also generated by the second party by performing a proof-of-work on computer equipment of the second party.
13. The method of claim 12 , wherein:
P=V·G,
k∈[ 1, n− 1],
R=k·G,
r=[R] x , and
s=k −1 ( H sig ( m )+ rV ) mod n,
where P is the first public key, V is the first private key, k is the ephemeral key, n is a prime modulus, G is an elliptic generator point, m is the part of the second transaction signed by the first ECDSA signature, H sig is a hash function that was used to hash m in generating the first ECDSA signature, [R] x denotes an x-coordinate of R, and “·” denotes an elliptic curve scalar multiplication.
14. The method of claim 12 , wherein said receiving of the second transaction comprises receiving the second transaction from the second party.
15. The method of claim 12 , comprising triggering a service for the first party on condition that the result returned by said code is true.
16. The method of claim 12 , wherein the information received in the second transaction comprises a further cryptographic signature of the second party signing a part of the second transaction using a further private key of the second party, the further private key corresponding to a further public key.
17. The method of claim 16 , wherein a mapping is available enabling the first party and/or a third party to look-up of an identity of the second party based on the further public key.
18. The method of claim 16 , wherein the code is configured to verify the further cryptographic signature using the further public key and return the result of true on further condition that the further cryptographic signature is verified.
19. The method of claim 16 , wherein the information received in the second transaction further comprises a cryptographic signature of the first party signing a part of the second transaction using a private key of the first party.
20. The method of claim 12 , wherein:
the information received in the second transaction comprises an additional ECDSA signature having a different value of the r-part than the first ECDSA signature but using the same, first private key as the first ECDSA signature; and
the code is configured to verify the additional ECDSA signature using the first public key, and return the result of true on further condition that the additional ECDSA signature is verified.
21. The method of claim 1 , wherein each of the transactions comprises a data structure comprising one or more inputs and one or more outputs, wherein each output comprises a locking script, and each input comprises an unlocking script and a pointer to an output of another transaction;
wherein said code is comprised by the locking script of the first transaction, wherein said information received in the second transaction is comprised by the unlocking script in an input of the second transaction, and wherein the pointer in said input of the second transaction points to said output of the first transaction; and
the method comprises validating the transaction at least on condition that the code returns said result of true, and in response to said validation, at least one of:
including the second transaction in a pool of transactions for mining into one or more blocks by said verifying node, and/or
forwarding the second transaction to at least one other of nodes of the blockchain network.
22. A computer program embodied on a non-transitory computer-readable storage medium and configured so as when run on a node of a blockchain network the blockchain performs the steps of:
obtaining a first transaction which comprises runnable code;
receiving a second transaction which includes information comprising at least a submitted instance of an r-part and an s-part of a first Elliptic Curve Digital Signature Algorithm (ECDSA) signature, and further comprising a nonce;
running the code from the first transaction, wherein the code is configured to verify that H PoW (f(r,d)) meets a predetermined condition defined in the code, wherein said predetermined condition is that H PoW (f(r,d)) is less than or greater than a predetermined target value, is within a predetermined range, has a predetermined minimum number of leading zeros, or has a predetermined format, and to return a result of true on condition of said verifying that H PoW (f(r,d)) meets the predetermined condition defined in the code, where r is the submitted instance of the r-part, d is the nonce, H PoW is a hash function, and f is a function combining r and d.
23. A node of a blockchain network, comprising:
memory comprising one or more memory units, and
processing apparatus comprising one or more processing units;
wherein the memory stores code arranged to run on the processing apparatus, wherein the code is configured so as when run on the processing apparatus the processing apparatus performs the steps of:
obtaining a first transaction which comprises runnable code;
receiving a second transaction which includes information comprising at least a submitted instance of an r-part and an s-part of a first Elliptic Curve Digital Signature Algorithm (ECDSA) signature, and further comprising a nonce;
running the code from the first transaction, wherein the code is configured to verify that H PoW (f(r,d)) meets a predetermined condition defined in the code, wherein said predetermined condition is that H PoW (f(r,d)) is less than or greater than a predetermined target value, is within a predetermined range, has a predetermined minimum number of leading zeros, or has a predetermined format, and to return a result of true on condition of said verifying that H PoW (f(r,d)) meets a predetermined condition defined in the code, where r is the submitted instance of the r-part, d is the nonce, H PoW is a hash function, and f is a function combining r and d.
24. A computer-implemented method comprising, at computer equipment of a second party:
observing a first transaction which comprises runnable code, wherein the code is configured to verify that H PoW (f(r,d)) meets a predetermined condition defined in the code, wherein said predetermined condition is that H PoW (f(r,d)) is less than or greater than a predetermined target value, is within a predetermined range, or has a predetermined minimum number of leading zeros, and to return a result of true on condition of said verifying that H PoW (f(r,d)) meets the predetermined condition defined in the code, where r is an r-part for an Elliptic Curve Digital Signature Algorithm (ECDSA) signature, d is the nonce, H PoW is a hash function, and f is a function combining r and d, wherein the r-part is specified by a first party;
generating the r-part based on an ephemeral key;
searching for a value of the nonce d such that H PoW (f(r,d)) meets the predetermined condition;
formulating a second transaction linked to the first transaction, the second transaction including information comprising at least the r-part and an s-part of a first ECDSA signature, and further comprising the nonce d; and
sending the second transaction to be propagated over a blockchain network for recordal in a blockchain.