IP Library › Granted Patent US 12,373,392
Granted Patent B2
US 12,373,392 · App. 18/047,201 · Granted Jul 29, 2025

Scalable, secure, efficient, and adaptable distributed digital ledger transaction network

Inventor: Benjamin D. Maurer (Menlo Park, CA)
Assignee: Circle Internet Financial, LLC
G06F16/1734G06F16/182G06F16/185G06F16/1865G06Q20/0658H04L9/0637
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,373,392
App. No.
18/047,201
Granted
Jul 29, 2025
Kind
B2
Abstract

The present disclosure relates to systems, methods, and non-transitory computer readable storage media for implementing a scalable, secure, efficient, and adaptable distributed digital ledger transaction network. Indeed, the disclosed systems can reduce storage and processing requirements, improve security of implementing computing devices and underlying digital assets, accommodate a wide variety of different digital programs (or “smart contracts”), and scale to accommodate billions of users and associated digital transactions. For example, the disclosed systems can utilize a host of features that improve storage, account/address management, digital transaction execution, consensus, and synchronization processes. The disclosed systems can also utilize a new programming language that improves efficiency and security of the distributed digital ledger transaction network.

Claims (61)

1. A computer-implemented method comprising:

generating a plurality of access limits for a user account within an authenticated data structure of a distributed digital ledger transaction network, each access key limit of the plurality of access limits being defined by a user of the user account and comprising one or more of an access key limit and a threshold number of access keys that are different than respective access key limits and threshold numbers of access keys of other access limits in the plurality of access limits;

identifying a first request for a first transaction associated with the user account and comprising a first access key, a cryptographic signature being applied to the first request using a private key associated with the user account;

determining that the first access key is subject a first access limit of the plurality of access limits, the first access limit comprising one or more of a first access key limit and a first threshold number of access keys; and

executing the first transaction in response to verifying the signature applied to the request using a public key associated with the user account and determining that the first transaction satisfies the one or more of the first access key limit and the first threshold number of access keys.

2. The computer-implemented method of claim 1 , wherein:

executing the first transaction comprises providing access to the one or more digital assets of the user account.

3. The computer-implemented method of claim 1 , wherein:

generating a plurality of access limits comprises generating the first access key limit as a value key limit that limits a value of the one or more digital assets of the user account that can be accessed using the first access limit; and

executing the first transaction is further in response to determining that the first transaction comprises a request value that falls within the value key limit.

4. The computer-implemented method of claim 1 , wherein:

generating a plurality of access limits comprises generating the first access key limit as a rate key limit that limits a time period for which the first access key can successfully access the one or more digital assets of the user account; and

executing the first transaction is further in response to determining that the first transaction is received within the time period associated with the rate key limit.

5. The computer-implemented method of claim 1 , wherein:

generating a plurality of access limits comprises generating the first access key limit as a rate key limit that limits a value of the one or more digital assets of the user account that can be successfully accessed using the first access key within a recurring time period; and

executing the first transaction is further in response to determining that the first transaction includes a request value that falls within the value permitted by the rate key limit for the recurring time period.

6. The computer-implemented method of claim 1 , wherein:

generating a plurality of access limits comprises generating the first threshold number of access keys to indicate a minimum number of access keys or a minimum percentage of access keys from a group of access keys associated with the user account that are required to be associated with requests for transactions associated with the user account; and

executing the first transaction is further in response to determining that the first request is associated with the minimum number of access keys or the minimum percentage of access keys from the group of access keys associated with the user account.

7. The computer-implemented method of claim 1 , wherein generating a plurality of access limits for the user account comprises:

generating, for the user account, a second access key.

8. The computer-implemented method of claim 7 , wherein the second access key is generated as a sub access key of the first access key, the second access key further limiting transactions relative to the first access key.

9. The computer-implemented method of claim 7 , further comprising:

identifying a second request for a second transaction associated with the user account and comprising the second access key;

determining that the second access key is subject a second access limit of the plurality of access limits, the second access limit comprising one or more of a second access key limit and a second threshold number of access keys; and

rejecting the second request for the second transaction based on determining that the second transaction fails to satisfy one or more of the second access key limit the second threshold number of access keys.

10. A non-transitory computer-readable medium storing instructions thereon that, when executed by at least one processor, cause a computing device to:

generate a plurality of access limits for a user account within an authenticated data structure of a distributed digital ledger transaction network, each access key limit of the plurality of access limits being defined by a user of the user account and comprising one or more of an access key limit and a threshold number of access keys that are different than respective access key limits and threshold numbers of access keys of other access limits in the plurality of access limits;

identify a first request for a transaction associated with the user account and comprising a first access key, a cryptographic signature being applied to the first request using a private key associated with the user account;

determine that the first access key is subject a first access limit of the plurality of access limits, the first access limit comprising one or more of a first access key limit and a first threshold number of access keys; and

execute the first transaction in response to verifying the signature applied to the request using a public key associated with the user account and determining that the transaction satisfies the one or more of the first access key limit and the first threshold number of access keys.

