IP Library Granted Patent US 12,375,287
Granted Patent B2
US 12,375,287 · App. 17/796,618 · Granted Jul 29, 2025

Attestation service for use with a blockchain network

Inventors: Craig Steven Wright (London, GB); Owen Vaughan (London, GB); Jack Owen Davies (London, GB)
Assignee: nChain Licensing AG
H04L9/3239H04L9/50
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,375,287
App. No.
17/796,618
Granted
Jul 29, 2025
Kind
B2
Abstract

A method comprising, at an attesting node of a network: receiving a sequence of data items from one or more client nodes of the network, determining an order of the sequence of data items, and attesting to the order by: including an indication of a respective set of one or more of the data items in each of a series of blockchain transactions. Each successive transaction comprises a respective input pointing to an output of the respective preceding transaction, wherein the output of the respective preceding transaction comprises a locking script, and the input of the respective successive transaction includes an unlocking script comprising a respective signature based on a respective key in a series of keys. The respective signature in each successive transaction signs a portion of the respective successive transaction including at least the indication of the respective set of data items.

Claims (58)

1. A method of attesting to an order of a sequence of data items, the method comprising, at an attesting node of a network:

receiving the sequence of data items from one or more client nodes of the network;

determining an order of the sequence of data items, whereby each successive data item in said sequence succeeds a preceding one of the data items in the sequence; and

based on said determination, attesting to the order by: including an indication of a respective set of one or more of the data items in each of a series of blockchain transactions, each successive transaction in said series succeeding a respective preceding transaction in the series, wherein the set indicated in each successive transaction succeeds the set indicated in the respective preceding transaction according to said order;

wherein each successive transaction comprises a respective input pointing to an output of the respective preceding transaction, wherein the output of the respective preceding transaction comprises a locking script, and the input of the respective successive transaction includes an unlocking script comprising a respective signature based on a respective key in a series of keys, the inclusion of the respective signature being a condition for unlocking the unlocking script of the respective preceding transaction;

wherein the respective signature in each successive transaction signs a portion of the respective successive transaction including at least the indication of the respective set of data items; and

wherein the step of attesting to the order further comprises sending the transactions to be recorded on a blockchain.

2. The method of claim 1 , wherein said order is an order of receipt of the data items at the attesting node.

3. The method of claim 1 , wherein the step of attesting to the order further comprises:

timestamping each of the transactions with timestamp information specifying at least one time of receipt of the respective set of data items, the time of receipt being the time of receipt at the attesting node.

4. The method of claim 1 , wherein each of said sets comprises a respective plurality of the data items, wherein the indication included in each transaction comprises an indication of each individual one of the data items in the respective set, and wherein said step of attesting to the order comprises:

in each of said series of transactions, including information specifying the order of the data items within the respective set, from a first data item in the set through one or more successive data items in the set.

5. The method of claim 4 , wherein said information comprises an index mapped to the indication of each individual data item in the respective set, and/or an ordered list of the individual data items in the set.

6. The method of claim 4 , wherein the plurality of data items of each respective set are selected on the basis of being received at the attesting node within a respective instance of a predetermined repeating time interval.

7. The method of claim 4 , wherein the step of attesting to the order further comprises timestamping each of the transactions with timestamp information specifying at least one time of receipt of the respective set of data items, the time of receipt being the time of receipt at the attesting node; and wherein within each transaction:

the timestamp information comprises an individual timestamp corresponding to each individual one of the data items in the respective set, specifying the time of receipt at the attesting node of the individual data item.

8. The method of claim 7 , wherein:

within each transaction, the indication of each individual data item comprises at least a hash; the indication of the first data item comprising a hash of a first preimage, wherein the first preimage comprises at least the first data item; and the indication of each successive data item succeeding the first data item comprising a hash of a respective successive preimage, wherein each successive preimage comprises at least a preceding hash in the sequence; and

each of the first and successive preimages further comprises the corresponding timestamp.

9. The method of claim 4 , wherein within each transaction:

the indication of each individual data item comprises at least a hash; the indication of the first data item comprising a hash of a first preimage, wherein the first preimage comprises at least the first data item; and the indication of each successive data item succeeding the first data item comprising a hash of a respective successive preimage, wherein each successive preimage comprises at least a preceding hash in the sequence.

10. The method of claim 4 , wherein for each transaction, the individual data items are modelled as leaves of a Merkle tree, and the indication comprises one or both of:

