IP Library Granted Patent US 12,278,898
Granted Patent B2
US 12,278,898 · App. 18/099,145 · Granted Apr 15, 2025

Blockchain-implemented control method and system

Inventor: Gavin Allen (London, GB)
Assignee: NCHAIN LICENSING AG
H04L9/14G06F21/305G06F21/645G06Q20/065G06Q20/0658G06Q20/36G06Q20/3829G06Q20/389H04L9/0637H04L9/0643H04L9/0861H04L9/3247H04L9/3263H04W4/70H04L9/50H04L2209/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,278,898
App. No.
18/099,145
Granted
Apr 15, 2025
Kind
B2
Abstract

This invention relates generally to distributed ledger technology (including blockchain related technologies), particularly a method and corresponding system for providing a blockchain transaction comprising a redeem script for an output that comprises: i) a plurality of public keys, each associated with a corresponding private key, wherein each public key is uniquely associated with a potential state of at least one data source; and ii) logic arranged to provide a result based on: A) a determination of which of the plurality of associated private key(s) is/are used to sign the unlocking script, so as to provide an interim result: and B) a comparison of a parameter supplied via the unlocking script against the interim result, and further attempting to spend the transaction output more than once, each attempt supplying a different parameter.

Claims (39)

1. A computer-implemented control method comprising steps of:

providing a blockchain transaction for a blockchain network, the blockchain transaction comprising a redeem script for an output, wherein the redeem script comprises:

i) a plurality of public keys, each associated with a corresponding private key, wherein each public key is uniquely associated with a potential state of at least one data source, wherein the at least one data source comprises a sensor or a signal generation component associated with a respective computing agent of a plurality of computing agents directly controlled by a blockchain of the blockchain network, wherein the computing agents are each configured to:

monitor a separate potential state of the at least one data source via the sensor or signal generation component to provide an input indicating a state of the at least one data source; and

derive a separate private key for each possible state; and

wherein a minimum number of said private keys must be used to sign an unlocking script of a further blockchain transaction in order to spend the output; and

ii) logic arranged to provide a result based on:

a determination of which of the plurality of associated private keys is used to sign the unlocking script, so as to provide an interim result; and

a comparison of a parameter supplied via the unlocking script against the interim result; and

attempting to spend the output more than once, each attempt supplying a different parameter.

2. The method according to claim 1 , wherein the logic is arranged to implement functionality of a logic gate.

3. The method according to claim 2 , wherein the logic gate is a NOT, AND, OR, NOR, XOR, IMPLY, NAND, NONIMPLY or XNOR gate.

4. The method according to claim 1 , wherein the state of the at least one data source is determined by a computing agent.

5. The method according to claim 4 , wherein the computing agent is in communication with a control computing agent.

6. The method according to claim 1 , wherein the result is a Boolean result.

7. The method according to claim 1 , wherein there are at least two data sources.

8. The method according to claim 1 , wherein two potential states are associated with each data source, each potential state being further associated with, or represented by, a public key.

9. The method according to claim 1 , further comprising:

for each of the at least one data source:

associating a public key in the plurality with a potential state of the data source such that all possible states of the data source are represented by a respective public key.

10. The method according to claim 1 , wherein the at least one data source comprises a sensor or a signal generation component.

11. The method according to claim 1 , wherein each public key represents a Boolean value indicative of a potential state of the at least one data source.

12. The method according to claim 1 , wherein the parameter is a value, or a puzzle, or a value embedded in a key.

13. The method according to claim 1 , wherein the logic is arranged to perform an equality check to compare an intermediate result with the parameter.

14. The method according to claim 1 , wherein the interim result is derived from the logic provided within the redeem script, and/or is a Boolean value which is calculated by determining which of the associated private keys were used to sign the unlocking script.

15. The method according to claim 1 , and further comprising the step of:

generating or deriving one or more cryptographic keys from a base or master key.

16. The method according to claim 15 , wherein:

a key generation or derivation step is performed using a deterministic key generation technique.

17. A computer-implemented system comprising:

at least one computer-based hardware resource arranged to perform step(s) of claim 1 ; and

a blockchain.

18. The computer-implemented system according to claim 17 , wherein the at least one computer-based hardware resource is arranged to:

submit a transaction to a blockchain network;

generate a transaction;

digitally sign a locking script; and/or

generate a public/private cryptographic key.

19. The computer-implemented system according to claim 17 , wherein the result is used to control or influence an execution or operation of a process or apparatus.

20. The computer-implemented system according to claim 17 , further comprising at least one sensor or signal generation component arranged and configured to provide an input to the at least one computer-based hardware resource.

