# US 12,225,107 B2 · Separating hashing from proof-of-work in blockchain environments

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

- Number: US 12,225,107 B2
- Document ID: US12225107B2
- Status: Granted
- Kind: B2
- Application number: 18/613,550
- Filed: 2024-03-22
- Published: 2024-08-15
- Granted: 2025-02-11
- Earliest claimed: 2020-01-17
- Assignees: Inveniam Capital Partners, Inc.
- Applicants: Inveniam Capital Partners, Inc.
- Inventors: Paul Snow
- Web page: https://patentgrep.com/patent/US12225107B2

## CPC

- H04L 9/0637: {Modes of operation, e.g. cipher block chaining [CBC], electronic codebook [ECB] or Galois/counter mode [GCM]}
- A61B 1/018: for receiving instruments
- A61B 1/273: for the upper alimentary canal, e.g. oesophagoscopes or gastroscopes
- A61J 1/05: for collecting, storing or administering blood, plasma or medical fluids {(multiple bags systems for separating or storing blood components A61M1/0209); Infusion or perfusion containers}
- A61J 1/06: Ampoules or carpules (syringe ampoules or carpules A61M5/28)
- A61K 49/006: {Biological staining of tissues in vivo, e.g. methylene blue or toluidine blue O administered in the buccal area to detect epithelial cancer cells, dyes used for delineating tissues during surgery}
- A61L 24/001: {Use of materials characterised by their function or physical properties}
- A61L 24/046: {obtained otherwise than by reactions only involving carbon-to-carbon unsaturated bonds (A61L24/043 takes precedence)}
- A61L 31/06: obtained otherwise than by reactions only involving carbon-to-carbon unsaturated bonds {(A61L31/041 takes precedence)}
- A61M 5/007: {for contrast media}
- A61M 5/178: Syringes
- A61M 5/329: {characterised by features of the needle shaft}
- A61M 39/10: Tube connectors or tube couplings
- G06F 12/0815: Cache consistency protocols
- G06F 16/2379: {Updates performed during online database operations; commit processing}
- G06F 16/2465: {Query processing support for facilitating data mining operations in structured databases}
- G06F 16/9014: {hash tables}
- G06F 21/602: {Providing cryptographic facilities or services}
- G06F 21/64: Protecting data integrity, e.g. using checksums, certificates or signatures
- H04L 9/0643: {Hash functions, e.g. MD5, SHA, HMAC or f9 MAC}
- H04L 9/0869: {involving random numbers or seeds}
- 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}
- A61L 2300/442: Colorants, dyes
- A61L 2400/06: Flowable or injectable implant compositions
- G06F 2212/1016: Performance improvement
- G06F 2216/03: Data mining
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- A61B: DIAGNOSIS; SURGERY; IDENTIFICATION (usefulness limited to only animals A61D)
- A61J: CONTAINERS SPECIALLY ADAPTED FOR MEDICAL OR PHARMACEUTICAL PURPOSES; DEVICES OR METHODS SPECIALLY ADAPTED FOR BRINGING PHARMACEUTICAL PRODUCTS INTO PARTICULAR PHYSICAL OR ADMINISTERING FORMS; DEVICES FOR ADMINISTERING FOOD OR MEDICINES ORALLY; BABY COMFORTERS; DEVICES FOR RECEIVING SPITTLE
- A61K: PREPARATIONS FOR MEDICAL, DENTAL OR TOILETRY PURPOSES (devices or methods specially adapted for bringing pharmaceutical products into particular physical or administering forms A61J3/00; chemical aspects of, or use of materials for deodorisation of air, for disinfection or sterilisation, or for bandages, dressings, absorbent pads or surgical articles A61L; soap compositions C11D)
- A61L: METHODS OR APPARATUS FOR STERILISING MATERIALS OR OBJECTS IN GENERAL; DISINFECTION, STERILISATION OR DEODORISATION OF AIR; CHEMICAL ASPECTS OF BANDAGES, DRESSINGS, ABSORBENT PADS OR SURGICAL ARTICLES; MATERIALS FOR BANDAGES, DRESSINGS, ABSORBENT PADS OR SURGICAL ARTICLES (preservation of bodies or disinfecting characterised by the agents employed A01N; preserving, e.g. sterilising, food or foodstuffs A23; preparations for medical, dental or toiletry purposes A61K)
- A61M: DEVICES FOR INTRODUCING MEDIA INTO, OR ONTO, THE BODY (introducing media into or onto the bodies of animals A61D7/00; means for inserting tampons A61F13/26; devices for administering food or medicines orally A61J; containers for collecting, storing or administering blood or medical fluids A61J1/05); DEVICES FOR TRANSDUCING BODY MEDIA OR FOR TAKING MEDIA FROM THE BODY (surgery A61B; chemical aspects of surgical articles A61L); DEVICES FOR PRODUCING OR ENDING SLEEP OR STUPOR {(Electrotherapy, e.g. producing anaesthesia by the use of alternating or intermittent currents A61N1/36021)}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## 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.