a Merkle root of the Merkle tree, and/or

a merkle proof for each individual data item.

11. The method of claim 4 , wherein within each transaction:

the indication of each individual data item comprises at least a corresponding public key, the indication of the first data item comprising a first public key generated based on the first data item, and the indication of each successive data item in the set comprising a successive public key generated based on that successive data item and a preceding public key in the sequence.

12. The method of claim 11 , wherein said signing comprises including a separate signature using each of the public keys, each signing a message comprising the corresponding data item or hash thereof.

13. The method of claim 4 , wherein within each transaction, the indication of each individual data item comprises an r-puzzle for the individual data item.

14. The method of claim 1 , wherein said network comprises a layered network including a core layer of core nodes, one or more intermediate layers each comprising a plurality of intermediate layer nodes, and one or more outer layers each comprising a plurality of outer layer nodes; wherein the core nodes comprise one or more nodes of a blockchain network.

15. The method of claim 14 , wherein the attesting node is one of the intermediate layer nodes.

16. The method of claim 14 , wherein the transmitting node, or at least one of the transmitting nodes, is one of the outer layer nodes.

17. The method of claim 14 , wherein said sending comprises sending the transactions toward the core layer.

18. The method of claim 17 , wherein said sending comprises sending at least some of the transactions directly to at least one of the core nodes over a connection between the attestation node and the core node.

19. The method of claim 17 , wherein said sending comprises sending at least some of the transactions to one or more of the core nodes via a further one of the intermediate layer nodes.

20. The method of claim 19 , wherein the further intermediate layer node is configured to add its own signature to each of the transactions received from the attesting node, wherein each unlocking script in the series of transactions is conditional on the signature of more than one of the intermediate layer nodes to unlock.

21. Computer equipment, comprising:

memory comprising one or more memory units,

processing apparatus comprising one or more processing units, and

a network interface comprising one or more network interface units;

wherein the memory stores code arranged to run on the processing apparatus, the code being configured so as when run on the processing apparatus, the processing apparatus operates the computer equipment as an attesting node by performing a method of attesting to an order of a sequence of data items, the method comprising:

via the network interface, receiving the sequence of data items from one or more client nodes of the network;

determining an order of the sequence of data items, whereby each successive data item in said sequence succeeds a preceding one of the data items in the sequence; and

based on said determination, attesting to the order by: including an indication of a respective set of one or more of the data items in each of a series of blockchain transactions, each successive transaction in said series succeeding a respective preceding transaction in the series, wherein the set indicated in each successive transaction succeeds the set indicated in the respective preceding transaction according to said order;

wherein each successive transaction comprises a respective input pointing to an output of the respective preceding transaction, wherein the output of the respective preceding transaction comprises a locking script, and the input of the respective successive transaction includes an unlocking script comprising a respective signature based on a respective key in a series of keys, the inclusion of the respective signature being a condition for unlocking the unlocking script of the respective preceding transaction;

wherein the respective signature in each successive transaction signs a portion of the respective successive transaction including at least the indication of the respective set of data items; and

wherein the step of attesting to the order further comprises, via the network interface, sending the transactions to be recorded on a blockchain.

22. A computer program embodied on non-transitory computer readable storage medium and configured so as when run on one or more processors, the one or more processor performs a method of attesting to an order of a sequence of data items, the method comprising:

receiving the sequence of data items from one or more client nodes of a network;

determining an order of the sequence of data items, whereby each successive data item in said sequence succeeds a preceding one of the data items in the sequence; and

based on said determination, attesting to the order by including an indication of a respective set of one or more of the data items in each of a series of blockchain transactions, each successive transaction in said series succeeding a respective preceding transaction in the series, wherein the set indicated in each successive transaction succeeds the set indicated in the respective preceding transaction according to said order;

wherein each successive transaction comprises a respective input pointing to an output of the respective preceding transaction, wherein the output of the respective preceding transaction comprises a locking script, and the input of the respective successive transaction includes an unlocking script comprising a respective signature based on a respective key in a series of keys, the inclusion of the respective signature being a condition for unlocking the unlocking script of the respective preceding transaction;

wherein the respective signature in each successive transaction signs a portion of the respective successive transaction including at least the indication of the respective set of data items; and

wherein the step of attesting to the order further comprises sending the transactions to be recorded on a blockchain.