Assignments (4)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 19, 2023
From: ALLEN, GAVIN
To: NCHAIN HOLDINGS LTD
Reel/Frame 062428/0257 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 19, 2023
From: ALLEN, GAVIN
To: NCHAIN HOLDINGS LTD
Reel/Frame 062428/0320 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 19, 2023
From: ALLEN, GAVIN
To: NCHAIN HOLDINGS LTD
Reel/Frame 062428/0385 →
CHANGE OF NAME Recorded Jan 19, 2023
From: NCHAIN HOLDINGS LTD
To: NCHAIN LICENSING AG
Reel/Frame 062439/0015 →
Priority Claims (3)
GB 1613148 · Jul 29, 2016 · national
GB 1613177 · Jul 29, 2016 · national
GB 1613188 · Jul 29, 2016 · national
Continuity (2)
Continuation 16320083
Related Publication 20230231711A1 · Jul 20, 2023
References Cited (130)
US 7668773B1 · Pruitt · 2010 [cited by applicant]
US 10454677B1 · Nagelberg et al. · 2019 [cited by applicant]
US 10504179B1 · McGuire et al. · 2019 [cited by applicant]
US 10803537B2 · Brown · 2020 [cited by examiner]
US 11210647B2 · Maim · 2021 [cited by applicant]
US 11271736B2 · Allen · 2022 [cited by applicant]
US 11838415B2 · Allen · 2023 [cited by applicant]
US 11972422B2 · Wright et al. · 2024 [cited by applicant]
US 20040181672A1 · Ferri et al. · 2004 [cited by applicant]
US 20120278612A1 · Ferri et al. · 2012 [cited by applicant]
US 20130246261A1 · Purves et al. · 2013 [cited by applicant]
US 20140047235A1 · Lessiak et al. · 2014 [cited by applicant]
US 20140195818A1 · Neumann et al. · 2014 [cited by applicant]
US 20150026049A1 · Theurer et al. · 2015 [cited by applicant]
US 20150120569A1 · Belshe et al. · 2015 [cited by applicant]
US 20150220914A1 · Purves et al. · 2015 [cited by applicant]
US 20150244690A1 · Mossbarger · 2015 [cited by applicant]
US 20150287026A1 · Yang et al. · 2015 [cited by applicant]
US 20150379510A1 · Smith · 2015 [cited by applicant]
US 20160085955A1 · Lerner · 2016 [cited by applicant]
US 20160140653A1 · McKenzie · 2016 [cited by applicant]
US 20160275461A1 · Sprague et al. · 2016 [cited by applicant]
US 20160283941A1 · Andrade · 2016 [cited by applicant]
US 20160292680A1 · Wilson, Jr. et al. · 2016 [cited by applicant]
US 20160364787A1 · Walker et al. · 2016 [cited by applicant]
US 20170005804A1 · Zinder · 2017 [cited by applicant]
US 20170017936A1 · Bisikalo et al. · 2017 [cited by applicant]
US 20170017954A1 · McDonough et al. · 2017 [cited by applicant]
US 20170017955A1 · Stern et al. · 2017 [cited by applicant]
US 20170046689A1 · Lohe et al. · 2017 [cited by applicant]
US 20170048209A1 · Lohe et al. · 2017 [cited by applicant]
US 20170048234A1 · Lohe et al. · 2017 [cited by applicant]
US 20170048235A1 · Lohe et al. · 2017 [cited by applicant]
US 20170083907A1 · McDonough et al. · 2017 [cited by applicant]
US 20170085555A1 · Bisikalo et al. · 2017 [cited by applicant]
US 20170091756A1 · Stern et al. · 2017 [cited by applicant]
US 20170109735A1 · Sheng et al. · 2017 [cited by applicant]
US 20170116693A1 · Rae et al. · 2017 [cited by applicant]
US 20170187535A1 · Middleton et al. · 2017 [cited by applicant]
US 20170221052A1 · Sheng et al. · 2017 [cited by applicant]
US 20170228731A1 · Sheng et al. · 2017 [cited by applicant]
US 20170230189A1 · Toll et al. · 2017 [cited by applicant]
US 20170232300A1 · Tran et al. · 2017 [cited by applicant]
US 20170236121A1 · Lyons et al. · 2017 [cited by applicant]
US 20170249477A1 · Necas et al. · 2017 [cited by applicant]
US 20170293747A1 · Naqvi · 2017 [cited by applicant]
US 20170302663A1 · Nainar et al. · 2017 [cited by applicant]
US 20170316390A1 · Smith et al. · 2017 [cited by applicant]
US 20170330174A1 · Demarinis et al. · 2017 [cited by applicant]
US 20180000367A1 · Longinotti-Buitoni · 2018 [cited by applicant]
US 20180078843A1 · Tran et al. · 2018 [cited by applicant]
US 20180117446A1 · Tran et al. · 2018 [cited by applicant]
US 20180139057A1 · Truu et al. · 2018 [cited by applicant]
US 20180144114A1 · Fiske · 2018 [cited by applicant]
US 20180191503A1 · Alwar et al. · 2018 [cited by applicant]
US 20180227293A1 · Uhr et al. · 2018 [cited by applicant]
US 20180264347A1 · Tran et al. · 2018 [cited by applicant]
US 20190019183A1 · Karame et al. · 2019 [cited by applicant]
US 20190028276A1 · Pierce · 2019 [cited by examiner]
US 20190057362A1 · Wright et al. · 2019 [cited by applicant]
US 20190057382A1 · Wright et al. · 2019 [cited by applicant]
US 20190114706A1 · Bell et al. · 2019 [cited by applicant]
US 20190149337A1 · Savanah et al. · 2019 [cited by applicant]
US 20190188701A1 · Parsons et al. · 2019 [cited by applicant]
US 20190295054A1 · Purves et al. · 2019 [cited by applicant]
US 20190303887A1 · Wright et al. · 2019 [cited by applicant]
US 20200028691A1 · Rao et al. · 2020 [cited by applicant]
US 20200044831A1 · Soundararajan et al. · 2020 [cited by applicant]
US 20200202344A1 · Bougalis · 2020 [cited by applicant]
US 20200204338A1 · Bougalis · 2020 [cited by applicant]
US 20200302409A1 · Hearn et al. · 2020 [cited by applicant]
US 20220005029A1 · Wei et al. · 2022 [cited by applicant]
US 20230298001A1 · Jethmalani et al. · 2023 [cited by applicant]
GB 201413284 · 2014 [cited by applicant]
GB 201611698 · 2016 [cited by applicant]
WO 2015144971A1 · 2015 [cited by applicant]
WO 2016154001A1 · 2016 [cited by applicant]
WO 2020263441A1 · 2020 [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]
Giechaskiel et al., “On Bitcoin Security in the Presence of Broken Crypto Primitives”, Feb. 19, 2016, 17 pages. [cited by applicant]
Anonymous, “Background Page,” Oraclize, Oct. 2017 [retrieved May 2, 2018], https://web.archive.org/web/20171017121053/http://docs.oraclize.it/, 18 pages. [cited by applicant]
Anonymous, “Bitcoin Developer Guide,” Bitcoin Project, https://web.archive.org/web/20160515171209/https://bitcoin.org/en/developer-guide, May 15, 2016 [retrieved Mar. 13, 2019], 55 pages. [cited by applicant]
Anonymous, “Reality Keys JSON Response,” Realitykeys.com, Jan. 10, 2014 [accessed Apr. 19, 2017], https://www.realitykeys.com/api/v1/exchange/1?accept_terms_of_serv, 1 page. [cited by applicant]
Antonopoulos, “Mastering Bitcoin—Unlocking Digital Cryptocurrencies,” O'Reilly Media, Inc., Dec. 20, 2014, 282 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.oraclize.it/contracts/create, and https://blog.oraclize.it/use-case-driven-approach-a54b1fcbd2d2#.jxot32mx… [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]
Durback, “Standard BIP Draft: Turing Pseudo-Completeness,” Bitcoin-Dev, Dec. 10, 2015, https://bitcoin-development.narkive.com/uRciVtAQ/standard-bip-draft-turing-pseudo-completeness, 11 pages. [cited by applicant]
Edgar, “About Reality Keys,” Reality Keys, copyright 2013-2016, https://www.realitykeys.com/about, 1 page. [cited by applicant]
Edgar, “Developer Resources and Examples,” Reality Keys, copyright 2013-2016, https://www.realitykeys.com/developers/resources, 4 pages. [cited by applicant]
Edgar, “Reality Keys Demo,” Github, https://raw.githubusercontent.com/edmundedgar/realitykeys-examples/master/realitykeysdemo.py, published prior to Nov. 2016, 13 pages. [cited by applicant]
Edgar, “reality.eth,” first disclosed prior to Mar. 2018, https://www.realitykeys.com/api/v1/exchange/1?accept_terms_of_service=current, 6 pages. [cited by applicant]
Edgar, “The Reality Keys API,” copyright 2013-2016, https://www.realitykeys.com/developers, 8 pages. [cited by applicant]
Edmunedgar, “[ANN] Reality Keys: An oracle letting you use external state in transactions,” Bitcoin Forum, Jan. 20, 2014 [retrieved Feb. 5, 2018], https://bitcointalk.org/index.php?topic=423638.0, 12 pages. [cited by applicant]
Filament, “Foundations for the Next Economic Revolution: Distributed Exchange and the Internet of Things,” Filament.com, http://web.archive.org/web/20160417161328/http://filament.com/assets/downloads/Filament%20Foundati… [cited by applicant]
Franco, “Understanding Bitcoin: Cryptography, Engineering and Economics,” Wiley, ISBN: 978-1-119-01916-9, Oct. 2014, 144 pages. [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,”… [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]
Idelberger et al., “Evaluation of Logic-Based Smart Contracts for Blockchain Systems,” 10th International Symposium on Rules and Rule Markup Languages for the Semantic Web, Jul. 6, 2016, 17 pages. [cited by applicant]
International Search Report and Written Opinion mailed Sep. 21, 2017, Patent Application No. PCT/IB2017/054422, 24 pages. [cited by applicant]
International Search Report and Written Opinion mailed Sep. 21, 2017, Patent Application No. PCT/IB2017/054423, 13 pages. [cited by applicant]
International Search Report and Written Opinion mailed Sep. 21, 2017, Patent Application No. PCT/IB2017/054424, 12 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, 40 pages. [cited by applicant]
Kolinko et al., “Orisi White Paper,” Github, published Jun. 9, 2014, last edited Nov. 28, 2014 [retrieved Feb. 5, 2018], https://github.com/orisi/wiki/wiki/Orisi-White-Paper, five pages. [cited by applicant]
Lazarovich et al., “Invisible Ink: Blockchain for Data Privacy,” Massachusetts Institute of Technology, Master of Science in Media Arts and Sciences Thesis, Jun. 2015, 85 pages. [cited by applicant]
Lull3rskat3r et al., “Script To Limit Transactions To Specific Wallets,” Bitcoin Stack Exchange, https://bitcoin.stackexchange.com/questions/20526/script-to-limit-transactions-to-specific-wallets, Jan. 14, 2014 [retriev… [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]
MULTISIG_Verify_How et al., “Verifying whom signed a multisig transaction?,” Reddit, Aug. 12, 2015, https://www.reddit.com/r/Bitcoin/comments/3grveg/verifying_whom_signed_a_multisig_transaction/, 2 pages. [cited by applicant]
Nakamoto, “Bitcoin: A Peer-to-Peer Electronic Cash System,” Bitcoin, Oct. 31, 2008, https://bitcoin.org/bitcoin.pdf, 9 pages. [cited by applicant]
Panikkar et al., “ADEPT: An IoT Practitioner Perspective,” IBM, Jan. 2015, 18 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]
Pureswaran, “Device democracy” IBM Institute for Business Value, http://www-935.ibm.com/services/us/gbs/thoughtleadership/intemetofthings/, Jul. 2015, 3 pages. [cited by applicant]
Pureswaran, “Device democracy: Saving the future of the Internet of Things—Executive Report,” IBM Institute for Business Value, http://www-935.ibm.corn/services/us/gbs/thoughtleadership/intemetofthings/, Jul. 2015, 28 p… [cited by applicant]
Pureswaran, “Empowering the edge: Practical insights on a decentralized Internet of Things,” IBM Institute for Business Value, 2015, 24 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]
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]
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]
UK Commercial Search Report mailed Apr. 24, 2017, Patent Application No. GB1613188.0, 12 pages. [cited by applicant]
UK Commercial Search Report mailed Nov. 1, 2016, Patent Application No. GB1613177.3, 10 pages. [cited by applicant]
UK Commercial Search Report mailed Oct. 26, 2016, Patent Application No. GB1613148.4, 8 pages. [cited by applicant]
UK IPO Search Report mailed Jan. 26, 2017, Patent Application No. GB1613148.4, 6 pages. [cited by applicant]
UK IPO Search Report mailed Jan. 26, 2017, Patent Application No. GB1613177.3, 6 pages. [cited by applicant]
UK IPO Search Report mailed Jan. 26, 2017, Patent Application No. GB1613188.0, 6 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]
Wood et al., “Solidity Tutorial,” GitHub, http://web.archive.org/web/20150812040606/https://github.com/ethereum/wiki/wiki/Solidity-Tutorial#/control-structures, Jan. 13, 2015 (archived version Aug. 12, 2015) [retrieved … [cited by applicant]
Wörner et al., “When Your Sensor Earns Money: Exchanging Data for Cash with Bitcoin,” UbiComp '14 Adjunct: Proceedings of the 2014 ACM International Joint Conference on Pervasive and Ubiquitous Computing: Adjunct Public… [cited by applicant]
Xu et al., “Master Key Multi-sig Protocol, Where the N of M Threshold Idea is Used by 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,”… [cited by applicant]