Protocol flow for notarizing a transaction
A method and system are provided to support a decentralized distributed ledger in which transactions are recorded by parties to the transactions without the use of a blockchain. A distributed ledger system provides a protocol framework that supports the development of protocol flows. A protocol flow is computer code that controls the performance of a transaction by the party or parties to the transaction. Protocol flows can be developed for different types of transactions. The distributed ledger system allows transactions to be proposed, accepted, and notarized by a notary and stored without the use of a blockchain ledger. The distributed ledger system can avoid the expense of the computational and storage resources needed to redundantly verify a transaction and store evidence on the many nodes of a blockchain distributed ledger.
1. One or more computing systems for proposing a transaction between parties, the computing system comprising:
one or more computer-readable storage mediums for storing computer-executable instructions for controlling the one or more computing systems to:
propose a transaction between a first computing node of a distributed ledger system and a second computing node of the distributed ledger system by:
generating a proposed transaction that specifies a state and an identifier of a notary computing node of the distributed ledger system;
signing the proposed transaction with a signature of the first computing node; and
sending, via a messaging service, the proposed transaction to the second computing node, the messaging service configured to establish an encryption session with the second computing node;
receive, from a notary computing node of the distributed ledger system, a notarized transaction that indicates acceptance of the proposed transaction by the second computing node; and
upon verification that the notarized transaction has been signed by the second computing node and the notary computing node, record the notarized transaction in a decentralized storage associated with the distributed ledger system so that the notarized transaction is accessible by the first computing node; and
one or more processors for executing the computer-executable instructions stored in the one or more computer-readable storage mediums.
2. The one or more computing systems of claim 1 wherein the decentralized storage allows notarized transactions to be recorded by the computing nodes to the notarized transactions as proof of the notarized transactions without the need for third parties to record the notarized transactions.
3. The one or more computing systems of claim 1 wherein a signature is a hash of a transaction that is signed using a private key of a signer.
4. The one or more computing systems of claim 1 wherein the proposed transaction is between the first computing node, the second computing node, and a third computing node and wherein the computer-executable instructions further control the one or more computing systems to verify that the notarized transaction has been accepted by the third computing node by ensuring that the notarized transaction has been signed by the third computing node.
5. The one or more computing systems of claim 1 wherein the computer-executable instructions further include instructions of a protocol framework that control the one or more computing systems to:
generate checkpoints during execution of a protocol flow, each checkpoint including state of the protocol flow at a time corresponding to the checkpoint; and
store the checkpoints persistently so that if execution of the protocol flow is suspended, execution can be resumed from a previous checkpoint.
6. The one or more computing systems of claim 5 wherein the generating of the checkpoints is transparent to the protocol flow.
7. The one or more computing systems of claim 1 wherein the computer-executable instructions further include instructions of a protocol framework that control the one or more computing systems to track a status of a protocol flow for reporting to the first computing node.
8. The one or more computing systems of claim 1 wherein the computer-executable instructions further include instructions of a protocol framework that control the one or more computing systems to prior to execution of the instructions of a protocol flow, rewrite the instructions of the protocol flow so that the protocol flow is resumable.
9. The one or more computing systems of claim 1 wherein the proposed transaction includes multiple input states and multiple output states.
10. The one or more computing systems of claim 1 , wherein the state having contract code for verifying the proposed transaction complies with terms of a contract, and wherein the transaction further includes a command as an input parameter to the contract code.
11. The one or more computing systems of claim 10 wherein the command has one or more associated identification of computing nodes and wherein verification of the proposed transaction by the contract code ensures that the proposed transaction has been signed by the identified computing nodes.
12. The one or more computing systems of claim 1 wherein an identification of a computing node is a public key.
13. The one or more computing systems of claim 1 , wherein the state having contract code for verifying the proposed transaction complies with terms of a contract, and wherein the transaction further includes an attachment with content that is accessible by the contract code.
14. The one or more computing systems of claim 1 wherein the one or more processors executes the instructions by executing a virtual machine the executes bytecodes of the instructions.
15. The one or more computing systems of claim 14 wherein the virtual machine is a Java virtual machine.
16. The one or more computing systems of claim 1 wherein the computer-executable instructions further include instructions that control the one or more computing systems to receive a request to provide a notarized transaction on which the proposed transaction depends, retrieve the notarized transaction on which the proposed transaction depends from the decentralized storage, and provide the retrieved notarized transaction to the second computing node.
17. The one or more computing systems of claim 1 wherein the computer-executable instructions further include instructions of a protocol flow to further control the one or more computing systems to request assistance for the protocol flow when an error condition is detected.
18. The one or more computing systems of claim 1 wherein the computer-executable instructions further include instructions of a protocol framework that controls the one or more computing systems to securely and reliably send messages between the first computing node and the second computing node.
19. The one or more computing systems of claim 18 wherein the computer-executable instructions further include instructions of the protocol framework to further control the one or more computing systems to provide receipts to confirm delivery of messages.
20. A method performed by one or more computing systems for proposing a transaction, the method comprising:
generating a proposed transaction between a first computing node of a distributed ledger system and a second computing node of the distributed ledger system;
sending, via a messaging service, the proposed transaction to the second computing node, the messaging service configured to establish an encryption session with the second computing node;
receiving, from a notary computing node of the distributed ledger system, a notarized transaction that indicates acceptance of the proposed transaction by the second computing node; and
upon verification that the notarized transaction has been signed by the second computing node and the notary computing node, recording the notarized transaction so that the notarized transaction is accessible by the first computing node.
21. The method of claim 20 wherein the proposing of the transaction is controlled by a protocol flow for proposing a transaction.
22. The method of claim 21 wherein the protocol flow includes originator computer code for controlling proposing a transaction and responder computer code for responding to a proposed transaction.
23. The method of claim 22 wherein the first computing node executes the originator computer code and the second computing node executes the responder computer code.
24. The method of claim 22 wherein the computer code includes bytecodes and the computer code is executed by a virtual machine.
25. The method of claim 21 further comprising:
generating, by a protocol framework, checkpoints during execution of the protocol flow, each checkpoint including state of the protocol flow at a time corresponding to the checkpoint; and
storing, by the protocol framework, the checkpoints persistently so that if execution of the protocol flow is suspended, execution can be resumed from a previous checkpoint.
26. The method of claim 25 wherein the generating of the checkpoints is transparent to the protocol flow.
27. The method of claim 21 further comprising tracking, by a protocol framework, status of the protocol flow for reporting to the first computing node.
28. The method of claim 21 further comprising, prior to execution of instructions of the protocol flow, rewriting the instructions of the protocol flow so that the protocol flow is resumable, the rewriting performed by a protocol framework.
29. The method of claim 21 further comprising requesting, by a protocol framework, assistance for the protocol flow when an error condition is detected.
30. The method of claim 21 further comprising sending, by a protocol framework, messages securely and reliably between the first computing node and the second computing node.
31. The method of claim 30 further comprising providing, the protocol framework, receipts to confirm delivery of messages.
32. The method of claim 20 wherein the notarized transaction is recorded in a decentralized storage so that the first computing node can present the notarized transaction to a third computing node without the need for the third computing node to record the notarized transaction.
33. The method of claim 20 wherein the proposed transaction is between the first computing node, the second computing node, and a third computing node and further comprising verifying that the notarized transaction has been accepted by the third computing node by ensuring that the notarized transaction has been signed by the third computing node.
34. The method of claim 20 wherein the transaction includes a command as an input parameter to contract code of the proposed transaction.
35. The method of claim 34 wherein the command has one or more associated identification of computing nodes and wherein the contract code of the proposed transaction ensures that the proposed transaction has been signed by the identified computing nodes.
36. The method of claim 20 further comprising sending to the second computing node a notarized transaction on which the proposed transaction depends.