11. The non-transitory computer-readable medium of claim 10 , further comprising instructions that, when executed by the at least one processor, cause the computing device to:

execute the first transaction by providing access to the one or more digital assets of the user account.

12. The non-transitory computer-readable medium of claim 10 , further comprising instructions that, when executed by the at least one processor, cause the computing device to:

generate a plurality of access limits by generating the first access key limit as a value key limit that limits a value of the one or more digital assets of the user account that can be accessed using the first access limit; and

execute the first transaction further in response to determining that the first transaction comprises a request value that falls within the value key limit.

13. The non-transitory computer-readable medium of claim 10 , further comprising instructions that, when executed by the at least one processor, cause the computing device to:

generate a plurality of access limits by generating the first access key limit as a rate key limit that limits a time period for which the first access key can successfully access the one or more digital assets of the user account; and

execute the first transaction further in response to determining that the first transaction is received within the time period associated with the rate key limit.

14. The non-transitory computer-readable medium of claim 10 , further comprising instructions that, when executed by the at least one processor, cause the computing device to:

generate a plurality of access limits by generating the first access key limit as a rate key limit that limits a value of the one or more digital assets of the user account that can be successfully accessed using the first access key within a recurring time period; and

execute the first transaction further in response to determining that the first transaction includes a request value that falls within the value permitted by the rate key limit for the recurring time period.

15. The non-transitory computer-readable medium of claim 10 , further comprising instructions that, when executed by the at least one processor, cause the computing device to:

generate a plurality of access limits by generating the first threshold number of access keys to indicate a minimum number of access keys or a minimum percentage of access keys from a group of access keys associated with the user account that are required to be associated with requests for transactions associated with the user account; and

execute the first transaction further in response to determining that the first request is associated with the minimum number of access keys or the minimum percentage of access keys from the group of access keys associated with the user account.

16. The non-transitory computer-readable medium of claim 10 , further comprising instructions that, when executed by the at least one processor, cause the computing device to generate a plurality of access limits for the user account by:

generating, for the user account, a second access key.

17. A system comprising:

at least one processor; and

at least one non-transitory computer-readable medium storing instructions thereon that, when executed by the at least one processor, cause the system to:

generate a plurality of access limits for a user account within an authenticated data structure of a distributed digital ledger transaction network, each access key limit of the plurality of access limits being defined by a user of the user account and comprising one or more of an access key limit and a threshold number of access keys that are different than respective access key limits and threshold numbers of access keys of other access limits in the plurality of access limits;

identify a first request for a transaction associated with the user account and comprising a first access key, a cryptographic signature being applied to the first request using a private key associated with the user account;

determine that the first access key is subject a first access limit of the plurality of access limits, the first access limit comprising one or more of a first access key limit and a first threshold number of access keys; and

execute the first transaction in response to verifying the signature applied to the request using a public key associated with the user account and determining that the transaction satisfies the one or more of the first access key limit and the first threshold number of access keys.

18. The system of claim 17 , further comprising instructions that, when executed by the at least one processor, cause the system to generate a plurality of access limits for the user account by:

generating, for the user account, a second access key.

19. The system of claim 18 , wherein the second access key is generated as a sub access key of the first access key, the second access key further limiting transactions relative to the first access key.

20. The system of claim 17 , further comprising instructions that, when executed by the at least one processor, cause the system to:

identify a second request for a second transaction associated with the user account and comprising the second access key;

determine that the second access key is subject a second access limit of the plurality of access limits, the second access limit comprising one or more of a second access key limit and a second threshold number of access keys; and

