IP Library Granted Patent US 12,217,254
Granted Patent B2
US 12,217,254 · App. 16/097,222 · Granted Feb 4, 2025

Method and system for controlling the performance of a contract using a distributed hash table and a peer-to-peer distributed ledger

Inventors: Craig Steven Wright (London, GB); Stephane Savanah (London, GB)
Assignee: NCHAIN LICENSING AG
G06Q20/389G06F21/00G06Q20/02G06Q20/065G06Q20/3678G06Q20/3827G06Q20/3829H04L9/0643H04L9/30H04L9/3247H04L9/3252G06F2221/2145G06Q2220/00H04L2209/56
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,217,254
App. No.
16/097,222
Granted
Feb 4, 2025
Kind
B2
Abstract

A computer-implemented method ( 100 ) and system ( 1 ) for controlling the performance of a smart contract. The method includes storing a contract on or in a computer-based repository. The contract is associated with a licence between a first user (U 1 ) and a second user (U 2 ). The method further includes receiving, over a communications network, a transaction comprising a transfer of a token from an agent (A) to the first user (U 1 ) or the second user (U 2 ). The transaction comprises metadata that includes an identifier indicative of a location where the contract is stored. The method further includes querying a peer-to-peer distributed ledger (i.e. blockchain) to determine whether the transaction comprises at least one unspent output (UTXO). The method further includes, responsive to querying the peer-to-peer distributed ledger, determining whether to modify performance of the contract. The blockchain may be the Bitcoin blockchain.

Claims (56)

1. A computer-implemented method for controlling the performance of a contract, the method implemented by a processing resource, the method comprising:

storing a contract in a Distributed Hash Table (DHT) comprising a plurality of key-value pairs, the contract being associated with a contract of computer software between a first user (U 1 ) and a second user (U 2 ),

determining, by the processing resource, a key and a key value pair based on the computer software and the contract;

receiving at the processing resource over a communications network, a transaction comprising a transfer of a token from an agent (A) to the first user (U 1 ) or the second user (U 2 ), the transaction comprising metadata that includes an identifier indicative of a location in the DHT where the contract is stored;

querying, by the processing resource, a peer-to-peer distributed ledger to determine whether the transaction comprises at least one unspent output (UTXO) wherein querying a peer-to-peer distributed ledger comprises scanning the peer-to-peer distributed ledger to identify the at least one unspent output (UTXO) to determine whether the at least one unspent output (UTXO) has been spent or not; and

modifying, by the processing resource, performance of the contract, wherein the modifying comprises:

terminating the contract in the event that the at least one unspent output (UTXO) cannot be identified from the peer-to-peer distributed ledger, or

maintaining the contract in the event that the at least one unspent output (UTXO) is identified from the peer-to-peer distributed ledger, wherein the step of terminating the license comprises broadcasting a further transaction to spend the at least one unspent output (UTXO), wherein in the step of broadcasting the further transaction, the further transaction comprises an instruction to spend the at least one unspent output (UTXO) at a specified date and/or time, wherein the further transaction comprises:

an input that spends the at least one unspent output (UTXO); and

a redeem script comprising a signature, the metadata, an agent public key associated with the agent, and a first user public key associated with the first users.

2. The method of claim 1 , wherein the transaction further comprises a deterministic redeem script address.

3. The method of claim 2 , wherein the redeem script address is a pay-to-script-hash (P2SH) address.

4. The method according to claim 1 , wherein the contract defines:

at least one condition, the at least one condition relating to operation of the contract as between the first user (U 1 ) and the second user (U 2 ); and

at least one action whose performance is dependent upon the evaluation of the condition.

5. The method according to claim 1 , wherein the metadata comprises:

an address or representation of an address of where the contract is stored in the computer-based repository; and/or

a hash of the contract.

6. The method according to claim 1 , wherein the step of querying the peer-to-peer distributed ledger further comprises:

checking whether the contract has been terminated by determining whether the at least one unspent output (UTXO) is present in a list of unspent transaction outputs for the peer-to-peer distributed ledger.

7. The method according to claim 1 , wherein the contract comprises a Deterministic Finite Automation (DFA) to implement the contract.

8. The method according to claim 7 , wherein the Deterministic Finite Automation (DFA) is defined using a codification scheme.

9. The method according to claim 1 , further comprising the step of renewing the contract by performing the steps of:

