IP Library Granted Patent US 12,518,286
Granted Patent B2
US 12,518,286 · App. 18/829,791 · Granted Jan 6, 2026

Temporary consensus networks in a resource transfer system

Inventors: Stefan Thomas (San Francisco, CA); Evan Schwartz (New York, NY)
Assignee: Interledger Foundation Inc.
G06Q20/405G06Q20/0855G06Q20/401H04L63/10
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,518,286
App. No.
18/829,791
Filed
Sep 10, 2024
Granted
Jan 6, 2026
Kind
B2
Art Unit
3698
USPC
705/12
Abstract

Systems and techniques are provided for a resource transfer system. An instruction to transfer a first quantity of a resource from a first resource pool to a second resource pool may be received. A hold may be placed on a second quantity of the resource in the first resource pool. The held second quantity of the first resource may not be transferred from the first resource pool until the hold is released. Responsive to receiving a message that fulfills a condition on the hold and an instruction to execute the transfer, the hold may be released. A register that is in the first resource pool and is associated with the resource may decremented by the first quantity, and a register that is in the second resource pool and is associated with the resource may be incremented by the first quantity.

Claims (32)

1 . A computer-implemented method performed on a data processing apparatus comprising:

sending a request for a trust list to a plurality of stakeholder systems in a transfer chain comprising a plurality of stakeholder systems and a plurality of resource tracking systems, wherein the transfer chain is associated with a transfer;

receiving trust lists for each of the plurality of stakeholder systems in the transfer chain;

determining an intersection of nodes on the received trust lists to generate a temporary consensus network wherein member nodes of the temporary consensus network are nodes from the intersection of nodes on the received trust lists;

sending requests to stakeholder systems, from the plurality of stakeholder systems in the transfer chain, that are part of a destination transfer that the stakeholder systems place holds on specified quantities of specified resource types in specified resource pools at a specified ones of the plurality of resource tracking systems;

receiving confirmation that the stakeholder systems to which the requests to place the holds were sent have placed the holds, wherein the confirmation comprises either prepared transfer receipts generated by each of the plurality of resource tracking systems in the transfer chain or a receipt from a specified party;

receiving acknowledgements from each stakeholder system in the transfer chain of an agreement to participate in the transfer associated with the transfer chain;

sending either the prepared transfer receipts or the receipt from the specified party to member nodes of the temporary consensus network;

receiving from at least a threshold number of the member nodes of the temporary consensus network a statement indicating that the temporary consensus network has approved the transfer associated with the transfer chain; and

sending the statements from the at least a threshold number of the member nodes of the temporary consensus network to the stakeholder systems.

2 . The computer-implemented method of claim 1 wherein the plurality of stakeholder systems comprises a sender, a receiver, at least one intermediary.

3 . The computer-implemented method of claim 1 , wherein the threshold number of member nodes is ⅓ of the number of member nodes.

4 . The computer-implemented method of claim 3 , wherein the temporary consensus network approved the transfer when a quorum of member nodes determine that the transfer is approved based on either one or more prepared transfer receipts or a receipt from a specified party.

5 . The computer-implemented method of claim 4 , wherein a quorum is ⅔ of the number of member nodes.

6 . The computer-implemented method of claim 1 , wherein the number of member nodes of the temporary consensus network is greater than a minimum number that is based on fault tolerances specified by the stakeholder systems.

7 . The computer-implemented method of claim 6 , wherein the fault tolerances are specified as a minimum number of Byzantine failures the temporary consensus network can withstand.

8 . A computer-implemented system for resource transfer comprising:

a processor that sends a request for a trust list to a plurality of stakeholder systems in a transfer chain comprising a plurality of stakeholder systems and a plurality of resource tracking systems, wherein the transfer chain is associated with a transfer,

receives trust lists for each of the plurality of stakeholder systems in the transfer chain;

determining an intersection of nodes on the received trust lists to generate a temporary consensus network wherein member nodes of the temporary consensus network are nodes from the intersection of nodes on the received trust lists,

sends requests to stakeholder systems, from the plurality of stakeholder systems in the transfer chain, that are part of a destination transfer that the stakeholder systems place holds on specified quantities of specified resource types in specified resource pools at a specified ones of the plurality of resource tracking systems,

receives confirmation that the stakeholder systems to which the requests to place the holds were sent have placed the holds, wherein the confirmation comprises either prepared transfer receipts generated by each of the plurality of resource tracking systems in the transfer chain or a receipt from a specified party,

receives acknowledgements from each stakeholder system in the transfer chain of an agreement to participate in the transfer associated with the transfer chain,