reject the second request for the second transaction based on determining that the second transaction fails to satisfy one or more of the second access key limit the second threshold number of access keys.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 4, 2025
From: CIRCLE INTERNET FINANCIAL, LLC
To: CIRCLE INTERNET GROUP, INC.
Reel/Frame 072774/0580 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 7, 2024
From: META PLATFORMS, INC.
To: CIRCLE INTERNET FINANCIAL, LLC
Reel/Frame 067654/0637 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 21, 2022
From: MAURER, BENJAMIN D
To: META PLATFORMS, INC.
Reel/Frame 061502/0034 →
Continuity (3)
Continuation 17242891 · Apr 28, 2021
Continuation 16442475 · Jun 15, 2019
Related Publication 20230068589A1 · Mar 2, 2023
References Cited (221)
US 6598078B1 · Ehrlich et al. · 2003 [cited by applicant]
US 8291197B2 · Wu et al. · 2012 [cited by applicant]
US 8966018B2 · Bugwadia et al. · 2015 [cited by applicant]
US 9798665B1 · Yochai · 2017 [cited by applicant]
US 10269009B1 · Winklevoss et al. · 2019 [cited by applicant]
US 10476847B1 · Smith et al. · 2019 [cited by applicant]
US 10536846B1 · Hennessy et al. · 2020 [cited by applicant]
US 10572855B1 · Levy et al. · 2020 [cited by applicant]
US 10713727B1 · Floyd et al. · 2020 [cited by applicant]
US 10721060B1 · Kaizer et al. · 2020 [cited by applicant]
US 10846762B1 · Dennis et al. · 2020 [cited by applicant]
US 10848319B2 · Uhr et al. · 2020 [cited by applicant]
US 10915891B1 · Winklevoss et al. · 2021 [cited by applicant]
US 11188977B2 · Youb et al. · 2021 [cited by applicant]
US 11354727B2 · Yao · 2022 [cited by applicant]
US 11522700B1 · Auerbach · 2022 [cited by examiner]
US 11528258B2 · Lenz et al. · 2022 [cited by applicant]
US 11593321B2 · Basu et al. · 2023 [cited by applicant]
US 11631077B2 · Zappier et al. · 2023 [cited by applicant]
US 20030182332A1 · McBrearty et al. · 2003 [cited by applicant]
US 20040249838A1 · Hinshaw et al. · 2004 [cited by applicant]
US 20050187891A1 · Johnson et al. · 2005 [cited by applicant]
US 20050210106A1 · Cunningham · 2005 [cited by applicant]
US 20080177756A1 · Kosche et al. · 2008 [cited by applicant]
US 20080256592A1 · Schnell et al. · 2008 [cited by applicant]
US 20120185383A1 · Demark et al. · 2012 [cited by applicant]
US 20130054577A1 · Schwob · 2013 [cited by applicant]
US 20130185530A1 · Puttaswamy Naga et al. · 2013 [cited by applicant]
US 20140280305A1 · James et al. · 2014 [cited by applicant]
US 20150193872A1 · Ivanoff et al. · 2015 [cited by applicant]
US 20150347451A1 · Lee et al. · 2015 [cited by applicant]
US 20160217452A1 · Wong et al. · 2016 [cited by applicant]
US 20160260169A1 · Arnold et al. · 2016 [cited by applicant]
US 20160267020A1 · Wang et al. · 2016 [cited by applicant]
US 20160292672A1 · Fay et al. · 2016 [cited by applicant]
US 20160359817A1 · Mullen et al. · 2016 [cited by applicant]
US 20160364787A1 · Walker et al. · 2016 [cited by applicant]
US 20170046694A1 · Chow et al. · 2017 [cited by applicant]
US 20170091756A1 · Stern et al. · 2017 [cited by applicant]
US 20170212781A1 · Dillenberger et al. · 2017 [cited by applicant]
US 20170278080A1 · Kruszka et al. · 2017 [cited by applicant]
US 20180005186A1 · Hunn · 2018 [cited by applicant]
US 20180005235A1 · Thorne · 2018 [cited by applicant]
US 20180089638A1 · Christidis et al. · 2018 [cited by applicant]
US 20180101842A1 · Ventura et al. · 2018 [cited by applicant]
US 20180137512A1 · Georgiadis et al. · 2018 [cited by applicant]
US 20180158034A1 · Hunt et al. · 2018 [cited by applicant]
US 20180165476A1 · Carey et al. · 2018 [cited by applicant]
US 20180184296A1 · Hunt et al. · 2018 [cited by applicant]
US 20180315027A1 · Kumar · 2018 [cited by applicant]
US 20180331837A1 · Uhr et al. · 2018 [cited by applicant]
US 20180349621A1 · Schvey et al. · 2018 [cited by applicant]
US 20190019183A1 · Karame et al. · 2019 [cited by applicant]
US 20190114626A1 · Pogorelik et al. · 2019 [cited by applicant]
US 20190114706A1 · Bell et al. · 2019 [cited by applicant]
US 20190180275A1 · Safak · 2019 [cited by applicant]
US 20190180558A1 · Merati · 2019 [cited by applicant]
US 20190188335A1 · Boyd et al. · 2019 [cited by applicant]
US 20190188706A1 · McCurtis · 2019 [cited by applicant]
US 20190228133A1 · Ansari et al. · 2019 [cited by applicant]
US 20190228386A1 · Onnainty · 2019 [cited by applicant]
US 20190251080A1 · Lu et al. · 2019 [cited by applicant]
US 20190279204A1 · Norton et al. · 2019 [cited by applicant]
US 20190325114A1 · Maughan et al. · 2019 [cited by applicant]
US 20190334920A1 · Kelly · 2019 [cited by examiner]
US 20190354397A1 · Goel et al. · 2019 [cited by applicant]
US 20190356641A1 · Isaacson et al. · 2019 [cited by applicant]
US 20190361731A1 · Qiu · 2019 [cited by applicant]
US 20190370250A1 · Tipton et al. · 2019 [cited by applicant]
US 20190370358A1 · Nation et al. · 2019 [cited by applicant]
US 20190386969A1 · Verzun et al. · 2019 [cited by applicant]
US 20200021569A1 · Simons · 2020 [cited by applicant]
US 20200034457A1 · Brody et al. · 2020 [cited by applicant]
US 20200082398A1 · Xu · 2020 [cited by applicant]
US 20200126075A1 · Fisch · 2020 [cited by applicant]
US 20200127812A1 · Schuler et al. · 2020 [cited by applicant]
US 20200134737A1 · Wang et al. · 2020 [cited by applicant]
US 20200162261A1 · Iyer · 2020 [cited by applicant]
US 20200167345A1 · Zhuo et al. · 2020 [cited by applicant]
US 20200186503A1 · Jahr · 2020 [cited by applicant]
US 20200201964A1 · Nandakumar et al. · 2020 [cited by applicant]
US 20200202350A1 · Chan et al. · 2020 [cited by applicant]
US 20200218815A1 · Haque et al. · 2020 [cited by applicant]
US 20200220729A1 · Hudson et al. · 2020 [cited by applicant]
US 20200235921A1 · De La Rocha Gómez-Arevalillo et al. · 2020 [cited by applicant]
US 20200258338A1 · Goswami et al. · 2020 [cited by applicant]
US 20200313859A1 · Ateniese et al. · 2020 [cited by applicant]
US 20200320529A1 · Lyadvinsky et al. · 2020 [cited by applicant]
US 20200322132A1 · Covaci et al. · 2020 [cited by applicant]
US 20200326973A1 · Xie et al. · 2020 [cited by applicant]
US 20200328898A1 · Xie · 2020 [cited by applicant]
US 20200334653A1 · Sidhu · 2020 [cited by applicant]
US 20200363979A1 · Viraraghavan et al. · 2020 [cited by applicant]
US 20200366489A1 · Assenmacher · 2020 [cited by applicant]
US 20200387500A1 · Malfiza Garcia De Macedo et al. · 2020 [cited by applicant]
US 20200394176A1 · Wu et al. · 2020 [cited by applicant]
US 20200396081A1 · Ansel et al. · 2020 [cited by applicant]
US 20200396283A1 · Chakraborty et al. · 2020 [cited by applicant]
US 20210050989A1 · Kempf et al. · 2021 [cited by applicant]
US 20210056548A1 · Monica · 2021 [cited by examiner]
US 20210160082A1 · Wang · 2021 [cited by applicant]
US 20210216522A1 · Zhuo · 2021 [cited by applicant]
US 20210326815A1 · Brody et al. · 2021 [cited by applicant]
US 20220004657A1 · Orsinger et al. · 2022 [cited by applicant]
US 20220012726A1 · Paavolainew et al. · 2022 [cited by applicant]
CA 3054813A1 · 2018 [cited by applicant]
CA 3051287A1 · 2019 [cited by applicant]
CA 3052348A1 · 2019 [cited by applicant]
CN 109584063A · 2019 [cited by applicant]
CN 110012100B · 2021 [cited by applicant]
WO WO2017204943 · 2017 [cited by applicant]
WO WO2018130910A1 · 2018 [cited by applicant]
WO WO2018145357A1 · 2018 [cited by applicant]
WO WO2018215873A1 · 2018 [cited by applicant]
WO WO2020156480A1 · 2020 [cited by applicant]
Anonymous, “Distributed Ledger,” Wikipedia [online], Apr. 28, 2019, 4 Pages, XP055711947, Retrieved from the Internet: URL: https://en.wikipedia.org/w/index.php?title=Distributed_ledger&oldid=894548161. [cited by applicant]
Anonymous: “Etherscan,” Jun. 4, 2017 [Retrieved on Aug. 25, 2022], 5 pages, XP055954845, Retrieved from the Internet: URL:https://archive.ph/3xNpu. [cited by applicant]
Anonymous, “OpenAlias—Simplifying the World,” Mar. 31, 2019, XP055952098, 5 pages, Retrieved from the Internet: URL: https://web.archive.org/web/20190331011708/https://openalias.org/. [cited by applicant]
Arora R., et al., “The Libra Blockchain,” Libra Protocol [online], Jul. 23, 2019, 29 Pages, https://developers.libra.org/docs/the-libra-blockchain-paper. [cited by applicant]
Baird I., “The Swirlds Hashgraph Consensus Algorithm: Fair, Fast, Byzantine Fault Tolerance,” Swirlds Tech Report [online], May 31, 2016, 28 Pages, Retrieved from the Internet: URL: https://swirlds.com/downloads/SWIRLDS… [cited by applicant]
Bano S., et al., “Moving Towards Permissionless Consensus,” The Libra Association [online], Aug. 14, 2019, 4 Pages, Retrieved from the Internet: URL: https://libra.org/permissionless-blockchain. [cited by applicant]
Barnaby C., et al., “A User Study to Inform the Design of the Obsidian Blockchain DSL,” Workshop on Evaluation and Usability of Programming Languages and Tools, Oct. 23, 2017, 7 pages. [cited by applicant]
Bartoletti M., et al., “BitML: A Calculus for Bitcoin Smart Contracts,” In Proceedings of the ACM SIGSAC Conference on Computer and Communications Security, Canada, Oct. 15-19, 2018, 25 Pages. [cited by applicant]
Baudet M., A et al., “State Machine Replication in the Libra Blockchain,” LibraBFT [online], 2019, 41 Pages, Retrieved from the Internet: URL: https://developers.libra.org/docs/state-machine-replication-paper. [cited by applicant]
Bentov I., et al., “Cryptocurrencies Without Proof of Work,” International Conference on Financial Cryptography and Data Security, Financial Cryptography and Data Security, Christ Church, Barbados, Feb. 26, 2016, pp. 14… [cited by applicant]
Bernstein P.A., et al., “Concurrency Control and Recovery in Database Systems,” Addison-Wesley Publishing Company, 1987, 58 Pages. [cited by applicant]
Bertoni G., et al., “KECCAK,” Annual International Conference on the Theory and Applications of Cryptographic Techniques, Advances in Cryptology—EUROCRYPT, May 26-30, 2013, pp. 313-314. [cited by applicant]
“Bitcoin—Open Source P2P Money,” Get Started with Bitcoin [online], Sep. 2, 2019, 4 Pages, Retrieved from the Internet: URL: https://bitcoin.org/en. [cited by applicant]
Bitcoin, “Colored Coin,” Bitcoin.org [online], Aug. 29, 2019, 4 Pages, Retrieved from the Internet: URL: https://en.bitcoin.it/wiki/Colored_Coin. [cited by applicant]
“Bitcoin Energy Consumption Index,” Digiconomist.net [online], 2019, 8 pages, Retrieved from the Internet: URL: https://digiconomist.net/bitcoin-energy-consumption. [cited by applicant]
Bitcoin, “Multisignature,” Bitcoin.org [online], Aug. 29, 2019, 2 Pages, Retrieved from the Internet: URL: https://en.bitcoin.it/wiki/Multisignature. [cited by applicant]
Blackshear S., et al., “Move: A Language with Programmable Resources,” The Move Programming Language [online], 2019, 26 Pages, Retrieved from the Internet: URL: https://developers.libra.org/docs/move-paper. [cited by applicant]
Blackshear S., et al., “Specifying and Verifying Move programs,” Aug. 27, 2019, 8 pages, Retrieved from the Internet: URL: https://developers.libra.org/docs/specifying-and-verifying-move-programs-paper. [cited by applicant]
Boneh D., et al., “Short Signatures From the Weil Pairing,” In Advances in Cryptology-Asiacrypt, 2001, 19 Pages. [cited by applicant]
Buchman E., et al., “The Latest Gossip On BFT Consensus,” ArXiv Preprint [online], arXiv:1807.04938v2, Sep. 24, 2018, 14 Pages, Retrieved from the Internet: URL: http://arxiv.org/abs/1807.04938v2. [cited by applicant]
Buterin V., “Critical Update Re: DAO Vulnerability,” Ethereum Blog [online], Jun. 17, 2016, 1 Page, Retrieved from the Internet: URL: https://ethereum.github.io/blog/2016/06/17/critical-update-re-dao-vulnerability/. [cited by applicant]
Buterin V., et al., “Casper, The Friendly Finality Gadget,” ArXiv Preprint, ArXiv:1710.09437v4 [Online], 2017, 10 Pages, Retrieved from the Internet: URL: https://arxiv.org/abs/1710.09437. [cited by applicant]
Buterin V., “State Tree Pruning,” Ethereum Foundation Blog [online], Jun. 26, 2015, 6 Pages, XP055728780, Retrieved from the Internet: URL: https://blog.ethereum.org/2015/06/26/state-tree-pruning/. [cited by applicant]
Cachin C., et al., “Introduction to Reliable and Secure Distributed Programming, ” Theoretical Computer Science, Aug. 29, 2019, 1 Page. [cited by applicant]
Castro M., et al., “Practical Byzantine Fault Tolerance,” Proceedings of the Third Symposium on Operating Systems Design and Implementation [online], Orleans, USA, Feb. 1999, vol. 99, pp. 173-186, Retrieved from the Int… [cited by applicant]
Catalini C., et al., “Market Design for a Blockchain-Based Financial System,” Social Science Research Network Working Paper No. 3396834, Jun. 2019, 6 Pages. [cited by applicant]
Catalini C., et al., “Some Simple Economics of the Blockchain,” Working Paper No. 22952, National Bureau of Economic Research, Apr. 20, 2019, 39 Pages. [cited by applicant]
Catalini C., et al., “The Libra Reserve,” The Libra Association [online], Aug. 14, 2019, 4 Pages, Retrieved from the Internet: URL: https://libra.org/about-currency-reserve. [cited by applicant]
Crary K., et., “Peer-to-Peer Affine Commitment Using Bitcoin,” In Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, Portland, USA, Jun. 15-17, 2015, 11 Pages. [cited by applicant]
Crosby S.A., et al., “Efficient Data Structures for Tamper-Evident Logging,” In 18th USENIX Security Symposium, Montreal, Canada, Aug. 10-14, 2009, 82 Pages. [cited by applicant]
Danezis G., et al., “Blockmania: From Block DAGs to Consensus DRAFT,” ArXiv Preprint, arXiv1809.01620v2 [online], Sep. 25, 2018, 20 Pages, Retrieved from the Internet: URL: http://arxiv.org/abs/1809.01620. [cited by applicant]
Das A., et al., “Resource-Aware Session Types for Digital Contracts,” arXiv preprint arXiv:1902.06056, Feb. 16, 2019, vol. 1, 28 pages. [cited by applicant]
Devanbu P. T., et al., “Authentic Third-Party Data Publication,” Proceedings of the IFIP TC11/WG11.3 Fourteenth Annual Working Conference on Database Security: Data and Application Security, Development and Directions [… [cited by applicant]
Douceur J.R., “The Sybil Attack,” In Peer-to-Peer Systems, First International Workshop, IPTPS, Cambridge, MA, USA, Mar. 7-8, 2002, 6 Pages. [cited by applicant]
Driscoll J.R., et al., “Making Data Structures Persistent,” Journal of Computer and System Sciences, Feb. 1989, vol. 38 (1), pp. 86-124. [cited by applicant]
Dwork C., et al., “Consensus in the Presence of Partial Synchrony,” Journal of the ACM (JACM), Apr. 1988, vol. 35 (2), pp. 288-323. [cited by applicant]
“ERC20 Token Standard,” The Ethereum Wiki [online], Aug. 29, 2019, 5 Pages, Retrieved from the Internet: URL: https://theethereum.wiki/w/index.php/ERC20_Token_Standard. [cited by applicant]
European Search Report for European Patent Application No. 22176361.8, mailed Aug. 17, 2022, 4 pages. [cited by applicant]
European Search Report for European Patent Application No. 22176367.5, mailed Aug. 19, 2022, 5 pages. [cited by applicant]
European Search Report for European Patent Application No. 22176382.4, mailed Aug. 25, 2022, 7 pages. [cited by applicant]
European Search Report for European Patent Application No. 22176472.3, mailed Aug. 31, 2022, 4 pages. [cited by applicant]
Gas and Fees, “Design Rationale,” GitHub [online], Aug. 29, 2019, 3 Pages, Retrieved from the Internet: URL: https://github.com/ethereum/wiki/wiki/Design-Rationale#gas-and-fees. [cited by applicant]
Girard J-Y., “Light Linear Logic,” Information and Computation, 1998, vol. 143 (2), 33 Pages. [cited by applicant]
Girard J-Y., “Linear Logic,” Theoretical Computer Science, 1987, 101 Pages. [cited by applicant]
Gudgeon L., et al., “SoK: Off The Chain Transactions,” International Association for Cryptologic Research, 2019, 17 Pages. [cited by applicant]
Hazari S.S., et al., “A Parallel Proof of Work to Improve Transaction Speed and Scalability in Blockchain Systems,” Institute of Electrical and Electronics Engineers, 2019, 6 Pages. [cited by applicant]
Herlihy M., “Blockchains and the Future of Distributed Computing,” Proceedings of the ACM Symposium on Principles of Distributed Computing [online], Jul. 25-27, 2017, 1 Page, Retrieved from the Internet: URL: https://do… [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2020/036769, mailed Nov. 9, 2020, 15 pages. [cited by applicant]
International Search Report for International Application No. PCT/US2020/036769, mailed Sep. 11, 2020, 6 Pages. [cited by applicant]
Jones N.D., et al., “Flow Analysis and Optimization of LISP-like Structures,” In ACM Principles of Programming Languages, 1979, pp. 244-256. [cited by applicant]
Josefsson S., et al., “Edwards-Curve Digital Signature Algorithm (EdDSA),” Request For Comments : 8032, Jan. 2017, pp. 1-60. [cited by applicant]
Kasireddy P., “How does Ethereum work anyway?,” Sep. 28, 2017 [Retrieved on Sep. 23, 2019], XP055625031, Retrieved from the Internet: URL:http://web.archive.org/web/20170928001233/http://web.archive.org/web/20170928001o… [cited by applicant]
Kate A., et al., “Distributed Key Generation for the Internet,” In IEEE International Conference on Distributed Computing Systems, 2009, 10 Pages. [cited by applicant]
KENSHI84., “Subaddresses #2056 Monero-Project/Monero,” Oct. 15, 2017, XP055951875, 35 pages, Retrieved from the Internet: URL: https://github.com/monero-project/monero/pull/2056. [cited by applicant]
Lamport L., et al., “The Byzantine Generals Problem,” ACM Transactions on Programming Languages and Systems, Jul. 1982, vol. 4 (3), pp. 382-401. [cited by applicant]
Lamport L., “Using Time Instead of Timeout for Fault-Tolerant Distributed Systems,” ACM Transactions on Programming Languages and Systems, Apr. 1984, vol. 6 (2), pp. 254-280. [cited by applicant]
Laurie B., et al., “Certificate Transparency,” Request For Comments: 6962, Jun. 2013, pp. 1-27. [cited by applicant]
Libra Association,“The Libra Association,” Libra [online], Aug. 12, 2019, 10 Pages, Retrieved from the Internet: URL: https://libra.org/en-us/association-council-principles. [cited by applicant]
Lindholm T., et al., “The Java Virtual Machine Specification,” Java SE 8 Edition, Feb. 13, 2015, 604 Pages. [cited by applicant]
Malavolta G., et al., “Concurrency and Privacy With Payment-Channel Networks,” In Proceedings of the ACM SIGSAC Conference on Computer and Communications Security, 2017, 27 Pages. [cited by applicant]
Mazurak K., et al., “Lightweight Linear Types in System F,” In Proceedings of ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, Madrid, Spain, Jan. 23, 2010, 12 Pages. [cited by applicant]
Meijer E., et al., “Technical Overview of the Common Language Runtime,” 2000, 11 Pages. [cited by applicant]
Merkle R.C., “A Digital Signature Based on a Conventional Encryption Function,” Conference on the Theory and Application of Cryptographic Techniques, CRYPTO, 1987, pp. 369-378. [cited by applicant]
Micali S., et al., “Verifiable Random Functions,” In 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039), 1999, pp. 120-130. [cited by applicant]
Milner R., et al., “Definition of Standard ML,” The MIT Press, Cambridge, London, England, 1990, 136 Pages. [cited by applicant]
Nakamoto S., “Bitcoin: A Peer-to-Peer Electronic Cash System,” Bitcoin Organisation [online], 2008, 9 Pages, https://bitcoin.org/bitcoin.pdf. [cited by applicant]
Naor M., et al., “Certificate Revocation and Certificate Update,” Proceedings of the 7th USENIX Security Symposium, Jan. 26-29, 1998, 13 Pages. [cited by applicant]
Notice of Allowance mailed Apr. 30, 2021 for U.S. Appl. No. 16/442,475, filed Jun. 15, 2019, 7 Pages. [cited by applicant]
Office Action mailed Aug. 4, 2021 for U.S. Appl. No. 16/442,473, filed Jun. 15, 2019, 27 Pages. [cited by applicant]
Office Action mailed Jul. 7, 2021 for U.S. Appl. No. 16/442,470, filed Jun. 15, 2019, 26 Pages. [cited by applicant]
Office Action mailed May 7, 2021 for U.S. Appl. No. 16/442,476, filed Jun. 15, 2019, 128 Pages. [cited by applicant]
Office Action mailed May 14, 2021 for U.S. Appl. No. 16/442,472, filed Jun. 15, 2019, 86 Pages. [cited by applicant]
Office Action mailed Feb. 18, 2021 for U.S. Appl. No. 16/442,470, filed Jun. 15, 2019, 45 Pages. [cited by applicant]
Office Action mailed Apr. 23, 2021 for U.S. Appl. No. 16/442,473, filed Jun. 15, 2019, 38 Pages. [cited by applicant]
Office Action mailed Jan. 25, 2021 for U.S. Appl. No. 16/442,475, filed Jun. 15, 2019, 30 Pages. [cited by applicant]
Office Action mailed Mar. 30, 2021 for U.S. Appl. No. 16/442,474, filed Jun. 15, 2019, 44 Pages. [cited by applicant]
Okasaki C., “Purely Functional Data Structures,” Cambridge University Press, Sep. 1996, 162 Pages. [cited by applicant]
Pass R., et al., “Thunderella: Blockchains With Optimistic Instant Confirmation,” Annual International Conference on the Theory and Applications of Cryptographic Techniques [online], 2017, 72 Pages, Retrieved from the I… [cited by applicant]
Perrin T., “The Noise Protocol Framework,” Noise Project, Jul. 11, 2018, 65 Pages. [cited by applicant]
Pfitzmann A., et al., “Anonymity, Unobservability, and Pseudonymity—A Proposal for Terminology,” Designing Privacy Enhancing Technologies, 2001, 10 Pages. [cited by applicant]
Pierce B.C., “Types and Programming Languages,” The MIT Press, Cambridge, Massachusetts, 2002, 2 Pages. [cited by applicant]
Reed D.P., “Naming and Synchronization in a Decentralized Computer System,” PhD hesis, Masssachusetts Institute of Technology, Cambridge, MA, USA, Sep. 1978, 217 Pages. [cited by applicant]
Reyzin L., et al., “Improving Authenticated Dynamic Dictionaries, With Applications to Cryptocurrencies,” In Financial Cryptography and Data Security, 21st International Conference, Sliema, Malta, Apr. 3-7, 2017, 23 Pag… [cited by applicant]
Reyzin L., et al., “Efficient Asynchronous Accumulators for Distributed PKI,” In Security and Cryptography for Networks—10th International Conference, SCN, Amalfi, Italy, Aug. 31-Sep. 2, 2016, 23 Pages. [cited by applicant]
Rutherford S., “4 Types of Bank Account Data Errors That May Be Causing Payment Failure,” Fraud Prevention [online], Sep. 2014 [Retrieved on Apr. 2, 2021], 3 Pages, Retrieved from the Internet: URL: https://www.experian… [cited by applicant]
Saad M., et al., “Exploring the Attack Surface of Blockchain: A Systematic Overview,” Computing Research Repository (CoRR), arXiv:1904.03487v1, Apr. 6, 2019, 30 Pages. [cited by applicant]
Schneider F.B., “Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial,” ACM Computing Surveys (CSUR), Dec. 1990, vol. 22 (4), pp. 299-319. [cited by applicant]
Script, “Script—Bitcoin Wiki,” Bitcoin.org [online], Aug. 29, 2019, 7 Pages, Retrieved from the Internet: URL: https://en.bitcoin.it/wiki/Script. [cited by applicant]
Sergey I., et al., “A Concurrent Perspective on Smart Contracts,” In Financial Cryptography and Data Security, arXiv: 1702.05511v1, Feb. 17, 2017, 15 Pages. [cited by applicant]
Szabo N., “Formalizing and Securing Relationships on Public Networks,” First Monday [online], Sep. 1997 [Retrieved Aug. 29, 2019], vol. 2 (9), 12 Pages, Retrieved from the Internet: URL: https://ojphi.org/ojs/index.php/… [cited by applicant]
Tamassia R., “Authenticated Data Structures,” 11th Annual European Symposium on Algorithms, Budapest, Hungary [online], Sep. 16-19, 2003, pp. 2-5, Retrieved from the Internet: URL: http://www.cs.brown.edu/˜rt/. [cited by applicant]
Team Rocket, “Snowflake to Avalanche: A Novel Metastable Consensus Protocol Family for Cryptocurrencies,” T-Rocket [online], 2018, 21 Pages, Retrieved from the Internet: URL: https://ipfs.io/ipfs/Cl.mUy4jh5mGNZvLkjiesIR… [cited by applicant]
“The gRPC Project,” Documentation [online], Aug. 29, 2019, 2 Pages, Retrieved from the Internet: URL: https://grpc.io/docs/guides/. [cited by applicant]
The libp2p Project, “A Modular Network Stack,” Protocol Lab [online], Aug. 29, 2019, 3 Pages, Retrieved from the Internet: URL: https://libp2p.io. [cited by applicant]
The Libra Association, “How to Become a Founding Member,” Libra Blockchain, 2019, 4 Pages. [cited by applicant]
The Libra Association, “Libra Developers,” Libra [online], Aug. 29, 2019, 1 Page, Retrieved from the Internet: URL: https://developers.libra.org. [cited by applicant]
The Libra Association, “The Path Forward,” Roadmap TODO [online], Jun. 18, 2019, 3 Pages, Retrieved from the Internet: URL: https://developers.libra.org/blog/2019/06/18/the-path-forward. [cited by applicant]
The Libra Association, “Welcome to Libra,” White Paper [online], Jul. 23, 2019, 12 Pages, Retrieved from the Internet: URL: https://libra.org/en-us/whitepaper. [cited by applicant]
“The Multiformats/Multiaddr Project,” Multiformats [online], 5 Pages, Retrieved from the Internet: URL: https://multiformats.io/multiaddr/. [cited by applicant]
“The Parity Wallet Hack Explained,” Open Zeppelin Blog [online], 2017, 3 Pages, Retrieved from the Internet: URL: https://blog.zeppelin.solutions/on-the-parity-wallet-multisig-hack-405a8c12e8f7/. [cited by applicant]
“The Yamux Project,” Join GitHub Today [online], Jun. 9, 2016 [Retrieved on Aug. 29, 2019], 3 Pages, Retrieved from the Internet: URL: https://github.com/hashicorp/yamux/blob/master/spec.md. [cited by applicant]
Wood G., “Ethereum: A Secure Decentralised Generalised Transaction Ledger,” EIP-150 Revision [online], 2016, 32 Pages, Retrieved from the Internet: URL: http://gavwood.com/paper.pdf. [cited by applicant]
Yin J., et al., “Separating Agreement from Execution for Byzantine Fault Tolerant Services,” ACM Symposium on Operating Systems Principles (SOSP), Oct. 19-22, 2003, 15 Pages. [cited by applicant]
Yin M., et al., “HotStuff: BFT Consensus in the Lens of Blockchain,” arXiv preprint, arXiv:1803.05069v6, Jul. 23, 2019, 23 Pages. [cited by applicant]
Ibanez L.D., et al., “Blockchains and Digital Assets,” EUBlockChain Observatory and Forum, 2018, 14 pages. [cited by applicant]
Bernardini M., et al., Blockchains Meet Distributed Hash Tables: Decoupling Validation from State Storage, arXiv: 1904.01935, Mar. 2019, 13 pages. [cited by applicant]