# US 2022/0286273 A1 · RAM Hashing 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 2022/0286273 A1 - Document ID: US20220286273A1 - Status: Published application - Kind: A1 - Application number: 17/751,864 - Filed: 2022-05-24 - Published: 2022-09-08 - Earliest claimed: 2020-01-17 - Assignees: Inveniam Capital Partners, Inc. - Applicants: Inveniam Capital Partners, Inc. - Inventors: Paul Snow - Web page: https://patentgrep.com/patent/US20220286273A1 ## 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 at position 1 1-20. (canceled) ### Claim 21 A method by a miner system in a blockchain environment, the miner system including (i) a database table including a set of randomly distributed table entries, and (ii) a hardware processor including a cache memory that is smaller in size than the database table, the method comprising the steps of: (A) receiving a blockchain transaction data; and (B) performing a proof-of-work algorithm comprising: (i) obtaining a nonce; (ii) using a hashing algorithm, generating a hash value based on the received blockchain transaction data and on the obtained nonce; (iii) identifying a location in the database table corresponding to a random value; (iv) obtaining a table entry at the identified location; (v) generating a randomized hash value using the obtained table entry; and (vi) producing a proof-of-work output if the generated randomized hash value meets a predetermined criterion; wherein a time delay in arriving at the proof-of-work output is based mostly on the hardware processor incurring an at least one cache miss. ### Claim 22 (depends on 21) The method of claim 21, wherein the step of performing a proof-or-work algorithm comprises repeating steps (B)(iii) through (B)(v) a predetermined number of additional cycles prior to executing step (B)(vi), and wherein the generated randomized hash value used in step (B)(vi) is the randomized hash value that is generated during step (B)(v) of the last cycle of the predetermined number of additional cycles. ### Claim 23 (depends on 22) The method of claim 22, wherein the random value in step (B)(iii) of an initial cycle is determined using the generated hash value, and wherein the random value in step (B)(iii) of each additional cycle is determined using an at least one of: (a) the randomized hash value generated during the immediately prior cycle; and (b) the location, in the database table, identified during the immediately prior cycle. ### Claim 24 (depends on 22) The method of claim 22, further comprising repeating steps B(i) through (B)(v) if the generated randomized hash value does not meet the predetermined criterion in step (B)(vi). ### Claim 25 (depends on 21) The method of claim 21, wherein the hashing algorithm comprises a SHA-256 encryption algorithm. ### Claim 26 (depends on 21) The method of claim 21, wherein step (B)(vi) comprises calculating the predetermined criterion using a difficulty algorithm. ### Claim 27 (depends on 21) The method of claim 21, wherein step (B)(v) comprises a bit manipulation operation. ### Claim 28 A miner system associated with a blockchain environment, the miner system comprising a database table including a set of randomly distributed table entries and a hardware processor with a cache memory that is smaller in size than the database table, the miner system storing instructions that, when executed by the hardware processor, perform operations comprising: (A) receiving a blockchain transaction data; and (B) performing a proof-of-work algorithm comprising: (i) obtaining a nonce; (ii) using a hashing algorithm, generating a hash value based on the received blockchain transaction data and on the obtained nonce; (iii) identifying a location in the database table corresponding to a random value; (iv) obtaining a table entry at the identified location; (v) generating a randomized hash value using the obtained table entry; and (vi) generating a proof-of-work output if the generated randomized hash value meets a predetermined criterion; wherein a time delay in arriving at the proof-of-work output is based mostly on the hardware processor incurring an at least one cache miss. ### Claim 29 (depends on 28) The miner system of claim 28, further comprising instructions repeating operations (B)(iii) through (B)(v) for a predetermined number of additional cycles prior to operation (B)(vi), and wherein the generated randomized hash value used in operation (B)(vi) is the randomized hash value that is generated during operation (B)(v) of the last cycle of the predetermined number of additional cycles. ### Claim 30 (depends on 29) The miner system of claim 29, wherein the random value in operation (B)(iii) of an initial cycle is determined using the generated hash value, and wherein the random value in operation (B)(iii) of each additional cycle is determined using an at least one of: (a) the randomized hash value generated during the immediately prior cycle; and (b) the location, in the database table, identified during the immediately prior cycle. ### Claim 31 (depends on 29) The miner system of claim 29, further comprising instructions repeating operations B(i) through (B)(v) if the generated randomized hash value does not meet the predetermined criterion in operation (B)(vi). ### Claim 32 (depends on 28) The miner system of claim 28, wherein the hashing algorithm comprises a SHA-256 encryption algorithm. ### Claim 33 (depends on 28) The miner system of claim 28, wherein operation (B)(vi) comprises calculating the predetermined criterion using a difficulty algorithm. ### Claim 34 (depends on 28) The miner system of claim 28, wherein operation (B)(v) comprises a bit manipulation operation. ### Claim 35 A memory structure comprising (i) a cache memory in a hardware processor and (ii) a non-cache memory, the memory structure storing instructions that, when executed by the hardware processor, perform operations that mine a blockchain block associated with a blockchain environment, the operations comprising: (A) receiving a blockchain transaction data; and (B) performing a proof-of-work algorithm comprising: (i) obtaining a nonce; (ii) using a hashing algorithm, generating a hash value based on the received blockchain transaction data and on the obtained nonce; (iii) identifying a location in a database table corresponding to a random value, the database table being larger in size than the cache memory and comprising a set of randomly distributed table entries; (iv) obtaining a table entry at the identified location; (v) generating a randomized hash value using the obtained table entry; and (vi) generating a proof-of-work output if the generated randomized hash value meets a predetermined criterion; wherein a time delay in arriving at the proof-of-work output is based mostly on the hardware processor incurring an at least one cache miss. ### Claim 36 (depends on 35) The memory structure of claim 35, further comprising instructions repeating operations (B)(iii) through (B)(v) for a predetermined number of additional cycles prior to operation (B)(vi), and wherein the generated randomized hash value used in operation (B)(vi) is the randomized hash value that is generated during operation (B)(v) of the last cycle of the predetermined number of additional cycles. ### Claim 37 (depends on 36) The memory structure of claim 36, wherein the random value in operation (B)(iii) of an initial cycle is determined using the generated hash value, and wherein the random value in operation (B)(iii) of each additional cycle is determined using an at least one of: (a) the randomized hash value generated during the immediately prior cycle; and (b) the location, in the database table, identified during the immediately prior cycle, ### Claim 38 (depends on 36) The memory structure of claim 36, further comprising instructions repeating operations B(i) through (B)(v) if the generated randomized hash value does not meet the predetermined criterion in operation (B)(vi). ### Claim 39 (depends on 35) The memory structure of claim 35, wherein the hashing algorithm comprises a SHA-256 encryption algorithm. ### Claim 40 (depends on 35) The memory structure of claim 35, wherein operation (B)(vi) comprises calculating the predetermined criterion using a difficulty algorithm. ### Claim 41 (depends on 35) The memory structure of claim 35, wherein operation (B)(v) comprises a bit manipulation operation.