generating a sub-key relating to a previous key associated with the contract;

generating a further redeem script comprising the sub-key, the location of the contract, and a hash of the contract; and

paying a quantity of a cryptocurrency (C) to the further redeem script.

10. The method according to claim 1 , further comprising the step of generating a sub-contract derived from the contract, wherein the sub-contract is associated with a deterministic address and is generated by performing the steps of:

using a new public key derived using a seed;

storing the sub-contract in or on the computer-based repository with a reference to the contract;

broadcasting a sub-contract transaction to the peer-to-peer distributed ledger, the sub-contract transaction including the reference to the contract; and

adding, to the metadata associated with the contract, a reference to the sub-contract.

11. The method of claim 1 , wherein the contract between the first user (U 1 ) and the second user (U 2 ) relates to one or more of:

the computer software; and

digital media, including music, videos, and electronic books.

12. The method of claim 1 , wherein the peer-to-peer distributed ledger is a blockchain.

13. The method of claim 9 , wherein the cryptocurrency is bitcoin.

14. A non-transitory computer-readable storage medium comprising machine-readable instructions which, when executed by a processing device, cause the processing device to:

store a contract in a Distributed Hash Table (DHT) comprising a plurality of key-value pairs, the contract being associated with a contract for computer software between a first user (U 1 ) and a second user (U 2 ),

determining, by the processing resource, a key and a key value pair based on the computer software and the license;

receive at the processing device over a communications network, a transaction comprising a transfer of a token from an agent (A) to the first user (U 1 ) or the second user (U 2 ), the transaction comprising metadata that includes an identifier indicative of a location in the DHT where the contract is stored;

query, by the processing device, a peer-to-peer distributed ledger to determine whether the transaction comprises at least one unspent output (UTXO) wherein querying a peer-to-peer distributed ledger comprises scanning the peer-to-peer distributed ledger to identify the at least one unspent output (UTXO) to determine whether the at least one unspent output (UTXO) has been spent or not; and

modifying, by the processing device, performance of the contract, wherein the modifying comprises:

terminating the contract in the event that the at least one unspent output (UTXO) cannot be identified from the peer-to-peer distributed ledger, or

maintain the contract in the event that the at least one unspent output (UTXO) is identified from the peer-to-peer distributed ledger, wherein the step of terminating the license comprises broadcasting a further transaction to spend the at least one unspent output (UTXO), wherein in the step of broadcasting the further transaction, the further transaction comprises an instruction to spend the at least one unspent output (UTXO) at a specified date and/or time, wherein the further transaction comprises:

an input that spends the at least one unspent output (UTXO); and

a redeem script comprising a signature, the metadata, an agent pubic key associated with the agent, and a first user public key associated with the first user.

15. A computer system for controlling the performance of a contract, the system comprising a processing device configured to:

store a contract in a Distributed Hash Table (DHT) comprising a plurality of key-value pairs, the contract being associated with a contract of computer software between a first user (U 1 ) and a second user (U 2 ),

determining, by the processing resource, a key and a key value pair based on the computer software and the contract;

receive, over a communications network, a transaction comprising a transfer of a token from an agent (A) to the first user (U 1 ) or the second user (U 2 ), the transaction comprising metadata that includes an identifier indicative of a location in the DHT where the contract is stored;

query a peer-to-peer distributed ledger to determine whether the transaction comprises at least one unspent output (UTXO); and

modifying performance of the contract, wherein the modifying comprises:

terminating the contract in the event that the at least one unspent output (UTXO) cannot be identified from the peer-to-peer distributed ledger, or

maintain the contract in the event that the at least one unspent output (UTXO) is identified from the peer-to-peer distributed ledger, wherein the step of terminating the license comprises broadcasting a further transaction to spend the unspent output (UTXO), wherein in the step of broadcasting the further transaction, the further transaction comprises an instruction to spend the at least one unspent output (UTXO) at a specified date and/or time, wherein the further transaction comprises:

an input that spends the at least one unspent output (UTXO); and

a redeem script comprising a signature, the metadata, an agent public key associated with the agent, and a first user public key associated with the first user.

