# US 2020/0266985 A1 · System for securing verification key from alteration and verifying validity of a proof of correctness

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2020/0266985 A1
- Document ID: US20200266985A1
- Status: Published application
- Kind: A1
- Application number: 16/762,471
- Filed: 2018-10-29
- Published: 2020-08-20
- Earliest claimed: 2017-11-09
- Assignees: nChain Holdings Limited
- Applicants: nChain Holdings Limited
- Inventors: Alexandra COVACI; Simone MADEO; Patrick MOTYLINSKI; Stephane VINCENT
- Web page: https://patentgrep.com/patent/US20200266985A1

## CPC

- H04L 63/12: {Applying verification of the received information (cryptographic mechanisms or cryptographic arrangements for data integrity or data verification H04L9/32)}
- G06F 8/44: {Encoding}
- G06F 8/447: {Target code generation}
- G06F 8/451: {Code distribution (considering CPU load at run-time G06F9/505; load rebalancing G06F9/5083)}
- G06F 9/44521: {Dynamic linking or loading; Link editing at or after load time, e.g. Java class loading}
- G06F 16/27: Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
- G06Q 20/065: {using e-cash}
- G06Q 20/401: {Transaction verification}
- G06Q 20/405: {Establishing or using transaction specific rules}
- H04L 9/0637: {Modes of operation, e.g. cipher block chaining [CBC], electronic codebook [ECB] or Galois/counter mode [GCM]}
- H04L 9/0643: {Hash functions, e.g. MD5, SHA, HMAC or f9 MAC}
- H04L 9/085: {Secret sharing or secret splitting, e.g. threshold schemes}
- H04L 9/30: Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
- H04L 9/3218: {using proof of knowledge, e.g. Fiat-Shamir, GQ, Schnorr, ornon-interactive zero-knowledge proofs}
- H04L 9/3236: {using cryptographic hash functions}
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- H04L 9/3247: {involving digital signatures}
- H04L 9/3263: {involving certificates, e.g. public key certificate [PKC] or attribute certificate [AC]; Public key infrastructure [PKI] arrangements (network architectures or network communication protocols for supporting authentication of entities using certificates in a packet data network H04L63/0823)}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L 9/0618: {Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation}
- H04L 9/3066: {involving algebraic varieties, e.g. elliptic or hyper-elliptic curves}
- H04L 2209/127: Trusted platform modules [TPM]
- H04L 2209/34: Encoding or coding, e.g. Huffman coding or error correction
- H04L 2209/56: Financial cryptography, e.g. electronic payment or e-cash
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

The invention relates to distributed ledger technologies such as consensus-based blockchains. A blockchain transaction may include digital resources that are encumbered by a locking script that encodes a set of conditions that must be fulfilled before the encumbered resources may be used (e.g., transferring ownership/control of encumbered resources). A worker (e.g., a computer system) performs one or more computations to generate a proof, which is encoded as part of an unlocking script. A verification algorithm may utilize the proof, a verification key, and additional data such as a cryptographic material associated with the worker (e.g., a digital signature) to verify that digital assets of the transaction should be transferred. As a result of the validation of this transaction, any third party is able to check the contract was executed corrected rather than re-executing the contract, thus saving computational power.

## Claims

### Claim 1

A computer-implemented method comprising:
generating a transaction output of a transaction comprising an indication of a digital asset and a locking script that encodes a set of conditions for transferring control of the digital asset, satisfaction of the set of conditions to be determined based at least in part on a verification key and a proof;
generating a transaction input of the transaction, the transaction input comprising:
an identifier associated with the transaction output; and
an unlocking script comprising the proof; and
verifying the set of conditions are satisfied based at least in part on the locking script and the unlocking script; and
transferring control of the digital asset in response to verifying satisfaction of the set of conditions.

### Claim 2 (depends on 1)

The computer-implemented method according to claim 1, wherein the verification key comprises a first plurality of elements of a finite field and the proof comprises a second plurality of elements of the finite field.

### Claim 3 (depends on 2)

The computer-implemented method according to claim 2, wherein elements of the finite field are points on an elliptic curve.

### Claim 4 (depends on 2)

The computer-implemented method according to claim 2, wherein the elements of the finite field are encoded in a compressed format.

### Claim 5 (depends on 1)

The computer-implemented method according to claim 1, wherein a client encodes the transaction input with the verification key and a first digital certificate associated with the client and a worker encodes the transaction input with the proof and a second digital certificate associated with the worker.

### Claim 6 (depends on 1)

The computer-implemented method according to claim 1, wherein the locking script comprises instructions that, contingent upon a condition of the set of conditions being unsatisfied by the unlocking script, reclaim the digital asset for a provider of the digital asset.

### Claim 7 (depends on 1)

The computer-implemented method according to claim 1, wherein:
the unlocking script further comprises a redeem script, wherein the verification key and the redeem script are to satisfy the set of conditions; and
the locking script encodes a condition of the set of conditions that a hash of the redeem script matches a predetermined value.

### Claim 8 (depends on 7)

The computer-implemented method according to claim 7, wherein the redeem script is less than or equal to 520 bytes in size.

### Claim 9 (depends on 7)

The computer-implemented method according to claim 7, wherein the unlocking script comprises one or more elements of the verification key.

### Claim 10 (depends on 7)

The computer-implemented method according to claim 7, wherein the transaction is a P2SH transaction in accordance with a Bitcoin-based protocol.

### Claim 11 (depends on 1)

The computer-implemented method according to claim 1, wherein the transaction is a standard transaction in accordance with a blockchain-based protocol.

### Claim 12 (depends on 1)

The computer-implemented method according to claim 1, wherein the locking script and unlocking script are encoded in a stack-based scripting language.

### Claim 13 (depends on 1)

The computer-implemented method according to claim 1, wherein the set of conditions comprise a bilinear constraint.

### Claim 14 (depends on 1)

A system, comprising:
a processor; and
memory including executable instructions that, as a result of being executed by the processor, causes the system to perform the computer-implemented method according to claim 1.

### Claim 15 (depends on 1)

A non-transitory computer-readable storage medium having stored thereon executable instructions that, as a result of being executed by a processor of a computer system, cause the computer system to at least perform the computer-implemented method according to claim 1.

### Claim 16 (depends on 2)

A system, comprising:
a processor; and
memory including executable instructions that, as a result of being executed by the processor, causes the system to perform the computer-implemented method according to claim 2.

### Claim 17 (depends on 3)

A system, comprising:
a processor; and
memory including executable instructions that, as a result of being executed by the processor, causes the system to perform the computer-implemented method according to claim 3.

### Claim 18 (depends on 4)

A system, comprising:
a processor; and
memory including executable instructions that, as a result of being executed by the processor, causes the system to perform the computer-implemented method according to claim 4.

### Claim 19 (depends on 2)

A non-transitory computer-readable storage medium having stored thereon executable instructions that, as a result of being executed by a processor of a computer system, cause the computer system to at least perform the computer-implemented method according to claim 2.

### Claim 20 (depends on 3)

A non-transitory computer-readable storage medium having stored thereon executable instructions that, as a result of being executed by a processor of a computer system, cause the computer system to at least perform the computer-implemented method according to claim 3.