23. A computer program product embodied on a non-transitory computer readable storage medium and configured so as when run on one or more processors at a client node of a network the one or more processors performs a method of determining whether a recorded order of a sequence of data items matches an expected order, the method including steps of:

determining the recorded order by reading an indication of a respective set of one or more of the data items from each of a series of transactions recorded on a blockchain, each successive transaction in said series succeeding a respective preceding transaction in the series; and

for each successive transaction, checking that the one or more data items of the respective set indicated in the successive transaction succeed the one or more data items of the respective set indicated in the respective preceding transaction according to said expected order;

wherein each successive transaction comprises a respective input pointing to an output of the respective preceding transaction, wherein the output of the respective preceding transaction comprises a locking script, and the input of the respective successive transaction includes an unlocking script comprising a respective signature based on a respective key in a series of keys, the inclusion of the respective signature being a condition for unlocking the unlocking script of the respective preceding transaction; and

the method comprises verifying the signature in each successive transaction.

Assignments (2)
CHANGE OF NAME Recorded Aug 8, 2022
From: NCHAIN HOLDINGS LIMITED
To: NCHAIN LICENSING AG
Reel/Frame 061118/0671 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 29, 2022
From: WRIGHT, CRAIG STEVEN; VAUGHAN, OWEN; DAVIES, JACK OWEN
To: NCHAIN HOLDINGS LIMITED
Reel/Frame 060677/0513 →
Priority Claims (1)
GB 2002311 · Feb 19, 2020 · national
Continuity (1)
Related Publication 20230066711A1 · Mar 2, 2023
References Cited (127)
US 5991828A · Horie et al. · 1999 [cited by applicant]
US 6751673B2 · Shaw · 2004 [cited by applicant]
US 6975631B1 · Kastenholz · 2005 [cited by applicant]
US 7194552B1 · Schneider · 2007 [cited by applicant]
US 7376716B2 · Dilley et al. · 2008 [cited by applicant]
US 7418479B2 · Gupta et al. · 2008 [cited by applicant]
US 7554988B2 · Zhang et al. · 2009 [cited by applicant]
US 7613796B2 · Harvey et al. · 2009 [cited by applicant]
US 8233489B2 · Welin et al. · 2012 [cited by applicant]
US 8913525B2 · Welin et al. · 2014 [cited by applicant]
US 9537747B2 · Karenos · 2017 [cited by applicant]
US 10630769B2 · Carter · 2020 [cited by applicant]
US 11108561B2 · Wang · 2021 [cited by applicant]
US 11223470B1 · Shea · 2022 [cited by applicant]
US 11349736B1 · Cheng et al. · 2022 [cited by applicant]
US 11423398B1 · Mullins · 2022 [cited by examiner]
US 11606190B2 · Carver · 2023 [cited by examiner]
US 11716202B2 · Wang · 2023 [cited by applicant]
US 11886463B2 · Harold · 2024 [cited by examiner]
US 12021924B2 · Vaughan et al. · 2024 [cited by applicant]
US 12033146B2 · Chan et al. · 2024 [cited by applicant]
US 12034798B2 · Vaughan et al. · 2024 [cited by applicant]
US 12039528B2 · Chan et al. · 2024 [cited by applicant]
US 12045830B2 · Tartan et al. · 2024 [cited by applicant]
US 12182541B2 · Tartan et al. · 2024 [cited by applicant]
US 12206790B2 · Wright et al. · 2025 [cited by applicant]
US 12231573B2 · Wright et al. · 2025 [cited by applicant]
US 12231574B2 · Wright et al. · 2025 [cited by applicant]
US 12238222B2 · Wright et al. · 2025 [cited by applicant]
US 20030212771A1 · Kwon et al. · 2003 [cited by applicant]
US 20070168512A1 · Gupta et al. · 2007 [cited by applicant]
US 20140153383A1 · Mabilleau et al. · 2014 [cited by applicant]
US 20150117267A1 · Lih et al. · 2015 [cited by applicant]
US 20190171849A1 · Assenmacher · 2019 [cited by applicant]
US 20190199787A1 · Carver et al. · 2019 [cited by applicant]
US 20190243572A1 · Kursun · 2019 [cited by applicant]
US 20200151165A1 · Chan et al. · 2020 [cited by applicant]
US 20200151713A1 · Chan et al. · 2020 [cited by applicant]
US 20200151714A1 · Chan et al. · 2020 [cited by applicant]
US 20200186568A1 · Erb · 2020 [cited by examiner]
US 20210182895A1 · Sears · 2021 [cited by examiner]
US 20210349443A1 · Falk · 2021 [cited by examiner]
US 20210359860A1 · Wang · 2021 [cited by applicant]
US 20210399898A1 · Wright et al. · 2021 [cited by applicant]
US 20220027491A1 · Wright et al. · 2022 [cited by applicant]
US 20220027492A1 · Wright et al. · 2022 [cited by applicant]
US 20220027903A1 · Wright et al. · 2022 [cited by applicant]
US 20220027905A1 · Wright et al. · 2022 [cited by applicant]
US 20220029817A1 · Wright et al. · 2022 [cited by applicant]
US 20220209962A1 · Tarnow · 2022 [cited by examiner]
US 20220261805A1 · Tartan et al. · 2022 [cited by applicant]
US 20220269810A1 · Tartan et al. · 2022 [cited by applicant]
US 20220294608A1 · Wright et al. · 2022 [cited by applicant]
US 20220294652A1 · Wright et al. · 2022 [cited by applicant]
US 20220300257A1 · Tartan et al. · 2022 [cited by applicant]
US 20230060559A1 · Wright et al. · 2023 [cited by applicant]
US 20230072531A1 · Vaughan et al. · 2023 [cited by applicant]
US 20240202703A1 · Brogliato · 2024 [cited by examiner]
GB 2583766A · 2020 [cited by applicant]
GB 2583767A · 2020 [cited by applicant]
GB 2583770A · 2020 [cited by applicant]
JP 2004030610A · 2004 [cited by applicant]
JP 2008040718A · 2008 [cited by applicant]
JP 2009175889A · 2009 [cited by applicant]
JP 2011526712A · 2011 [cited by applicant]
JP 2012105265A · 2012 [cited by applicant]
JP 2017055305A · 2017 [cited by applicant]
JP 2018533320A · 2018 [cited by applicant]
WO 2018078584A1 · 2018 [cited by applicant]
WO 2018212756A1 · 2018 [cited by applicant]
WO 2018215947A1 · 2018 [cited by applicant]
WO WO2019116184A1 · 2019 [cited by examiner]
WO 2019219631A1 · 2019 [cited by applicant]
WO 2020165177A1 · 2020 [cited by applicant]
WO 2020165676A1 · 2020 [cited by applicant]
WO 2020165678A1 · 2020 [cited by applicant]
WO 2020165679A1 · 2020 [cited by applicant]
WO WO2022118263A1 · 2022 [cited by examiner]
Antonopoulos A.M., “Mastering Bitcoin—Unlocking Digital Cryptocurrencies,” O'Reilly, Dec. 20, 2014, 298 pages. [cited by applicant]
Charles R. X., “R-Puzzles,” Sep. 2, 2019, 3 Pages, Retrieved from the Internet: URL: https://www.youtube.com/watch?v=CqqTCsLzbEA. [cited by applicant]
Coingeek, “CoinGeek Toronto Conference 2019: Dr. Craig Wright on R-Puzzles, the Metanet, and Attestation System,” Jun. 13, 2019, 4 Pages, Retrieved from the Internet: URL: https://www.youtube.com/watch?v=9EHKvNuRc0A&amp… [cited by applicant]
Combined Search and Examination Report under Sections 17 and 18(3) for Application No. GB2002270.3, mailed on Oct. 22, 2020, 10 pages. [cited by applicant]
Combined Search and Examination Report under Sections 17 and 18(3) for Application No. GB2002273.7, mailed on Oct. 30, 2020, 3 pages. [cited by applicant]
Franco P., “Understanding Bitcoin: Cryptography, Engineering and Economics,” Wiley, Nov. 24, 2014, 238 pages. [cited by applicant]
Hearn M., “FAQ on the Payment Protocol,” Bitcoin Forum, Sep. 24, 2013, retrieved from the internet: https://bitcointalk.org/index.php?topic=300809.0, 10 pages. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/IB2020/050734, mailed on Aug. 20, 2020, 11 pages. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/IB2021/050367, mailed on Apr. 6, 2021, 14 pages. [cited by applicant]
Nakamoto S., “Bitcoin: A Peer-to-Peer Electronic Cash System,” 2009, retrieved from the internet: https://bitcoin.org/bitcoin.pdf, 9 pages. [cited by applicant]
Nguyen S., “A View of Plasma Cash for Ethereum,” FiNC Tech Blog, retrieved from the internet: https://medium.com/finc-engineering/a-view-of-plasma-cash-for-ethereum-b608b934ec67, Sep. 14, 2018, 14 pages. [cited by applicant]
Reed S.L., “Bitcoin Cooperative Proof-of-Stake,” May 21, 2014, 16 pages, Retrieved from the Internet: URL: https://arxiv.org/ftp/arxiv/papers/1405/1405.5741.pdf. [cited by applicant]
Adams C., et al., “Internet X.509 Public Key Infrastructure,” Time-Stamp Protocol (TSP), Network Working Group, Aug. 2001, pp. 1-26. [cited by applicant]
“ADSS TSA Server System Requirements,” Key Points, Ascertia, 2020, 3 pages, Retrieved from the Internet: URL: https://www.ascertia.com/products/adss-tsa-server/key-points/, on Feb. 18, 2020. [cited by applicant]
Banton C.,“Underwriter,” Investopedia, Retrieved from the Internet: URL:https://www.investopedia.com/terms/u/underwriter.asp, on Feb. 18, 2020, 10 pages. [cited by applicant]
Chen J.,“Bond Purchase Agreement,” Investopedia, Retrieved from the Internet: URL:https://www.investopedia.com/terms/b/bond-purchase-agreement.asp, on Feb. 18, 2020, 9 pages. [cited by applicant]
Chen J.,“Bond Trustee,” Investopedia, Retrieved from the Internet: URL:https://www.investopedia.com/terms/b/bond-trustee.asp, on Feb. 18, 2020, 7 pages. [cited by applicant]
Chen J.,“Discount Bond,” Investopedia, Retrieved from the Internet: URL:https://www.investopedia.com/terms/d/discountbond.asp, on Feb. 18, 2020, 13 pages. [cited by applicant]
Chen J.,“Primary Market,” Investopedia, Retrieved from the Internet: URL:https://www.investopedia.com/terms/p/primarymarket.asp, on Feb. 18, 2020, 10 pages. [cited by applicant]
Chen J.,“Trust Indenture,” Investopedia, Retrieved from the Internet: URL:https://www.investopedia.com/terms/t/trust_indenture.asp, on Feb. 18, 2020, 7 pages. [cited by applicant]
Combined Search and Examination Report under Sections 17 and 18(3) for Application No. GB2002311.5, mailed on Nov. 19, 2020, 12 pages. [cited by applicant]
Datastax., “About Repair,” DSE 5.1 Architecture Guide, Retrieved from the Internet: URL:https://docs.datastax.com/en/dse/5.1/dse-arch/datastax_enterprise/dbArch/archAboutRepair.html , on Feb. 18, 2020, 1 page. [cited by applicant]
Datastax., “Architecture in brief,” Apache Cassandra 3.X, Retrieved from the Internet: URL: https://docs.datastax.com/en/cassandra-oss/3.x/cassandra/dml/dmlClientRequestsWrite.html, on Feb. 18, 2020, 4 pages. [cited by applicant]
Datastax., “Hinted Handoff: Repair during Write path,” Apache Cassandra 3.0 for DSE 5.0, Retrieved from the Internet: URL: https://docs.datastax.com/en/archived/cassandra/3.0/cassandra/operations/opsRepairNodesHintedHan… [cited by applicant]
Datastax., “How are Read Requests Accomplished?” Apache Cassandra 3.X, Retrieved from the Internet: URL: https://docs.datastax.com/en/cassandra-oss/3.x/cassandra/dml/dmlClientRequestsRead.html, on Feb. 18, 2020, 7 pages. [cited by applicant]
Datastax., “How are Write Requests Accomplished?” Apache Cassandra 3.X, Retrieved from the Internet: URL: https://docs.datastax.com/en/cassandra-oss/3.x/cassandra/dml/dmlClientRequestsWrite.html, on Feb. 18, 2020, 2 pag… [cited by applicant]
Datastax., “How is Data Deleted?,” Apache Cassandra 3.0 for DSE 5.0, Retrieved from the Internet: URL: https://docs.datastax.com/en/archived/cassandra/3.0/cassandra/dml/dmlAboutDeletes.html?hl=delete, on Feb. 18, 2020, … [cited by applicant]
Datastax., “How is Data Maintained?,” Apache Cassandra 3.X, Retrieved from the Internet: URL: https://docs.datastax.com/en/cassandra-oss/3.x/cassandra/dml/dmlHowDataMaintain.html, on Feb. 18, 2020, 10 pages. [cited by applicant]
Datastax., “How is Data Written?” Apache Cassandra 3.X, Retrieved from the Internet: URL: https://docs.datastax.com/en/cassandra-oss/3.x/cassandra/dml/dmlHowDataWritten.html, on Feb. 18, 2020, 3 pages. [cited by applicant]
Downey L.,“Fiscal Agent,” Investopedia, Retrieved from the Internet: URL:https://www.investopedia.com/terms/f/fiscalagent.asp, on Feb. 18, 2020, 8 pages. [cited by applicant]
Dr Wright C.S., et al., “R-Puzzles, The Metanet, and Attestation,” nChain, May 2019, 17 pages. [cited by applicant]
Filho C.I.N.S., et al., “Mandala Networks: Ultra-Small-World and Highly Sparse Graphs,” Scientific Reports, Mar. 13, 2015, vol. 5, No. 9082, pp. 1-6. [cited by applicant]
Financial Pipeline, “How are bonds traded?,” Financial Pipeline, Dec. 1, 2004, 11 pages, Retrieved from the Internet: URL: https://staging-finpipev4.kinsta.cloud/trading-bonds/, on Feb. 18, 2020. [cited by applicant]
Hayes A.,“Bond,” Investopedia, Retrieved from the Internet: URL:https://www.investopedia.com/terms/b/bond.asp, on Feb. 18, 2020, 23 pages. [cited by applicant]
Hoogstraaten H.,“Black Tulip Report of the Investigation into the DigiNotar Certificate Authority Breach,” Fox IT, Aug. 13, 2012, 102 pages. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/IB2021/050364, mailed on May 21, 2021, 18 pages. [cited by applicant]
Kaptchuk G., et al., “Giving State to the Stateless: Augmenting Trustworthy Computation with Ledgers,” International Association for Cryptologic Research, Retrieved from the Internet: URL:http://eprint.iacr.org/2017/201… [cited by applicant]
Kenton W.,“Secondary Market,” Investopedia, Retrieved from the Internet: URL:https://www.investopedia.com/terms/s/secondarymarket.asp, on Feb. 18, 2020, 8 pages. [cited by applicant]
Krawczyk H., et al., “HMAC: Keyed-Hashing for Message Authentication,” Feb. 1997, 11 pages. [cited by applicant]
Massias H., et al., “Design of a Secure Timestamping Service with Minimal Trust Requirement,” UCL Crypto Group, 1999, 8 pages. [cited by applicant]
Morah C.,“Why Are Most Bonds Traded on the Secondary Market “Over the Counter”?,” Investopedia, Retrieved from the Internet: URL:https://www.investopedia.com/ask/answers/09/bond-over-the-counter.asp, on Feb. 18, 2020, 9… [cited by applicant]
Murphy C. B.,“Over-The-Counter (OTC),” Investopedia, Retrieved from the Internet: URL:https://www.investopedia.com/terms/o/otc.asp, on Feb. 18, 2020, 12 pages. [cited by applicant]
Nakamoto S, “Bitcoin: A Peer-to-Peer Electronic Cash System,” Oct. 31, 2008, 6 pages, Retrieved from the Internet: URL: https://nakamotoinstitute.org/bitcoin/, on Feb. 18, 2020. [cited by applicant]
“Storage Engine,” Cassandra Documentation, 2020, 5 pages, Retrieved from the Internet: URL: https://cassandra.apache.org/doc/latest/architecture/storage_engine.html, on Feb. 18, 2020. [cited by applicant]
Strlen, “Hacker News,” Mar. 14, 2010, 1 page, Retrieved from the Internet: URL: https://news.ycombinator.com/item?id=1191314, on Feb. 18, 2020. [cited by applicant]
“The Pros and Cons of Zero-Coupon Bonds,” Financial Web, 2 pages, Retrieved from the Internet: URL: https://www.finweb.com/investing/the-pros-and-cons-of-zero-coupon-bonds.html, on Feb. 18, 2020. [cited by applicant]
Wikipedia, “Deterministic Finite Automaton,” 2020, 8 pages. [cited by applicant]
Wikipedia, “Eventual Consistency,” 2019, 3 pages. [cited by applicant]
Xiao Y., et al., “A Survey of Distributed Consensus Protocols for Blockchain Networks,” arxiv.org, Cornell University Library, Apr. 8, 2019, 28 pages. [cited by applicant]