# US 12,120,192 B2 · Surge protection for scheduling minting of cryptographic tokens

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

- Number: US 12,120,192 B2
- Document ID: US12120192B2
- Status: Granted
- Kind: B2
- Application number: 17/579,546
- Filed: 2022-01-19
- Published: 2022-05-05
- Granted: 2024-10-15
- Earliest claimed: 2018-12-18
- Assignees: Rokfin, Inc.
- Applicants: Rokfin, Inc.
- Inventors: Scott Augustine; Martin Floreani
- Web page: https://patentgrep.com/patent/US12120192B2

## CPC

- G06Q 30/02: Marketing; Price estimation or determination; Fundraising
- H04L 67/535: {Tracking the activity of the user (network monitoring arrangements H04L43/00; recording of computer activity G06F11/34)}
- G06F 16/1837: {Management specially adapted to peer-to-peer storage networks (topology management mechanisms of peer-to-peer networks H04L67/1042)}
- G06F 16/27: Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- G06F 16/9536: Search customisation based on social or collaborative filtering
- G06F 21/16: Program or content traceability, e.g. by watermarking
- G06Q 10/02: Reservations, e.g. for tickets, services or events
- G06Q 20/105: {involving programming of a portable memory device, e.g. IC cards, "electronic purses"}
- G06Q 20/389: {Keeping log of transactions for guaranteeing non-repudiation of a transaction}
- G06Q 30/0201: Market modelling; Market analysis; Collecting market data
- G06Q 30/0215: {Including financial accounts}
- 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/3213: {using tickets or tokens, e.g. Kerberos (network architectures or network communication protocols for entities authentication using tickets in a packet data network H04L63/0807)}
- G06Q 2220/00: Business processing using cryptography
- 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

Described processes include: detecting a surge in load or value added to a network based on a threshold number (e.g., 3, 5, or another number) mints are triggered in a row at above a threshold block value target (e.g., 2×, 5×, 10×, or other multiple). In response to detecting a surge, a determination to mint may be timed, like paused, for a desired mint duration, like 24 hours. Thus, in response to detecting a surge, the next mint may be forcefully delayed until the desired minting period transpires after the last mint.

## Claims

### Claim 1

A tangible, non-transitory, machine-readable medium storing instructions that when executed by one or more processors effectuate operations comprising:
obtaining, with one or more processors, instantiation records corresponding to one or more historical instantiations of a cryptographic token, the instantiation records indicating for each historical instantiation:
an identifier associated with an instantiation period,
a timestamp associated with the instantiation period,
a tractable value for the instantiation period, and
a target tractable value for the instantiation period,
selecting a trailing number of historical instantiations of the cryptographic token satisfying first surge detection criteria;
determining, for a last historical instantiation of the cryptographic token:
a duration of the last historical instantiation based on a first timestamp associated with the last historical instantiation and a second timestamp associated with a next to last historical instantiation,
an adjusted tractable value based on the tractable value and the duration of the last historical instantiation, and
a surge factor based on the target tractable value and the adjusted tractable value;
determining, based on second surge detection criteria, that the surge factor of the last historical instantiation and a surge factor of the next to last historical instantiation exceeds a threshold surge value;
outputting, with one or more processors, in response to determining the surge factor of the next to last historical instantiation exceeds the threshold surge value, a result indicative of a detected surge in tractable value added to a network, the result pausing a next instantiation of the cryptographic token for a threshold period of time corresponding to a schedule bias period value;
obtaining, with one or more processors, transaction records corresponding to one or more transactions in which amounts of the cryptographic token are transferred to an address inoperable to transfer received cryptographic tokens to other addresses according to a protocol of a decentralized computing platform during the threshold period of time; and
selecting, with one or more processors, a subset of the transaction records for the next instantiation of the cryptographic token based on a target tractable value for the next instantiation.

### Claim 2 (depends on 1)

