Digital data management
View Patent ↗The present disclosure relates to methods of mining a block of a distributed ledger. The methods include: receiving a block to be mined, the block including a header hash and a plurality of transactions; creating a first signature based on a first function, where inputs to the first function include the header hash and the plurality of transactions; and creating a second signature based on a second function, where an input to the second function is the first signature. In one example, the second function is a multiplicative inverse function and the method further includes creating the second signature that is a multiplicative inverse value of the first signature with respect to a first irreducible polynomial. The method additionally includes creating a chain of signatures, where each of the signatures is a multiplicative inverse value of a previous output with respect to a respective irreducible polynomial.
1. A method of mining a block of a distributed ledger, the method comprising:
receiving a block to be mined, the block comprising a header hash and a plurality of transactions;
creating a first signature based on a first function, wherein inputs to the first function include the header hash and the plurality of transactions; and
creating a chain of signatures, wherein each of the signatures is a multiplicative inverse value of a previous output with respect to an irreducible polynomial; and
amending the block to include the first signature and the chain of signatures.
2. The method of claim 1 , wherein the first function is a one-way function.
3. The method of claim 2 , wherein the one-way function is a hash function.
4. The method of claim 1 , wherein an order of signatures used to create a signature output is defined before the block to be mined is received.
5. The method of claim 1 , wherein the irreducible polynomial is a primitive polynomial.
6. The method of claim 1 , wherein creating the chain of signatures further comprises:
creating a second signature based on a second function that is a multiplicative inverse function, wherein an input to the second function is the first signature and the second signature is a multiplicative inverse value of the first signature with respect to a first irreducible polynomial.
7. The method of claim 6 , further comprising:
concatenating the first signature and the second signature to create a concatenated output; and
creating a signature output by mapping the concatenated output to the signature output using a hash function.
8. The method of claim 7 , further comprising, amending the block to include the signature output.
9. A distributed ledger implemented, at least in part, on a system, the system comprising:
a processor;
a non-transitory computer-readable media storing instructions that, when executed by the processor, causes the processor to:
receive a block to be mined, the block comprising a header hash and a plurality of transactions;
create a first signature based on a first function, wherein inputs to the first function include the header hash and the plurality of transactions; and
create a chain of signatures, wherein each of the signatures is a multiplicative inverse value of a previous output with respect to a respective irreducible polynomial; and
amend the block to include the first signature and the chain of signatures.
10. The system of claim 9 , wherein the first function is a one-way function.
11. The system of claim 10 , wherein the one-way function is a hash function.
12. The system of claim 9 , wherein an order of signatures used to create a signature output is defined before the block to be mined is received.
13. The system of claim 9 , wherein the non-transitory computer-readable media storing instructions further causes the processor to:
create a second signature based on a second function that is a multiplicative inverse function, wherein an input to the second function is the first signature and the second signature is a multiplicative inverse value of the first signature with respect to a first irreducible polynomial.
14. The system of claim 13 , wherein the non-transitory computer-readable media storing instructions further causes the processor to:
concatenate the first signature and the second signature to create a concatenated output; and
create a signature output by mapping the concatenated output to the signature output using a hash function.
15. The system of claim 14 , wherein the non-transitory computer-readable media storing instructions further causes the processor to amend the block to include the signature output.
16. A non-transitory computer-readable media storing instructions that, when executed by a computer processor of a computing system, cause the computing system to:
receive a block to be mined, the block comprising a header hash and a plurality of transactions;
create a first signature based on a first function, wherein inputs to the first function include the header hash and the plurality of transactions; and
create a chain of signatures, wherein each of the signatures is a multiplicative inverse value of a previous output with respect to a respective irreducible polynomial; and
amend the block to include the first signature and the chain of signatures.
17. The non-transitory computer-readable media of claim 16 , wherein the first function is a one-way function.
18. The non-transitory computer-readable media of claim 17 , wherein the one-way function is a hash function.
19. The non-transitory computer-readable media of claim 16 , wherein the instructions further cause the computing system to:
create a second signature based on a second function that is a multiplicative inverse function, wherein an input to the second function is the first signature and the second signature is a multiplicative inverse value of the first signature with respect to a first irreducible polynomial.
20. The non-transitory computer-readable media of claim 19 , wherein the first irreducible polynomial is a primitive polynomial.