## Claims

### Claim 1

A proof-of-work method in a blockchain environment, the method comprising:
receiving, by a computer having a hardware processor, an electronic data comprising at least one blockchain transaction;
hashing the electronic data to generate a hash value; and
using the hash value, executing a proof-of-work algorithm to generate a proof-of-work result,
wherein a time delay in generating the proof-of-work result is caused mostly by a cache miss.

### Claim 2 (depends on 1)

The method of claim 1, further comprising the step of determining whether the proof-of-work result satisfies a proof-of-work target scheme.

### Claim 3 (depends on 1)

The method of claim 1, wherein the step of executing a proof-of-work algorithm comprises using a database table that exceeds a storage capacity of a cache memory of the hardware processor.

### Claim 4 (depends on 3)

The method of claim 3, wherein the step of using a database table comprises (i) identifying a location in the database table corresponding to a random value, and (ii) obtaining a table entry at the identified location.

### Claim 5 (depends on 4)

The method of claim 4, further comprising repeating the step of using a database table a predetermined number of cycles.

### Claim 6 (depends on 4)

The method of claim 4, wherein the step of executing a proof-of-work algorithm comprises generating a randomized hash value using the obtained table entry.

### Claim 7 (depends on 6)

The method of claim 6, wherein the step of generating a randomized hash value using the obtained table entry comprises a bit manipulation operation.

### Claim 8 (depends on 1)

The method of claim 1, further comprising generating a difficulty value by executing a difficulty algorithm.

### Claim 9

A miner system in a blockchain environment, the miner system comprising:
a hardware processor; and
a memory device storing instructions that, when executed by the hardware processor, perform operations comprising:
receiving an electronic data comprising at least one blockchain transaction:
hashing the electronic data to generate a hash value; and
using the hash value, executing a proof-of-work algorithm to generate a proof-of-work result,
wherein a time delay in generating the proof-of-work result is caused mostly by a cache miss.

### Claim 10 (depends on 9)

The miner system of claim 9, wherein the operations further comprise determining whether the proof-of-work result satisfies a proof-of-work target scheme.

### Claim 11 (depends on 9)

The miner system of claim 9, wherein the operation of executing a proof-of-work algorithm comprises using a database table that exceeds a storage capacity of a cache memory of the hardware processor.

### Claim 12 (depends on 11)

The miner system of claim 11, wherein the step of using a database table comprises (i) identifying a location in the database table corresponding to a random value, and (ii) obtaining a table entry at the identified location.

### Claim 13 (depends on 12)

The miner system of claim 12, further comprising repeating the operation of using a database table a predetermined number of cycles.

### Claim 14 (depends on 12)

The miner system of claim 12, wherein the operation of executing a proof-of-work algorithm comprises generating a randomized hash value using the obtained table entry.

### Claim 15 (depends on 14)

The miner system of claim 14, wherein the generating a randomized hash value using the obtained table entry comprises a bit manipulation operation.

### Claim 16

A non-transitory memory storing instructions that, when executed by a hardware processor, perform operations comprising:
receiving an electronic data comprising at least one blockchain transaction;
hashing the electronic data to generate a hash value; and
using the hash value, executing a proof-of-work algorithm to generate a proof-of-work result,
wherein a time delay in generating the proof-of-work result is mostly by a cache miss.

### Claim 17 (depends on 16)

The non-transitory memory of claim 16, wherein the operations further comprise determining whether the proof-of-work result satisfies a proof-of-work target scheme.

### Claim 18 (depends on 16)

The non-transitory memory of claim 16, wherein the operation of executing the proof-of-work algorithm comprises using a database table that exceeds a storage capacity of a cache memory of the hardware processor.

### Claim 19 (depends on 18)

The non-transitory memory of claim 18, wherein the step of using a database table comprises (i) identifying a location in the database table corresponding to a random value, and (ii) obtaining a table entry at the identified location.

### Claim 20 (depends on 18)

The non-transitory memory of claim 18, further comprising repeating the operation of using a database table a predetermined number of cycles.

### Claim 21 (depends on 19)

The non-transitory memory of claim 19, wherein the operation of executing a proof-of-work algorithm comprises generating a randomized hash value using the obtained table entry.

### Claim 22 (depends on 21)

The non-transitory memory of claim 21, wherein the step of generating a randomized hash value using the obtained table entry comprises a bit manipulation operation.