# US 2017/0255950 A1 · Systems and methods for providing block chain state proofs for prediction market resolution

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

- Number: US 2017/0255950 A1
- Document ID: US20170255950A1
- Status: Published application
- Kind: A1
- Application number: 15/061,907
- Filed: 2016-03-04
- Published: 2017-09-07
- Earliest claimed: 2016-03-04
- Assignees: Forecast Foundation Ou
- Applicants: Forecast Foundation Ou
- Inventors: Joseph Krug
- Web page: https://patentgrep.com/patent/US20170255950A1

## CPC

- G06Q 30/0202: Market predictions or forecasting for commercial activities
- G06N 7/01: Probabilistic graphical models, e.g. probabilistic networks
- G06Q 30/0185: {Product, service or business identity fraud}
- H04L 9/32: including means for verifying the identity or authority of a user of the system {or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials}
- 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
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

An outcome reported by a first prediction market may be determined. A state root hash from a given block in a block chain created during or after a resolution process of the first prediction market may be obtained. A proof that the value of an outcome obtained from the block chain is the same as reported by the first prediction market may be determined by: identifying a set of nodes within a cryptographic structure that forms a path from a top node to an outcome node containing a value of the outcome; and hashing the outcome node with any adjacent nodes and intervening nodes until a hash of the top node is obtained. Responsive to the hash of the top node matching the state root hash, the proof may be submitted to a second prediction market to resolve the second prediction market.

## Claims

### Claim 1

A system, comprising:
one or more hardware processors configured by machine-readable instructions to:
determine an outcome reported by a first prediction market, the outcome of the first prediction market being associated with a key and value, the key including an event identification of the first prediction market and the value conveying the outcome;
obtain a state root hash from a given block in a block chain created during or after a resolution process of the first prediction market, the given block including a header, the header including the state root hash, the state root hash being a value corresponding to a state of the block chain at a time the given block was published on the block chain;
determine a proof that the value of the outcome obtained from the block chain corresponds to that reported by the first prediction market by:
identifying a set of nodes within a cryptographic structure that forms a path from a top node to an outcome node containing the value of the outcome;
hashing the outcome node with a sibling node to obtain a hash of a parent node of the outcome node; and
successively repeating the hashing with the parent node and any other intervening nodes between the outcome node and the top node until a hash of the top node is obtained; and
responsive to the hash of the top node from the proof matching the state root hash, submit the proof to a second prediction market to resolve the second prediction market with respect to the outcome.

### Claim 2 (depends on 1)

The system of claim 1, wherein the block chain is an Ethereum block chain.

### Claim 3 (depends on 1)

The system of claim 1, wherein the cryptographic structure includes a Merkle-Patricia tree.

### Claim 4 (depends on 3)

The system of claim 3, wherein nodes within the Merkle-Patricia tree comprise one or more of an empty node, a key/value pair, or a branch node.

### Claim 5 (depends on 4)

The system of claim 4, wherein a node of the Merkle-Patricia tree comprises the key/value pair, and wherein the value associated with the outcome of the first prediction market is indicated by the key/value pair.

### Claim 6 (depends on 5)

The system of claim 5, wherein the value is one of an actual value conveying the outcome or a hash of another node in the Merkle-Patricia tree.

### Claim 7 (depends on 1)

The system of claim 1, wherein the outcome node in the set of nodes that form the path from the top node to the outcome node indicates a key/value pair.

### Claim 8 (depends on 7)

The system of claim 7, wherein the key associated with the outcome of the first prediction market is indicated by the key/value pair.

### Claim 9 (depends on 8)

The system of claim 8, wherein the key associated with the outcome of the first prediction market is indicated by the key/value pair as the path through the cryptographic structure from the top node to the outcome node.

### Claim 10 (depends on 1)

The system of claim 1, wherein the one or more hardware processors are further configured, responsive to the hash of the top node from the proof not matching the state root hash, to determine the proof is invalid and the cryptographic structure did not store the outcome reported by the first prediction market.

### Claim 11 (depends on 1)

The system of claim 1, wherein the one or more hardware processors are further configured to determine a plurality of proofs for outcomes reported by a plurality of prediction markets in addition to the outcome reported by the first prediction market and, responsive to hashes of top nodes from the plurality of proofs matching corresponding state root hashes for the plurality of proofs, submit the plurality of proofs to the second prediction market to resolve the second prediction market with respect to the outcomes reported by the plurality of prediction markets.

### Claim 12

A method comprising:
determining an outcome reported by a first prediction market, the outcome of the first prediction market being associated with a key and value, the key including an event identification of the first prediction market and the value conveying the outcome;
obtaining a state root hash from a given block in a block chain created during or after a resolution process of the first prediction market, the given block including a header, the header including the state root hash, the state root hash being a value corresponding to a state of the block chain at a time the given block was published on the block chain;
determining a proof that the value of the outcome obtained from the block chain corresponds to that as reported by the first prediction market by:
identifying a set of nodes within a cryptographic structure that forms a path from a top node to an outcome node containing the value of the outcome;
hashing the outcome node with a sibling node to obtain a hash of a parent node of the outcome node; and
successively repeating the hashing with the parent node and any other intervening nodes between the outcome node and the top node until a hash of the top node is obtained; and
responsive to the hash of the top node from the proof matching the state root hash, submitting the proof to a second prediction market to resolve the second prediction market with respect to the outcome.

### Claim 13 (depends on 12)

The method of claim 12, wherein the block chain is an Ethereum block chain.

### Claim 14 (depends on 12)

The method of claim 12, wherein the cryptographic structure includes a Merkle-Patricia tree.

### Claim 15 (depends on 14)

The method of claim 14, wherein nodes within the Merkle-Patricia tree comprise one or more of an empty node, a key/value pair, or a branch node.

### Claim 16 (depends on 15)

The method of claim 15, wherein a node of the Merkle-Patricia tree comprises the key/value pair, and wherein the value associated with the outcome of the first prediction market is indicated by the key/value pair.

### Claim 17 (depends on 16)

The method of claim 16, wherein the value is one of an actual value conveying the outcome or a hash of another node in the Merkle-Patricia tree.

### Claim 18 (depends on 12)

The method of claim 12, wherein the outcome node in the set of nodes that form the path from the top node to the outcome node indicates a key/value pair.

### Claim 19 (depends on 18)

The method of claim 18, wherein the key associated with the outcome of the first prediction market is indicated by the key/value pair.

### Claim 20 (depends on 19)

The method of claim 19, wherein the key associated with the outcome of the first prediction market is indicated by the key/value pair as the path through the cryptographic structure from the top node to the outcome node.

### Claim 21 (depends on 12)

The method of claim 12, further comprising determining, responsive to the hash of the top node from the proof not matching the state root hash, the proof is invalid and the cryptographic structure did not store the outcome reported by the first prediction market.

### Claim 22 (depends on 12)

The method of claim 12, further comprising determining a plurality of proofs for outcomes reported by a plurality of prediction markets in addition to the outcome reported by the first prediction market and, responsive to hashes of top nodes from the plurality of proofs matching corresponding state root hashes for the plurality of proofs, submitting the plurality of proofs to the second prediction market to resolve the second prediction market with respect to the outcomes reported by the plurality of prediction markets.