Assignments (5)
CHANGE OF NAME Recorded Feb 3, 2025
From: NCHAIN HOLDINGS AG
To: NCHAIN LICENSING AG
Reel/Frame 070096/0394 →
CHANGE OF NAME Recorded Mar 23, 2023
From: NCHAIN HOLDINGS LTD
To: NCHAIN LICENSING AG
Reel/Frame 063148/0650 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 6, 2023
From: WRIGHT, CRAIG STEVEN
To: NCHAIN LICENSING AG
Reel/Frame 062311/0277 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 30, 2022
From: WRIGHT, CRAIG STEVEN; SAVANAH, STEPHANE
To: NCHAIN HOLDINGS LTD
Reel/Frame 061930/0674 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 15, 2022
From: SAVANAH, STEPHANE
To: NCHAIN HOLDINGS LTD
Reel/Frame 059615/0868 →
Priority Claims (1)
GB 1607477 · Apr 29, 2016 · national
Continuity (1)
Related Publication 20190095909A1 · Mar 28, 2019
References Cited (140)
US RE38451E · Veenstra · 2004 [cited by applicant]
US 9063978B1 · Kapoor et al. · 2015 [cited by applicant]
US 9933760B2 · Bonnat · 2018 [cited by applicant]
US 10050779B2 · Alness et al. · 2018 [cited by applicant]
US 10523443B1 · Kleinman · 2019 [cited by applicant]
US 11341484B2 · Wright et al. · 2022 [cited by applicant]
US 20040015496A1 · Anonsen · 2004 [cited by applicant]
US 20040215650A1 · Shaji et al. · 2004 [cited by applicant]
US 20050120133A1 · Slack-Smith · 2005 [cited by examiner]
US 20050188085A1 · Lin · 2005 [cited by examiner]
US 20070013967A1 · Ebaugh · 2007 [cited by examiner]
US 20070136155A1 · Chape et al. · 2007 [cited by applicant]
US 20080126065A1 · Nicholas · 2008 [cited by applicant]
US 20100058477A1 · Ciet et al. · 2010 [cited by applicant]
US 20110113238A1 · Jennings · 2011 [cited by examiner]
US 20110218891A1 · Sjelvgren et al. · 2011 [cited by applicant]
US 20130197752A1 · Planche et al. · 2013 [cited by applicant]
US 20150074159A1 · Poschmann et al. · 2015 [cited by applicant]
US 20150120567A1 · Van Rooyen · 2015 [cited by examiner]
US 20150163992A1 · Anderson · 2015 [cited by examiner]
US 20150206106A1 · Yago · 2015 [cited by examiner]
US 20150269570A1 · Phan et al. · 2015 [cited by applicant]
US 20150278820A1 · Meadows · 2015 [cited by applicant]
US 20150324764A1 · Van Rooyen et al. · 2015 [cited by applicant]
US 20150332283A1 · Witchey · 2015 [cited by applicant]
US 20150379510A1 · Smith · 2015 [cited by applicant]
US 20160085955A1 · Lerner · 2016 [cited by applicant]
US 20160086175A1 · Finlow-Bates et al. · 2016 [cited by applicant]
US 20160098723A1 · Feeney · 2016 [cited by applicant]
US 20160134431A1 · Ebrom et al. · 2016 [cited by applicant]
US 20160217436A1 · Brama · 2016 [cited by applicant]
US 20160269182A1 · Sriram et al. · 2016 [cited by applicant]
US 20160292672A1 · Fay et al. · 2016 [cited by applicant]
US 20160330031A1 · Drego et al. · 2016 [cited by applicant]
US 20160358267A1 · Arjomand · 2016 [cited by applicant]
US 20170034197A1 · Daniel et al. · 2017 [cited by applicant]
US 20170091750A1 · Maim · 2017 [cited by applicant]
US 20170109748A1 · Kote · 2017 [cited by applicant]
US 20170140408A1 · Wuehler · 2017 [cited by applicant]
US 20170154193A1 · Leiserson et al. · 2017 [cited by applicant]
US 20170178417A1 · Bekas et al. · 2017 [cited by applicant]
US 20170212781A1 · Dillenberger et al. · 2017 [cited by applicant]
US 20170220815A1 · Ansari et al. · 2017 [cited by applicant]
US 20170220998A1 · Horn et al. · 2017 [cited by applicant]
US 20170243193A1 · Manian et al. · 2017 [cited by applicant]
US 20170243212A1 · Castinado et al. · 2017 [cited by applicant]
US 20170244707A1 · Johnsrud et al. · 2017 [cited by applicant]
US 20170270527A1 · Rampton · 2017 [cited by applicant]
US 20170279774A1 · Booz et al. · 2017 [cited by applicant]
US 20170287068A1 · Nugent · 2017 [cited by applicant]
US 20170287090A1 · Hunn et al. · 2017 [cited by applicant]
US 20180167217A1 · Brady et al. · 2018 [cited by applicant]
US 20180253702A1 · Dowding · 2018 [cited by applicant]
US 20190179801A1 · Jang et al. · 2019 [cited by applicant]
US 20200358812A1 · Xiao · 2020 [cited by examiner]
EP 3125489A1 · 2017 [cited by applicant]
FR 3018379A1 · 2015 [cited by applicant]
GB 201413284 · 2014 [cited by applicant]
GB 201416822 · 2014 [cited by applicant]
GB 2514716A · 2014 [cited by applicant]
GB 201605154 · 2016 [cited by applicant]
GB 2540975A · 2017 [cited by applicant]
WO 2015144971A1 · 2015 [cited by applicant]
Herbert, “novel method for decentralised peer-to-peer software license validation using cryptocurrency blockchain technology”, 2015 (Year: 2015). [cited by examiner]
Antonopolous, “masteering bitcoin”, 2014 (Year: 2014). [cited by examiner]
Tom Harding, “How do bitcoin miners check for double-spend or over-spend?” May 25, 2015. (Year: 2015). [cited by examiner]
Nakamoto, “Bitcoin: A Peer-to-Peer Electronic Cash System,” Bitcoin, Oct. 31, 2008, https://bitcoin.org/bitcoin. pdf, 9 pages. [cited by applicant]
Ibáñez et al., “Attaching Semantic Metadata to Cryptocurrency Transactions,” University of Southampton, Jul. 28, 2017, 16 pages. [cited by applicant]
Alam et al., “Bitcoin for smart trading in smart grid,” The 21st IEEE International Workshop on Local and Metropolitan Area Networks, Apr. 22, 2015, 2 pages. [cited by applicant]
Allison, “Ethereum-based Slock.it reveals first ever lock opened with money,” International Business Times, Dec. 17, 2015 [retrieved Jul. 20, 2020], https://www.ibtimes.co.uk/ethereum-based-slock-reveals-first-ever-lock… [cited by applicant]
Andrychowicz et al., “Secure Multiparty Computations on Bitcoin,” IEEE Symposium on Security and Privacy, May 1, 2014, 18 pages. [cited by applicant]
Anonymous, “Distributed Hash Tables and Consistent Hashing,” CloudFundoo, https://cloudfundoo.wordpress.com/2012/05/28/distributed-hash-tables-and-consistent-hashing, May 28, 2012, 7 pages. [cited by applicant]
Anonymous, “Universal Blockchained Health Record,” The IP.com Journal, Apr. 13, 2016, 3 pages. [cited by applicant]
Anonymous, “What is Ethereum?,” EtherScripter, https://web.archive.org/web/20160329151319/http://etherscripter.com/what_is_ethereum.html, archived Mar. 29, 2016 [retrieved Feb. 21, 2019], 4 pages. [cited by applicant]
Bertani, “Fehu: E-commerce and security, on the same page,” Fehu Labs, Apr. 19, 2016, 22 pages. [cited by applicant]
Bertani, “Oraclize: App Beta; Use case-driven approach; Overview,” Oraclize, http://docs.oraclize.it, http://app.praclize.it/contracts/create, and https://blog.oraclize.it/use-case-driven-approach-a54b1fcbd2d2#jxot32mxq… [cited by applicant]
Bitcoinwiki, “Script,” Creative Commons Attribution 3.0, Jul. 28, 2012. [cited by applicant]
Bluematt et al., “Chat Logs Sep. 28, 2014,” Bitcoin Wizards IRC Channel, https://download.wpsoftware.net/bitcoin/wizards/2014-09-28.html, Sep. 28, 2014, 4 pages. [cited by applicant]
Buterin, “Ethereum and Oracles,” Ethereum Blog, Jul. 22, 2014 [retrieved Feb. 5, 2018], https://blog.ethereum.org/2014/07/22/ethereum-and-oracles/, 16 pages. [cited by applicant]
Buterin, “Privacy on the Blockchain,” Ethereum Blog, Jan. 15, 2016 (retreived Jul. 20, 2020), https://blog.ethereum.org/2016/01/15/privacy-on-the-blockchain/, 14 pages. [cited by applicant]
Capodieci et al., “I need some phasing aka smart contract material,” Nxt Forum, Apr. 27, 2015 [retrieved Apr. 4, 2017], https://nxtforum.org/general-discussion/i-need-some-phasing-aka-smart-contract-material, 9 pages. [cited by applicant]
Cassano, “What are Smart Contracts? Cryptocurrency's Killer App,” Fast Company, https://www.fastcompany.com/3035723/smart-contracts-could-be-cryptocurrencys-killer-app, Sep. 17, 2014 [retrieved Feb. 27, 2019], 7 pages. [cited by applicant]
Counterparty, “Documentation,” Counterparty, https://counterparty.io/docs/, copyright 2014 [retrieved Sep. 20, 2016], 2 pages. [cited by applicant]
EITC Holdings Limited, “Universal tokenisation system for blockchain based cryptocurrencies,” United Kingdom Patent Application No. 1603125.4, Feb. 23, 2016, 1 page. [cited by applicant]
Garzik et al., “Tweet May 30, 2014,” Twitter, https://twitter.com/jgarzik/status/472574342514368512, May 30, 2014 [retrieved Mar. 14, 2019], 1 page. [cited by applicant]
Garzik, “‘Master key multi-sig’ protocol, where the N of M threshold idea is used but a specific ‘master’ key must be present. ‘T+M of N’ So you can give others multi-sig keys but they can't collude behind your back,” R… [cited by applicant]
Garzik, “[Bitcoin-development] Pay to MultiScript hash:,” Linux Foundation, https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2014-July/006276.html, Jul. 17, 2014, 1 page. [cited by applicant]
Garzik, “[Bitcoin-development] Presenting a BIP for Shamir's Secret Sharing of Bitcoin private keys,” Linux Foundation, https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2014-March/004908.html, Mar. 29, 2014, 1 pa… [cited by applicant]
Geremia et al., “Multisignature,” Bitcoin Wiki, Jan. 5, 2016 revision (first disclosed Mar. 8, 2015) [retrieved Jul. 20, 2020], https://en.bitcoin.it/w/index.php?title=Multisignature&oldid=59815, 3 pages. [cited by applicant]
Godislove et al., “Thoughts on M of N systems (competing and heirarchically nested),” Bitcoin Forum, Jun. 20, 2014 [retrieved Apr. 4, 2017], https://bitcointalk.org/index.php?topic=659131.msg7433669#msg7433669, 8 pages. [cited by applicant]
Greenspan, “Beware the impossible smart contract,” Linkedin, https://www.linkedin.com/pulse/beware-impossible-smart-contract-gideon-greenspan, Apr. 12, 2016 [retrieved Feb. 27, 2019], 8 pages. [cited by applicant]
Hearn, “Distributed markets,” Bitcoin Wiki, https://en.bitcoin.it/wiki/Distributed_markets, Jul. 11, 2015 [retrieved Sep. 20, 2016], 5 pages. [cited by applicant]
International Search Report and Written Opinion mailed Jul. 14, 2017, Patent Application No. PCT/IB2017/052466, 11 pages. [cited by applicant]
International Search Report and Written Opinion mailed Jul. 14, 2017, Patent Application No. PCT/IB2017/052467, 11 pages. [cited by applicant]
International Search Report and Written Opinion mailed Jul. 18, 2017, Patent Application No. PCT/IB2017/052464, 10 pages. [cited by applicant]
International Search Report and Written Opinion mailed Jul. 7, 2017, Patent Application No. PCT/IB2017/052463, 11 pages. [cited by applicant]
Justanotheruser et al., “Chat Log Jan. 9-10, 2014,” Bitcoin Wizards IRC Channel, https://download.wpsoftware.net/bitcoin/wizards/2014/01/14-01-09.log, Jan. 9, 2014, 11 pages. [cited by applicant]
Kiviat, “Beyond Bitcoin: Issues in Regulating Blockchain Transactions,” Duke Law Journal 65(3):569-608, Dec. 2015. [cited by applicant]
Liang et al., “White Paper,” GitHub, https://github.com/ethereum/wiki/wiki/white-paper/5f59d858bf36d6f2f6650f1f30f0b8b015741d73, Apr. 13, 2016 [retrieved Feb. 27, 2019], 37 pages. [cited by applicant]
Markjoingwar et al., “So can you make a complex script and put it into a P2SH address, and it doesn't have to be one of the standard transaction types right? Doesn't this mean Bitcoin can be Turing complete in some case… [cited by applicant]
Mike et al., “Contract,” Bitcoin Wiki, https://en.bitcoin.it/wiki/Contract, Aug. 10, 2017 [retrieved Feb. 5, 2018], 13 pages. [cited by applicant]
Mike et al., “Contract,” Bitcoin Wiki, Oct. 22, 2015 version (first disclosed May 22, 2011) [retrieved May 12, 2020], https://en.bitcoin.it/w/index.php?title=Contract&oldid=59172, 11 pages. [cited by applicant]
Morrison, “Blockchain and smart contract automation: How smart contracts automate digital business,” PwC Technology Forecast, copyright 2016, https://www.pwc.com/us/en/technology-forecast/2016/blockchain/pwc-smart-contr… [cited by applicant]
Netizen_Cookie et al., “I recently told my boyfriend that I want to marry him without involving the state. He said yes and suggested we “put it on the blockchain” (which is, of course, how I know I picked the right one)… [cited by applicant]
Newman et al., “Contracts and Transactions,” Github, Aug. 24, 2015 [retrieved Apr. 4, 2017], https://github.com/ethereum/go-ethereum/wiki/Contracts-and-Transactions, 12 pages. [cited by applicant]
Ngo, “Counterparty Announces Ethereum Virtual Machine for Smart Contracts Creation on the Bitcoin Blockchain,” Coin Journal, http://coinjournal.net/counterparty-ethereum-virtual-machine-smart-contracts-bitcoinblockchain… [cited by applicant]
Omohundro, “Cryptocurrencies, Smart Contracts, and Artificial Intelligence,” Oct. 22, 2014 (retrieved Jul. 20, 2020), https://steveomohundro.com/2014/10/, 7 pages. [cited by applicant]
Omunhundro, “Smart Contracts,” Possibility Research, Oct. 26, 2014 (retrieved Jul. 20, 2020), 33 pages. [cited by applicant]
Piasecki et al., “Talk:Script,” Bitcoin Wiki, https://en.bitcoin.it/wiki/Talk:Script, Dec. 20, 2011 (most recent edit Nov. 15, 2015) [retrieved Feb. 27, 2019], 2 pages. [cited by applicant]
Pyongyangpothead, “Multi-Blockchain uses?,” Reddit r/ethdev, https://www.reddit.com/r/ethdev/comments/4c6xd4/multiblockchain_uses/, Mar. 27, 2016 [retrieved Feb. 27, 2019], 2 pages. [cited by applicant]
Rampton, “Detailed look at Ethereum Applications,” Due, Apr. 1, 2016 [retrieved Apr. 4, 2017], https://due.com/blog/detailed-look-at-ethereum-applications/, 9 pages. [cited by applicant]
Schwartz et al., “Smart Oracles: A Simple, Powerful Approach to Smart Contracts,” Codius, Jul. 17, 2014 [retrieved Feb. 5, 2018], https://github.com/codius/codius/wiki/Smart-Oracles:-A-Simple,-Powerful-Approach-to-Smart… [cited by applicant]
Swanson, “Tradle,” Github, https://github.com/tradle/about/wiki, Aug. 3, 2015 [retrieved Sep. 20, 2016], 4 pages. [cited by applicant]
Theymos et al., “Script,” Bitcoin Wiki, http:/web.archive.org/web/20160714165653/https://en.bitcoin.it/wiki/Script, Dec. 19, 2010 (archived version Jul. 14, 2016) [retrieved Mar. 14, 2019], 8 pages. [cited by applicant]
Third-Party Submission Under 37 CFR 1.290 filed Jun. 7, 2019, U.S. Appl. No. 16/097,218, filed Oct. 26, 2018, 17 pages. [cited by applicant]
Towns, “[bitcoin-dev] Let's deploy BIP65 Checklocktimeverify!,” Linux Foundation, https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2015-October/011473.html, Oct. 7, 2016 [retrieved Nov. 2, 2016], 1 page. [cited by applicant]
Tual et al., “IoT Interview Series: Decentralized Smart Devices with Stephan Tual from Slock.it,” Postscapes, https://www.postscapes.com/iot-voices/interviews/smart-devices-ethereum-stephan-tual/, [retrieved Feb. 27, 20… [cited by applicant]
UK Commercial Search Report mailed Jun. 13, 2016, Patent Application No. 1607472.6, filed Apr. 29, 2016, 5 pages. [cited by applicant]
UK Commercial Search Report mailed Oct. 19, 2016, Patent Application No. 1607569.9, 10 pages. [cited by applicant]
UK Commercial Search Report mailed Sep. 2, 2016, Patent Application No. 1607477.5, 7 pages. [cited by applicant]
UK Commercial Search Report mailed Sep. 26, 2016, Patent Application No. 1607538.4, 7 pages. [cited by applicant]
UK IPO Search Report mailed Dec. 22, 2016, Patent Application No. GB1607472.6, 6 pages. [cited by applicant]
UK IPO Search Report mailed Dec. 22, 2016, Patent Application No. GB1607538.4, 5 pages. [cited by applicant]
UK IPO Search Report mailed Dec. 22, 2016, Patent Application No. GB1607569.9, 6 pages. [cited by applicant]
UK IPO Search Report mailed Dec. 9, 2016, Patent Application No. GB1607477.5, 5 pages. [cited by applicant]
Watanabe et al., “Blockchain contract: A complete consensus using blockchain,” IEEE 4th Global Conference on Consumer Electronics, Oct. 27, 2015, 3 pages. [cited by applicant]
Wattenhofer, “The Science of Blockchain,” CreateSpace Independent Publishing Platform, https://www.yumpu.com/en/document/view/55701791/the-science-of-the-blockchain/95, Jan. 27, 2016 [retrieved Sep. 20, 2016], 8 pages. [cited by applicant]
Wikipedia, “Fredkin gate,” Wikipedia the Free Encyclopedia, Nov. 26, 2018 [retrieved Feb. 27, 2019], https://en.wikipedia.org/wiki/Fredkin_gate, 3 pages. [cited by applicant]
Wikipedia, “Smart Contracts,” Wikipedia the Free Encyclopedia, Jul. 24, 2015 [retrieved Jul. 20, 2020], https://en.wikipedia.org/w/index.php?title=Smartt_contract&oldid=672866135, 4 pages. [cited by applicant]
Wildling et al., “What OPCODES are available for the Ethereum EVM?,” Ethereum Stack Exchange, Jan. 20, 2016 (retrieved Jul. 20, 2020), https://ethereum.stackexchange.com/questions/119/what-opcodes-are-available-for-the-… [cited by applicant]
Xu et al., “The Blockchain as a Software Connector,” 2016 13th Working IEEE/IFIP Conference on Software Architecture (WICSA), Apr. 5, 2016, 10 pages. [cited by applicant]
Zyskind et al., “Enigma: Decentralized Computation Platform with Guaranteed Privacy,” arXiv preprint arXiv:1506, Jun. 10, 2015, 14 pages. [cited by applicant]
Harding, “How do Bitcoin Miners Check for Double-Spend or Over-Spend?” https://stackoverflow.com/questions/30425272/how-do-bitcoin-miners-check-for-double-spend-or-over-spend, May 25, 2015, 2 pages. [cited by applicant]
Wang et al., “IC Card-based Bitcoin Payment Design and Implement” International Conference on Intelligent Systems Research and Mechatronics Engineering (ISRME 2015), Atlantis Press, 2015, 4 pages. [cited by applicant]
Giechaskiel, Ilias, “An Evaluation of the Effects of Broken Cryptographic Primitives on Bitcoin”, University of Oxford, 2015, 20 pages. [cited by applicant]
Bitcoin, “What is Bitcoin Locking and Unlocking Script?”, May 15, 2018, 4 pages. [cited by applicant]
Raj, Koshik, “Locking and Unlocking Scripts”, 2023, 7 pages. [cited by applicant]
Nisan, “Boolean Logic”, Jan. 1, 2008, Part of: The Elements of Computing Systems: Building a Modern Computer from First Principles, 22 pages. [cited by applicant]
Barber et al., “Bitter to Better—How to Make Bitcoin a Better Currency,” International Conference on Financial Cryptography and Data Security, Feb. 27, 2012, http://elaineshi.com/docs/bitcoin.pdf, 15 pages. [cited by applicant]
Satoshi et al., “Connection Limits,” Bitcoin Forum, Aug. 9, 2010, https://bitcointalk.org/index.php?topic=741.0;prev_next=prev, 2 pages. [cited by applicant]