The medium of claim 1, further comprising:
determining, based on third surge detection criteria, that a second subset of the transaction records, not including the transaction records in the first subset, exceeds a target tractable value for an instantiation subsequent to the next instantiation; and
maintaining, in response to determining that the second subset of the transaction records exceeds the target tractable value for the instantiation subsequent to the next instantiation period, output of the result indicative of the detected surge in tractable value added to the network, the result pausing the instantiation subsequent to the next instantiation for the threshold period of time corresponding to the schedule bias period value after the next instantiation.

### Claim 3 (depends on 1)

The medium of claim 1, further comprising:
determining the target tractable value for the next instantiation based on a measure of central tendency of adjusted tractable values of a second selection of a trailing number of historical instantiations.

### Claim 4 (depends on 3)

The medium of claim 3, wherein a measure of central tendency of the adjusted tractable values of the second selection of a trailing number of historical instantiations is a mean, median, or mode the adjusted tractable values.

### Claim 5 (depends on 3)

The medium of claim 3, wherein:
the second selection of a trailing number of historical instantiations comprises more than 12 historical instantiations, and
the first selection of a trailing number of historical instantiations comprises less than 12 historical instantiations.

### Claim 6 (depends on 1)

The medium of claim 1, wherein:
the first surge detection criteria specifies one or more set sizes of preceding historical instantiations to select; and
the second surge detection criteria specifies a threshold surge value for respective set size.

### Claim 7 (depends on 1)

The medium of claim 1, wherein determining an adjusted tractable value based on the tractable value and the duration of the last historical instantiation comprises:
tabulating an aggregate tractable value of transaction records corresponding to one or more transactions associated with the last instantiation in which amounts of the cryptographic token are transferred to an address inoperable to transfer received cryptographic tokens to other addresses according to the protocol of a decentralized computing platform; and
adjusting the aggregate tractable value based on the duration of the last historical instantiation relative to the schedule bias period value.

### Claim 8 (depends on 7)

The medium of claim 7, wherein:
the schedule bias period value for instantiations of the cryptographic token is a fixed time value less than 72 hours, and
for a duration less than the schedule bias period value, the determined adjustment value biases the adjusted tractable value to a value greater than the aggregate tractable value, and
for a duration greater than the scheduling value, the determined adjusted values biases the adjusted tractable value to a value less than the aggregate tractable value.

### Claim 9 (depends on 1)

The medium of claim 1, further comprising:
determining to instantiate the cryptographic token for the next instantiation after the threshold period of time corresponding to the schedule bias period value, wherein:
a tractable value for the next instantiation is based on an aggregate tractable value of the subset of the transaction records, and
a target tractable value for an instantiation subsequent to the next instantiation is based on the tractable value of the next instantiation and a plurality of historical instantiation preceding the next instantiation.

### Claim 10 (depends on 9)

The medium of claim 9, wherein:
the target tractable values for the instantiation subsequent to the next instantiation is greater than the target tractable value of the next instantiation period and less than the last instantiation period.

### Claim 11 (depends on 1)

The medium of claim 1, wherein obtaining, with one or more processors, transaction records corresponding to one or more transactions in which amounts of the cryptographic token are transferred to an address inoperable to transfer received cryptographic tokens to other addresses according to a protocol of a decentralized computing platform during the threshold period of time comprises:
accessing, with one or more processors, a data structure associating reported burn transaction identifiers with cryptographic hash addresses of respective records storing transaction information for one or more burn transactions; and
accessing the respective records within a directed acyclic graph of cryptographic hash pointers based on the cryptographic hash addresses.

### Claim 12 (depends on 11)

The medium of claim 11, wherein:
the data structure further associates timestamps with burn transaction identifiers, and
burn transactions identifiers corresponding to the threshold period of time are selected to the subset of the transaction records for the next instantiation of the cryptographic token based on the respective timestamps in first in, first out, order.

### Claim 13 (depends on 1)

The medium of claim 1, wherein outputting, with one or more processors, in response to determining the surge factor of the next to last historical instantiation exceeds the threshold surge value, a result indicative of a detected surge in tractable value added to a network, the result pausing a next instantiation of the cryptographic token for a threshold period of time corresponding to a schedule bias period value comprises:
submitting the result to a smart contract of the distributed computing platform.

