# US 2023/0274262 A1 · System and method for better utilization of power consumption in blockchain system by validating digital currency transactions with minimal computing resources > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2023/0274262 A1 - Document ID: US20230274262A1 - Status: Published application - Kind: A1 - Application number: 18/115,693 - Filed: 2023-02-28 - Published: 2023-08-31 - Earliest claimed: 2022-02-28 - Assignees: International Institute of Information Technology, Hyderabad - Applicants: International Institute of Information Technology, Hyderabad - Inventors: Sujit Prakash Gujar; Yash Chaurasia; Visvesh Subramanian - Web page: https://patentgrep.com/patent/US20230274262A1 ## CPC - G06Q 20/3678: {e-cash details, e.g. blinded, divisible or detecting double spending} - G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues} - G06F 9/5011: {the resources being hardware resources other than CPUs, Servers and Terminals} - G06Q 20/3674: {involving authentication} - H04L 9/3297: {involving time stamps, e.g. generation of time stamps} - H04L 9/50: {using hash chains, e.g. blockchains or hash trees} - G06F 2209/501: Performance criteria - 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 - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) ## Abstract A system for better utilization of power consumption of a computing network in at least one blockchain system by validating digital currency transactions with minimal computing resources. The system is configured to (i) communicate at least one problem with a difficulty calculation specification using a centralized server, (ii) create a problem mempool to broadcast the at least one problem with the difficulty calculation specification, (iii) create a transaction mempool to enable the at least one miner to select the at least one transaction, (iv) validate a solution that corresponds to the at least one problem, (v) verify a block associated with the selected problem with a validated solution as proof of work and (vi) determine a problem fee for the at least one miner for the solved problem when the block associated is verified. ## Claims ### Claim 1 A system for better utilization of power consumption of a computing network in at least one blockchain system by validating digital currency transactions with minimal computing resources, comprising, a memory; a processor that is configured to communicate at least one problem with a difficulty calculation specification using a centralized server, wherein the centralized server communicates at least one transaction that corresponds to at least one miner; create a problem mempool to broadcast the at least one problem with the difficulty calculation specification, wherein the at least one problem is entered into the problem mempool once a problem is registered in a problem merkle tree; create a transaction mempool to enable the at least one miner to select the at least one transaction; validate a solution that corresponds to the at least one problem by checking if the at least one problem is solved by at least one miner using a hash, wherein the selected problem is communicated to the at least one miner using at least one of the centralized server, the problem mempool or the transactional mempool; verify a block associated with the selected problem with a validated solution using the hash of a previous block of a blockchain as a proof of work; and determine a problem fee for the at least one miner for the solved problem when the block associated is verified. ### Claim 2 (depends on 1) The system of claim 1, wherein the centralized server is utilized for a centralized blockchain system to communicate the at least one problem with the difficulty calculation specification. ### Claim 3 (depends on 1) The system of claim 1, wherein the problem mempool and the transaction mempool are created for a decentralized blockchain system to broadcast the at least one problem with the difficulty calculation specification. ### Claim 4 (depends on 1) The system of claim 1, wherein the transaction mempool comprises valid pending transactions that are added to be in the blockchain. ### Claim 5 (depends on 1) The system of claim 1, wherein the at least one problem are cryptographic puzzles that are communicated to the at least one miner using the centralized server by at least one puzzler, wherein each problem includes a problem description, a timestamp, a difficulty level of a problem, a problem fee and a solution description. ### Claim 6 (depends on 1) The system of claim 1, wherein the system is communicatively connected with a plurality of computing devices that are associated with the at least one miner to solve the at least one problem, wherein each computing device stores the blockchain. ### Claim 7 (depends on 1) The system of claim 1, wherein each block of the blockchain comprise at least one of a block header or a block body, wherein the block header comprises at least one of a hash of a previous data block, Merkle root of transactions, a Merkle root of a new problem timestamp, a nonce, a version, or a difficulty and a hash of a problem solved, wherein the block body comprises at least one transaction in Merkle tree, or the problem that is solved by the at least one miner of the plurality of miners. ### Claim 8 (depends on 1) The system of claim 1, wherein the at least one miner solves a cryptographic puzzle as the proof of the work in an absence of problems in the problem mempool to solve. ### Claim 9 (depends on 1) The system of claim 1, wherein the problems in the problem mempool comprise at least one of (i) equiprobable solution space where inputs given are equally to produce a valid solution, which is to be maintained progress-freeness because if a solution space is skewed, the at least one miner is try out promising inputs first; (ii) inexhaustible solution space where the blockchain does not run out of problems to solve; (iii) non-algorithmically generated; or (iv) application-specific integrated circuit (ASIC) resistance that enables a general-purpose computer too to solve the problem. ### Claim 10 (depends on 1) The system of claim 1, wherein the at least one miner publishes the solution as a proof of work block for the at least one problem that is selected and solved to claim the problem fee. ### Claim 11 A method for better utilization of power consumption of a computing network in at least one blockchain system by validating digital currency transactions with minimal computing resources, comprising, communicating at least one problem with a difficulty calculation specification using a centralized server, wherein the centralized server communicates at least one transaction that corresponds to at least one miner; creating a problem mempool to broadcast the at least one problem with the difficulty calculation specification, wherein the at least one problem is entered into the problem mempool once a problem is registered in a problem merkle tree; creating a transaction mempool to enable the at least one miner to select the at least one transaction; validating a solution that corresponds to the at least one problem by checking if the at least one problem is solved by at least one miner using a hash, wherein the selected problem is communicated to the at least one miner using at least one of the centralized server, a problem mempool or a transactional mempool; verifying a block associated with the selected problem with a validated solution using the hash of a previous block of the blockchain as proof of work; and determining a problem fee for the at least one miner for the solved problem when the block associated is verified. ### Claim 12 (depends on 11) The method of claim 11, wherein the method comprises utilizing the centralized server for a centralized blockchain system to communicate the at least one problem with the difficulty calculation specification. ### Claim 13 (depends on 11) The method of claim 11, wherein the method comprises creating the problem mempool and the transaction mempool for a decentralized blockchain system to broadcast the at least one problem with the difficulty calculation specification, wherein the transaction mempool comprises valid pending transactions that are added to be in the blockchain. ### Claim 14 (depends on 11) The method of claim 11, wherein the method comprises communicating at least one problem are cryptographic puzzles to the at least one miner using the centralized server by at least one puzzler, wherein each problem comprises a problem description, a timestamp, a difficulty level of a problem, a problem fee and a solution description. ### Claim 15 (depends on 11) The method of claim 11, wherein the method comprises solving a cryptographic puzzle by the at least one miners as the proof of the work in an absence of problems in the problem mempool to solve; and publishing the solution by the at least one miner as a proof of work block for the at least one problem that is selected and solved to claim the problem fee. ### Claim 16 One or more non-transitory computer-readable storage mediums storing the one or more sequences of instructions, which when executed by one or more processors, further causes a method for better utilization of power consumption of a computing network in at least one blockchain system by validating digital currency transactions with minimal computing resources, comprising, communicating at least one problem with a difficulty calculation specification using a centralized server, wherein the centralized server communicates at least one transaction that corresponds to at least one miner; creating a problem mempool to broadcast the at least one problem with the difficulty calculation specification, wherein the at least one problem is entered into the problem mempool once a problem is registered in a problem merkle tree; creating a transaction mempool to enable the at least one miner to select the at least one transaction; validating a solution that corresponds to the at least one problem by checking if the at least one problem is solved by at least one miner using a hash, wherein the selected problem is communicated to the at least one miner using at least one of the centralized server, a problem mempool or a transactional mempool; verifying a block associated with the selected problem with a validated solution using the hash of a previous block of the blockchain as proof of work; and determining a problem fee for the at least one miner for the solved problem when the block associated is verified. ### Claim 17 (depends on 16) The one or more non-transitory computer-readable storage mediums storing the one or more sequences of instructions of claim 16, wherein the method comprises utilizing the centralized server for a centralized blockchain system to communicate the at least one problem with the difficulty calculation specification. ### Claim 18 (depends on 16) The one or more non-transitory computer-readable storage mediums storing the one or more sequences of instructions of claim 16, wherein the method comprises creating the problem mempool and the transaction mempool for a decentralized blockchain system to broadcast the at least one problem with the difficulty calculation specification, wherein the transaction mempool comprises valid pending transactions that are added to be in the blockchain. ### Claim 19 (depends on 16) The one or more non-transitory computer-readable storage mediums storing the one or more sequences of instructions of claim 16, wherein the method comprises communicating at least one problem are cryptographic puzzles to the at least one miner using the centralized server by at least one puzzler, wherein each problem comprises a problem description, a timestamp, a difficulty level of a problem, a problem fee and a solution description. ### Claim 20 (depends on 16) The one or more non-transitory computer-readable storage mediums storing the one or more sequences of instructions of claim 16, wherein the method comprises solving a cryptographic puzzle by the at least one miners as the proof of the work in an absence of problems in the problem mempool to solve; and publishing the solution by the at least one miner as a proof of work block for the at least one problem that is selected and solved to claim the problem fee.