# US 12,423,661 B2 · Cryptographically secure booster packs in a blockchain

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

- Number: US 12,423,661 B2
- Document ID: US12423661B2
- Status: Granted
- Kind: B2
- Application number: 18/623,495
- Filed: 2024-04-01
- Published: 2024-07-25
- Granted: 2025-09-23
- Earliest claimed: 2018-02-27
- Assignees: Fall Guy LLC
- Applicants: Fall Guy LLC
- Inventors: Patrick Meehan
- Web page: https://patentgrep.com/patent/US12423661B2

## CPC

- G06Q 20/065: {using e-cash}
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- G06F 16/1824: {implemented using Network-attached Storage [NAS] architecture (distributed or networked storage systems G06F3/067; protocols for distributed storage of data in a network H04L67/1097)}
- G06Q 20/02: involving a neutral party, e.g. certification authority, notary or trusted third party [TTP]
- G06Q 20/3825: {Use of electronic signatures}
- G06Q 20/3829: {involving key management}
- G06Q 20/389: {Keeping log of transactions for guaranteeing non-repudiation of a transaction}
- H04L 9/0643: {Hash functions, e.g. MD5, SHA, HMAC or f9 MAC}
- H04L 9/0861: {Generation of secret information including derivation or calculation of cryptographic keys or passwords}
- H04L 9/3247: {involving digital signatures}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L 2209/56: Financial cryptography, e.g. electronic payment or e-cash
- 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
- 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)

## Abstract

A facility for cryptographically securing booster packs using tear transactions is described.

## Claims

### Claim 1

A method performed by one or more computing systems for securing a cryptographic model of a pack of digital assets, the method comprising:
generating a tear transaction request for the cryptographic model of the pack that includes a user identifier and a pack identifier of the cryptographic model of the pack, wherein the tear transaction request specifies a first reward for recording a tear transaction and a second reward for recording an open transaction;
distributing the tear transaction request within a mining network for recording of the tear transaction in a blockchain;
deriving a respective penalty score for each participant of a plurality of participants of the mining network based on a lexical distance between a cryptographic key of that participant and a target cryptographic key;
choosing a first miner from the plurality of participants of the mining network based on the respective penalty score derived for each participant of the plurality of participants;
in response to a computing system of the first miner recording the tear transaction in a first block of the blockchain, providing the first reward to an account of the first miner;
in response to a computing system of a second miner recording a second block of the blockchain that is more than a specified number of blocks after the first block:
applying an open function to the cryptographic model of the pack to transform the pack identifier to a transformed pack identifier,
generating the open transaction that includes the user identifier, the pack identifier, and the transformed pack identifier, and
in response to the computing system of the second miner recording the open transaction in the second block of the blockchain, providing the second reward to an account of the second miner.

### Claim 2 (depends on 1)

The method of claim 1, wherein the target cryptographic key is a cryptographic key of an unavailable participant of the mining network.

### Claim 3 (depends on 2)

The method of claim 2, wherein the target cryptographic key is a public key of the unavailable participant of the mining network; and
wherein the cryptographic key of each participant of the plurality of participants is a public key of that participant.

### Claim 4 (depends on 1)

The method of claim 1, wherein the cryptographic key of each participant of the plurality of participants is XORed with a hash of a block of the blockchain to obtain a result; and
wherein the first miner is chosen further based on the result obtained by the cryptographic key of the first miner XORed with the hash.

### Claim 5 (depends on 2)

The method of claim 2, wherein the unavailable participant was initially chosen by round robin from among other participants of the mining network.

### Claim 6

A method performed by one or more computing systems for securing a cryptographic model of a pack of digital assets, the method comprising:
generating a tear transaction request for the cryptographic model of the pack that includes a user identifier and a pack identifier of the cryptographic model of the pack, wherein the tear transaction request specifies a first reward for recording a tear transaction and a second reward for recording an open transaction;
distributing the tear transaction request within a mining network for recording of the tear transaction in a blockchain;
deriving a respective penalty score for each participant of a plurality of participants of the mining network based on a quantity of the plurality of participants of the mining network at a time that the participant recorded a prior block of the blockchain;
choosing a first miner from the plurality of participants of the mining network based on the respective penalty score derived for each participant of the plurality of participants;
in response to a computing system of the first miner recording the tear transaction in a first block of the blockchain, providing the first reward to an account of the first miner;
in response to a computing system of a second miner recording a second block of the blockchain that is more than a specified number of blocks after the first block:
applying an open function to the cryptographic model of the pack to transform the pack identifier to a transformed pack identifier,
generating the open transaction that includes the user identifier, the pack identifier, and the transformed pack identifier, and
in response to the computing system of the second miner recording the open transaction in the second block of the blockchain, providing the second reward to an account of the second miner.

### Claim 7 (depends on 6)

The method of claim 6, wherein the respective penalty score is further derived for each participant of the plurality of participants based on a lexical distance between a cryptographic key of that participant and a target cryptographic key.

### Claim 8 (depends on 7)

The method of claim 7, wherein the cryptographic key of each participant of the plurality of participants is XORed with a hash of a block of the blockchain to obtain a result; and
wherein the first miner is chosen further based on the result obtained by the cryptographic key of the first miner XORed with the hash.