### Claim 14 (depends on 13)

The medium of claim 13, wherein:
the smart contract delays the next instantiation of the cryptographic token for at least the threshold period of time, and
the smart contact effectuates the next instantiation of the cryptographic token based on the selected subset of the transaction records.

### Claim 15

A computer-implemented method, comprising:
obtaining, with one or more processors, instantiation records corresponding to one or more historical instantiations of a cryptographic token, the instantiation records indicating for each historical instantiation:
an identifier associated with an instantiation period,
a timestamp associated with the instantiation period,
a tractable value for the instantiation period, and
a target tractable value for the instantiation period,
selecting a trailing number of historical instantiations of the cryptographic token satisfying first surge detection criteria;
determining, for a last historical instantiation of the cryptographic token:
a duration of the last historical instantiation based on a first timestamp associated with the last historical instantiation and a second timestamp associated with a next to last historical instantiation,
an adjusted tractable value based on the tractable value and the duration of the last historical instantiation, and
a surge factor based on the target tractable value and the adjusted tractable value;
determining, based on second surge detection criteria, that the surge factor of the last historical instantiation and a surge factor of the next to last historical instantiation exceeds a threshold surge value;
outputting, with one or more processors, in response to determining the surge factor of the next to last historical instantiation exceeds the threshold surge value, a result indicative of a detected surge in tractable value added to a network, the result pausing a next instantiation of the cryptographic token for a threshold period of time corresponding to a schedule bias period value;
obtaining, with one or more processors, transaction records corresponding to one or more transactions in which amounts of the cryptographic token are transferred to an address inoperable to transfer received cryptographic tokens to other addresses according to a protocol of a decentralized computing platform during the threshold period of time; and
selecting, with one or more processors, a subset of the transaction records for the next instantiation of the cryptographic token based on a target tractable value for the next instantiation.

### Claim 16 (depends on 15)

The method of claim 15, further comprising:
determining, based on third surge detection criteria, that a second subset of the transaction records, not including the transaction records in the first subset, exceeds a target tractable value for an instantiation subsequent to the next instantiation; and
maintaining, in response to determining that the second subset of the transaction records exceeds the target tractable value for the instantiation subsequent to the next instantiation period, output of the result indicative of the detected surge in tractable value added to the network, the result pausing the instantiation subsequent to the next instantiation for the threshold period of time corresponding to the schedule bias period value after the next instantiation.

### Claim 17 (depends on 15)

The method of claim 15, further comprising:
determining the target tractable value for the next instantiation based on a measure of central tendency of adjusted tractable values of a second selection of a trailing number of historical instantiations.

### Claim 18 (depends on 15)

The method of claim 15, wherein determining an adjusted tractable value based on the tractable value and the duration of the last historical instantiation comprises:
tabulating an aggregate tractable value of transaction records corresponding to one or more transactions associated with the last instantiation in which amounts of the cryptographic token are transferred to an address inoperable to transfer received cryptographic tokens to other addresses according to the protocol of a decentralized computing platform; and
adjusting the aggregate tractable value based on the duration of the last historical instantiation relative to the schedule bias period value.

### Claim 19 (depends on 18)

The method of claim 18, wherein:
the schedule bias period value for instantiations of the cryptographic token is a fixed time value less than 72 hours, and
for a duration less than the schedule bias period value, the determined adjustment value biases the adjusted tractable value to a value greater than the aggregate tractable value, and
for a duration greater than the scheduling value, the determined adjusted values biases the adjusted tractable value to a value less than the aggregate tractable value.

### Claim 20 (depends on 15)

The method of claim 15, wherein outputting, with one or more processors, in response to determining the surge factor of the next to last historical instantiation exceeds the threshold surge value, a result indicative of a detected surge in tractable value added to a network, the result pausing a next instantiation of the cryptographic token for a threshold period of time corresponding to a schedule bias period value comprises:
submitting the result to a smart contract of the distributed computing platform.