sends either the prepared transfer receipts or the receipt from the specified party to member nodes of the temporary consensus network,

receives from at least a threshold number of the member nodes of the temporary consensus network a statement indicating that the temporary consensus network has approved the transfer associated with the transfer chain, and

sends the statements from the at least a threshold number of the member nodes of the temporary consensus network to the stakeholder systems.

9 . The system of claim 8 wherein the plurality of stakeholder systems comprises a sender, a receiver, at least one intermediary.

10 . The system of claim 8 , wherein the threshold number of member nodes is ⅓ of the number of member nodes.

11 . The system of claim 10 , wherein the temporary consensus network approved the transfer when a quorum of member nodes determine that the transfer is approved based on either one or more prepared transfer receipts or a receipt from a specified party.

12 . The system of claim 11 , wherein a quorum is ⅔ of the number of member nodes.

13 . The system of claim 8 , wherein the number of member nodes of the temporary consensus network is greater than a minimum number that is based on fault tolerances specified by the stakeholder systems.

14 . The system of claim 13 , wherein the fault tolerances are specified as a minimum number of Byzantine failures the temporary consensus network can withstand.

Assignments (2)
CORRECTIVE ASSIGNMENT TO CORRECT THE ASSIGNEE NAME PREVIOUSLY RECORDED AT REEL: 68684 FRAME: 982. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Recorded Mar 19, 2025
From: RIPPLE LUXEMBOURG S.A.
To: INTERLEDGER FOUNDATION INC.
Reel/Frame 070660/0786 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 24, 2024
From: RIPPLE LUXEMBOURG S.A.
To: INTERLEDGER FOUNDATION
Reel/Frame 068684/0982 →
Continuity (4)
Continuation 17868589 · Jul 19, 2022
Continuation 14875607 · Oct 5, 2015
Continuation In Part 14717390 · May 20, 2015
Related Publication 20250005584A1 · Jan 2, 2025
References Cited (99)
US 6412002B1 · Denman · 2002 [cited by examiner]
US 6658568B1 · Ginter et al. · 2003 [cited by applicant]
US 7103580B1 · Batachia et al. · 2006 [cited by applicant]
US 7181614B1 · Gehrmann et al. · 2007 [cited by applicant]
US 7558883B1 · Lamport · 2009 [cited by applicant]
US 7707118B2 · James · 2010 [cited by applicant]
US 8560423B1 · Understein · 2013 [cited by applicant]
US 9063787B2 · Lee et al. · 2015 [cited by applicant]
US 9572029B2 · Gaudet · 2017 [cited by examiner]
US 9875510B1 · Kasper · 2018 [cited by examiner]
US 10269009B1 · Winklevoss · 2019 [cited by examiner]
US 20010047328A1 · Triola · 2001 [cited by applicant]
US 20010047329A1 · Ashby · 2001 [cited by applicant]
US 20020046169A1 · Keresman et al. · 2002 [cited by applicant]
US 20020087469A1 · Ganesan et al. · 2002 [cited by applicant]
US 20020188558A1 · Morimoto · 2002 [cited by applicant]
US 20030149986A1 · Mayfield et al. · 2003 [cited by applicant]
US 20030208413A1 · Ray · 2003 [cited by applicant]
US 20030208440A1 · Harada et al. · 2003 [cited by applicant]
US 20040162943A1 · Degenaro et al. · 2004 [cited by applicant]
US 20060106805A1 · Aaron · 2006 [cited by applicant]
US 20080195485A1 · Kennedy · 2008 [cited by applicant]
US 20080300836A1 · Timmer et al. · 2008 [cited by applicant]
US 20090076944A1 · Brams et al. · 2009 [cited by applicant]
US 20090138398A1 · Cole et al. · 2009 [cited by applicant]
US 20090198623A1 · Rubinstein · 2009 [cited by applicant]
US 20090240913A1 · Obana et al. · 2009 [cited by applicant]
US 20090248574A1 · Leung et al. · 2009 [cited by applicant]
US 20100287100A1 · Avazian et al. · 2010 [cited by applicant]
US 20110082802A1 · Baghdasary et al. · 2011 [cited by applicant]
US 20110191847A1 · Davis et al. · 2011 [cited by applicant]
US 20110276473A1 · Blok · 2011 [cited by applicant]
US 20120117157A1 · Ristock · 2012 [cited by examiner]
US 20120303631A1 · Bird · 2012 [cited by examiner]
US 20130036057A1 · Hendrix et al. · 2013 [cited by applicant]
US 20130073859A1 · Carlson et al. · 2013 [cited by applicant]
US 20130138491A1 · Gao et al. · 2013 [cited by applicant]
US 20130219184A1 · Amaya Calvo et al. · 2013 [cited by applicant]
US 20130266141A1 · Kim et al. · 2013 [cited by applicant]
US 20130291056A1 · Gaudet et al. · 2013 [cited by applicant]
US 20140019747A1 · Anshel et al. · 2014 [cited by applicant]
US 20140156512A1 · Rahman et al. · 2014 [cited by applicant]
US 20140156530A1 · Suitner · 2014 [cited by applicant]
US 20140164765A1 · Hernándex et al. · 2014 [cited by applicant]
US 20140358760A1 · Heskett-Paoloni · 2014 [cited by applicant]
US 20150058636A1 · Owlett et al. · 2015 [cited by applicant]
US 20150170112A1 · Decastro · 2015 [cited by applicant]
US 20150220928A1 · Allen · 2015 [cited by applicant]
US 20150262137A1 · Armstrong · 2015 [cited by applicant]
US 20150287026A1 · Yang et al. · 2015 [cited by applicant]
US 20160092988A1 · Letourneau · 2016 [cited by applicant]
US 20160125416A1 · Spencer et al. · 2016 [cited by applicant]
US 20160189151A1 · He et al. · 2016 [cited by applicant]
US 20160234026A1 · Wilkins et al. · 2016 [cited by applicant]
US 20160253622A1 · Sriram et al. · 2016 [cited by applicant]
US 20160260169A1 · Arnold · 2016 [cited by examiner]
US 20160342976A1 · Davis · 2016 [cited by applicant]
US 20160342981A1 · Thomas et al. · 2016 [cited by applicant]
US 20160342983A1 · Thomas et al. · 2016 [cited by applicant]
US 20170091750A1 · Maim · 2017 [cited by applicant]
US 20170187535A1 · Middleton · 2017 [cited by examiner]
US 20170308872A1 · Uhr et al. · 2017 [cited by applicant]
AU 783008B2 · 2001 [cited by applicant]
EP 2538386A1 · 2012 [cited by applicant]
KR 20160103726A · 2016 [cited by applicant]
SG 11201802796U · 2018 [cited by applicant]
WO 2012027585A2 · 2012 [cited by applicant]
WO 2015171580A1 · 2015 [cited by applicant]
Swanson, “Great Wall of Numbers—Business Opportunities and Challenges in China,” chapter 3, 2014, retrieved from https://web.archive.org/web/20140312045304/http://www.ofnumbers.com/2014/03/04/chapter-3-next-generation-p… [cited by examiner]
V. Kumar and A. Agarwal, “An Efficient Read Dominant Data Replication Protocol under Serial Isolation using Quorum Consensus Approach,” CoRR, vol. abs/1406.7423 (Year: 2014). [cited by examiner]
Andrychowicz, et al., “Fair Two-Party Computations via Bitcoin Deposits,” In: Bohme, R., Brenner, M., Moore, T., Smith, M. (eds) Financial Cryptography and Data Security, 2014, Lecture Notes in Computer Science( ), vol.… [cited by applicant]
Andrychowicz, et al., “How to deal with malleability of BitCoin transactions,” arXiv:1312.3230 [cs.CR], 2013. [cited by applicant]
Andrychowicz, et al., “Modeling Bitcoin Contracts by Timed Automata*,” arXiv:1405.1861 [cs.CR], 2014. [cited by applicant]
Apeltsin, “A CryptoCubic Protocol for Hacker-Proof Off-Chain Bitcoin Transactions,” arXiv:1408.2824v1 [cs.CR], Mon, Aug. 11, 2014 21:36:03 UTC (509 KB). [cited by applicant]
Bitcointalk “Proof of stake instead of proof of work” https://bitcointalk.org/index/php?topic=27787.0, captured on Nov. 2, 2013 from https://web.archive.org/web/20131102231637/https://bitcointalk.org/index.php?topic=277… [cited by applicant]
Blanchette, “The Equivalent of a Written Signature,” in Burdens of Proof: Cryptographic Culture and Evidence Law in the Age of Electronic Documents, MIT Press, 2012, pp. 63-92. [cited by applicant]
Buterin (“Etherum White Paper—A Next Generation Smart Contract & Decentralized Application Platform”, Buterin, ethereum.org 36 pages) retrieved on crawl by the Internet Archive on Dec. 23, 2024. [cited by applicant]
Catalano, “A fair micro-payment scheme for profit sharing in P2P networks,” 2004 International Workshop Jon Hot Topics in Peer-to-Peer Systems, 2004, pp. 32-39, doi: 10.1109/PTPSYS.2004.1. [cited by applicant]
Coulouris, et al., “Distributed Systems: Concepts and Design”, (5th Edition), 2011, US, Addison-Wesley, (May 7, 2011), pp. ToC, Pre, CH01-04, CH12, CH14-CH15, CH18, ISBN 978-0-13-214301-1, XP055263685. [cited by applicant]
D. Jayasinghe, “Optimistic Fair-Exchange with Anonymity for Bitcoin Users,” 2014, IEEE 11th International Conference on e-Business Engineering, Guangzhou, China, 2014, pp. 44-51, doi: 10.1109/ICEBE.2014.20. [cited by applicant]
Dani, et al., “Secure Multi-Party Computation in Large Networks,” (2012), Retrieved from https://arxiv.org/abs/1203.0289 (2012). [cited by applicant]
Duffield, Darkcoin: Peer-to-Peer Crypto-Currency with Anonymous Blockchain Transactions and an Improved Proof-of-Work (Mar. 18, 2014) retrieved on Jul. 22, 2014 from https://web.archive.org/web/20140722015229/http://diy… [cited by applicant]
El-Qorchi, “The Hawala System”, Dec. 2002, Finance and Development, vol. 39, No. 4. [cited by applicant]
G.J. Simmons, “A protocol to provide verifiable proof of identity and unforgeable transaction receipts,” in IEEE Journal on Selected Areas in Communications, vol. 7, No. 4, pp. 435-447, May 1989, doi: 10.1109/49.17706. [cited by applicant]
Gerhardt, et al, “Homomorphic Payment Addresses and the Pay-to-Contract Protocol,” arXiv:1212.3257 [cs.CR], 2012. [cited by applicant]
Katz, Digital Signatures, Ed. 1. Chapter 1, ISBN 978-0-387-27711-0 Springer-Verlag, 2010. [cited by applicant]
Kelly, The Bitcoin Big Bang: “How Alternative Currencies Are About to Change the World”, Nov. 2014, John Wiley & Sons. [cited by applicant]
Kumar, et al., “An Efficient Read Dominant Data Replication Protocol under Serial Isolation using Quorum Consensus Approach,” (2014), Retrieved from https://arxiv.org/abs/1406.7423 (2014). [cited by applicant]
Larimer, “Delegated Proof-of-Stake”, Apr. 3, 2014, Bitshares. Retrieved from archive.org on May 27, 2014, pp. 1-10. [cited by applicant]
Larimer, “Delegated Proof-of-Stake”, retrieved on May 27, 2014 from https://web.archive.org/web/20140527232932/hllp://bitshares.org/delegated-proof-of-stake/. [cited by applicant]
M.J. Mampaey, “Secure remittance transaction to bankless consumers in a fragmented applications market,” in Bell Labs Technical Journal, vol. 16, No. 2, pp. 219-233, Sep. 2011, doi: 10.1002/bitj20512. [cited by applicant]
Pedro Franco, “Understanding Bitcoin: Cryptography, Engineering and Economics”, Wiley, (2015), ISBN 978-1-119-01916-9, 54 pages. [cited by applicant]
Pfeffer, “The Decrits Consensus Algorithm: Decentralized Agreement without Proof of work” arXiv:1411.1101 https://doi.org/10.48550/arXiv.1411.1101 (2014). [cited by applicant]
Preguica, “Revisiting hierarchical quorum systems,” Proceedings 21st International Conference on Distributed Computing Systems, Mesa, AZ, USA, 2001, pp. 264-272, doi: 10.1109/ICDSC.2001.918956. (2001). [cited by applicant]
Tanenbaum, et al., Processes. “Distributed Systems Principles and Paradigms” (2nd Edition), 2006, Prentice Hall, (Oct. 12, 2006), ISBN 978-0-13-239227-3. [cited by applicant]
Tewari, “Multiparty micropayments for ad hoc networkds,” 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003., 2003, pp. 2033-2040 vol. 3 doi: 10.1109/WCNC.2003.1200699. [cited by applicant]
Toedtmann, et al. OpenCoin—the original protocol, including wallet to wallet transactions. Retrieved from https://web.archive.org/web/20131001000000*/hllps://opencoin.org/Members/jhb/protocol.txUview on Oct. 8, 2013. [cited by applicant]
Tzong-Chen Wu, Two ID-based multisignature protocols for sequential and broadcasting architectures. Comput. Commun. 19(9-10): 851-856 (1996). [cited by applicant]
Wikipedia, “Consensus decision-making”, (Jan. 30, 2015), URL: https://en.wikipedia.org/w/index.php?title=Consensus_decision-making&oldid=644846809, (Apr. 8, 2016), XP055263780. [cited by applicant]