Interested in licensing this patent?
MTEC can help explore whether this patent might be available for licensing for your application.
Publication Number
US-12231535-B2
Publication Date
2025-02-18
Expiration Date
Abstract
Blockchain environments may mix-and-match different encryption, difficulty, and/or proof-of-work schemes when mining blockchain transactions. Each encryption, difficulty, and/or proof-of-work scheme may be separate, stand-alone programs, files, or third-party services. Blockchain miners may be agnostic to a particular coin's or network's encryption, difficulty, and/or proof-of-work schemes, thus allowing any blockchain miner to process or mine data in multiple blockchains. GPUs, ASICs, and other specialized processing hardware components may be deterred by forcing cache misses, cache latencies, and processor stalls. Hashing, difficulty, and/or proof-of-work schemes require less programming code, consume less storage space/usage in bytes, and execute faster. Blockchain mining schemes may further randomize byte or memory block access, further improve cryptographic security.
Core Innovation
The invention is a proof-of-work method by a miner system in a blockchain environment in which a hashing algorithm generates a hash value based on blockchain transaction data. The method identifies a location in a database table corresponding to a random value, obtains a table entry at the identified location, and utilizes a bit replacement operation to generate a randomized hash value using the obtained table entry. The proof-of-work output is produced based on the randomized hash value.
The proof-of-work production includes a time delay in producing the proof-of-work output that is based mostly on the hardware processor incurring at least one cache miss. This links proof-of-work generation time delay to cache misses such that the mining workflow is characterized by randomized access to a database table and processing time delays caused by cache behavior.
The related miner system and memory structure store instructions that perform operations mining a blockchain block associated with a blockchain environment. The database table is larger in size than the cache memory and comprises a set of randomly distributed table entries, and the system generates randomized hash values via table entry selection and a bit replacement operation before producing the proof-of-work output.
The document further supports refinements in which repeated operations are used across additional cycles, including deriving values across cycles from prior randomized hash values and prior database-table locations. It also supports conditional repetition of operations when a generated randomized hash value fails to satisfy a predetermined criterion, and includes variations that calculate a predetermined criterion using a difficulty algorithm and specify a hashing algorithm comprising SHA-256 encryption.
Claims Coverage
The independent claims are directed to a proof-of-work method, a miner system, and a memory structure for mining, each defined around hashing transaction data, selecting randomized table entries, producing a randomized hash via a bit replacement operation, and generating a proof-of-work output with a time delay based mostly on at least one cache miss. Across the independent claims, the core inventive features consistently include database-table-based randomization and cache-miss-driven time delay, with refinements including repetition cycles and difficulty-criterion handling.
Cache-miss-based proof-of-work time delay
A time delay in producing the proof-of-work output is based mostly on the hardware processor incurring an at least one cache miss.
Randomized table entry selection
Identifying a location in the database table corresponding to a random value, obtaining a table entry at the identified location, and generating a proof-of-work output using the randomized hash value derived from that table entry.
Bit replacement randomized hash generation
Utilizing a bit replacement operation, generating a randomized hash value using the obtained table entry, and producing a proof-of-work output based on the randomized hash value.
Hashing blockchain transaction data to derive a base hash
Utilizing a hashing algorithm and generating a hash value based on the blockchain transaction data.
Database table larger than cache memory
The database table being larger in size than the cache memory and comprising a set of randomly distributed table entries.
Difficulty-criterion handling for proof-of-work output
Calculating a predetermined criterion using a difficulty algorithm and repeating operations when a generated randomized hash value fails to satisfy a predetermined criterion.
Additional cycle repetition with carried forward randomized values and locations
Repeating steps (ii) through (iv) for a predetermined number of additional cycles before producing operation (v), using the randomized hash value generated in operation (iv) of the last additional cycle; and determining the random value across initial and additional cycles using at least one of the previously generated randomized hash value and the previously identified database-table location.
The independent claims cover a blockchain miner proof-of-work workflow that combines hashing blockchain transaction data with randomized selection of database table entries, transforms the selected entry through a bit replacement operation to form a randomized hash value, and outputs proof-of-work based on that randomized hash value, while tying proof-of-work generation time delay to at least one cache miss. The scope is further refined by additional cycles, conditional repetition based on a predetermined criterion, and optional difficulty-algorithm criterion calculation and SHA-256 specification.
Stated Advantages
Documented Applications
Mining a blockchain block in a blockchain environment using a miner system, and performing proof-of-work output generation based on randomized hash values derived from a randomized database table entry and a bit replacement operation.
Interested in licensing this patent?