Tokenless Key-Value Mapping Virtual Machine

The tokenless key-value mapping virtual machine (KVVM) addresses the limitations of current blockchain systems by enabling fee-free transactions and distributed data storage, facilitating the creation of sub-networks with enhanced functionality and speed.

JP2024543917APending Publication Date: 2024-11-26AVA LABS INC
View PDF 3 Cites 0 Cited by

Patent Information

Application Number
JP2024531352
Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
Priority Date
2021-12-03
Filing Date
2022-12-02
Publication Date
2024-11-26

AI Technical Summary

Technical Problem

Current blockchain applications impose severe restrictions on creating subnetworks and lack reward mechanisms and cross-subnet transfer mechanisms, preventing users from incorporating new virtual machines and managing tokens across multiple networks, which is a barrier to adopting new technologies.

Method used

Implementing a tokenless key-value mapping virtual machine (KVVM) that supports blockchain networks with fee-free transactions, hierarchical key ownership control, and distributed data storage, using proof-of-work operations within the local CPU to simplify transactions and avoid the need for intermediaries.

Benefits of technology

Enables the creation of sub-networks with increased network functionality, quality of service, and speed by maintaining a strong consistent view of all mappings, simplifying blockchain transactions, and allowing users to adopt new networks quickly without the need for tokens.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 2024543917000001_ABST
    Figure 2024543917000001_ABST
Patent Text Reader

Abstract

A method is provided for operating a virtual machine in a blockchain network. The method includes an agent requesting and mining recent block hashes for use in transaction construction and a target complexity, an agent constructing transactions including at least a public key and / or a virtual machine transaction, and a block producer periodically producing blocks including a set of transactions above a minimum complexity. A system is also provided that includes a memory storing instructions and a processor configured to execute the instructions to cause the system to perform the method.
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS This disclosure is related to and claims priority under 35 U.S.C. §119(e) to U.S. Provisional Patent Application No. 63 / 285,906, filed December 3, 2021, to Patrick R. O'GRADY, entitled TOKEN-LESS AND KEY-VALUE MAPPING VIRTUAL MACHINES, the contents of which are incorporated herein by reference in their entirety for all purposes.

[0002] background The present disclosure relates to conducting transactions on any type of blockchain network, which may include any number of different virtual machines that uniquely govern the logic of state transitions. More specifically, the present disclosure is directed to a tokenless strategy for conducting transactions using a key mapping hierarchy in a blockchain network. [Background technology]

[0003] Current blockchain applications impose severe limitations for creating subnetworks and lack reward and cross-subnet transfer mechanisms. Therefore, users cannot incorporate new virtual machines into their own subnetworks. Managing native / fee tokens across multiple networks is a complex task that creates a barrier to adopting new technologies. Summary of the Invention

[0004] In a first embodiment, a computer-implemented method includes an agent requesting and mining recent block hashes for use in transaction construction and a target complexity; an agent constructing transactions that include at least public keys and / or virtual machine transactions; and a block producer periodically producing blocks that include a set of transactions that exceed a minimum complexity.

[0005] In a second embodiment, a system includes a memory that stores a plurality of instructions and one or more processors configured to execute the instructions to cause the system to perform a process including requesting and mining recent block hashes for use in transaction construction and a target complexity, constructing transactions including at least public keys and / or virtual machine transactions, periodically producing blocks including a set of transactions above a minimum complexity, and serially processing state transitions within valid blocks, by a block producer.

[0006] In a second embodiment, a system includes a memory that stores a plurality of instructions and one or more processors configured to execute the instructions to cause the system to perform a process including requesting and mining recent block hashes for use in transaction construction and a target complexity, constructing transactions including at least public keys and / or virtual machine transactions, periodically producing blocks including a set of transactions above a minimum complexity, and serially processing state transitions within valid blocks, by a block producer.

[0007] In a third embodiment, a non-transitory computer-readable medium storing instructions that, when executed by one or more processors, cause the computer to perform a method including: requesting and mining, by an agent, recent block hashes for use in transaction construction and a target complexity; constructing, by the agent, transactions including at least public keys and / or virtual machine transactions; and periodically producing, by a block producer, blocks including a set of transactions above a minimum complexity.

[0008] In yet another embodiment, a system includes first means for storing instructions and second means for executing the instructions to cause the system to perform a method. The method includes requesting and mining, by an agent, recent block hashes for use in transaction construction and a target complexity, constructing, by the agent, transactions including at least public keys and / or virtual machine transactions, and periodically producing, by a block producer, blocks including a set of transactions above a minimum complexity.

[0009] These and other embodiments will become apparent to those of ordinary skill in the art in light of the following. [Brief description of the drawings]

[0010] [Figure 1] 1 illustrates a network architecture for implementing a token-less key-value mapping virtual machine, according to some embodiments. [Diagram 2] 2 illustrates a block diagram including some of the devices and systems used in the architecture of FIG. 1 in accordance with some embodiments. [Diagram 3] 1 is a flowchart illustrating steps in a method for implementing a key-value mapping virtual machine, according to some embodiments. [Figure 4]1 is a flowchart illustrating steps in a method for implementing a tokenless key-value mapping virtual machine according to some embodiments. [Diagram 5] 5 illustrates a computer system configured to perform at least some of the steps in the methods of FIGS. 3 and 4, according to some embodiments.

[0011] In the figures, elements having the same or similar reference numbers are associated with the same or similar attributes or features, unless expressly stated otherwise. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0012] The detailed description set forth below describes various configurations of the subject technology and is not intended to represent the only configurations in which the subject technology may be practiced. The detailed description includes specific details for the purpose of providing a thorough understanding of the subject technology. Thus, dimensions may be provided for certain embodiments as non-limiting examples. However, it will be apparent to one skilled in the art that the subject technology may be practiced without these specific details. In some instances, well-known structures and components are shown in block diagram form to avoid obscuring the concepts of the subject technology.

[0013] It should be understood that the present disclosure includes examples of the subject technology and does not limit the claims contained therein. Various aspects of the subject technology are now disclosed according to specific, but non-limiting examples. Various embodiments described in the present disclosure can be implemented in different ways and with modifications according to a desired application or implementation.

[0014] In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of the present disclosure. However, it will be apparent to those skilled in the art that embodiments of the present disclosure may be practiced without some of the specific details. In other instances, well-known structures and techniques are not shown in detail so as not to obscure the present disclosure.

[0015] General Overview Aspects of the disclosure are directed to fee-free virtual machine (VM) transactions. Additional aspects of the disclosure include key value VMs (with hierarchical key ownership control). For example, a key has the "right" to modify child (e.g., derived) keys. Additional aspects of the disclosure include novel tokenless VMs. It is understood that these are merely examples and additional embodiments are included.

[0016] In current blockchain networks, it is desirable to create subnetworks to increase network functionality, quality of service, speed, etc. However, current systems have severe limitations on growth (lacking reward mechanisms and proper cross-subnet forwarding schemes). Typically, developers are unable to implement Virtual Address Extension (VAX) machines in their own subnetworks.

[0017] The embodiments disclosed herein provide a virtual machine extension that supports blockchain networks and state changes. The present disclosure includes a simple standalone yet useful platform for VM implementation in blockchain networks: Key Value Virtual Mapping (KVVM).

[0018] The current approach using the interplanetary file system (IPFS) supports distributed, structured file storage, but the data / directory structure is fragile and current best efforts do not guarantee that all nodes retain (e.g., "replicate") the data (e.g., only if the operator "chose" to store them). Thus, IPFS only provides eventual consistency regarding the state of stored data. Other systems provide similar prefix storage with strong consistency, but are highly centralized (crash-fault tolerant only) and do not scale as desired.

[0019] The embodiments disclosed herein solve the above technical problems by allowing all, or nearly all, nodes (except for Byzantine nodes that deviate from the protocol) to maintain a strong consistent view of all mappings and their modification history. In addition, KVVM implementations may use arbitrary byte strings as keys / values, simplifying their universal adoption by users.

[0020] Typically, blockchain networks include a long and complicated process to "buy" tokens. To simplify blockchain transactions, the present disclosure includes a Proof-of-Work (PoW) operation in a local CPU without the need for any intermediary.

[0021] Most applications require a centralized database to track active user states. To avoid bottlenecks and server overload, the embodiments disclosed herein implement distributed data storage and key verification. The embodiments disclosed herein avoid the need to bring tokens into the network before they can be used, thus allowing people to adopt new networks / technologies more quickly.

[0022] Exemplary System Architecture FIG. 1 illustrates a network architecture 100 for implementing a tokenless key-value mapping virtual machine, according to some embodiments. A server 130 and a database 152 are communicatively coupled to a client device 110 via a network 150. The server 130 may host an application running within the client device 110. The client device 110 may be used by a participant of the application. The client device 110 may include a smartphone, a laptop, a mobile device, a palm device, and even a desktop. In some embodiments, the application may include transactions such as smart contract negotiation and execution. The network 150 may include, for example, any one or more of a local area network (LAN), a wide area network (WAN), the Internet, and the like. Furthermore, the network 150 may include any one or more of the following network topologies, including, but not limited to, a bus network, a star network, a ring network, a mesh network, a star-bus network, a tree or hierarchical network, and the like. The database 152 may store backup files from chat conversations, including threads, messages, videos, and metadata. In addition, database 152 may contain encrypted keys that may be distributed to each and every chat group participant.

[0023] FIG. 2 illustrates a block diagram 200 including some of the devices and systems used in the architecture 100, according to some embodiments. The client device 210 and the server 230 are communicatively coupled over the network 150 via respective communication modules 218-1 and 218-2 (collectively referred to hereinafter as "communication modules 218"). The communication module 218 is configured to interface with the network 150 to send and receive information, such as data, requests, responses, and commands, to other devices over the network 150. The communication module 218 may be, for example, a modem or an Ethernet card, and may include wireless hardware and software for wireless communication (e.g., via electromagnetic radiation, such as radio frequency - RF-, near field communication - NFC-, Wi-Fi, and Bluetooth wireless technologies). A user may interact with the client device 210 via the input devices 214 and the output devices 216. The input devices 214 may include a mouse, keyboard, pointer, touch screen, microphone, joystick, virtual joystick, and the like. In some embodiments, the input devices 214 may include cameras, microphones, and sensors such as touch sensors, acoustic sensors, inertial motion units - IMUs - and other sensors configured to provide input data to a VR / AR headset. The output devices 216 may be screen displays, touch screens, speakers, etc.

[0024] The client device 210 may include a memory 220-1 and a processor 212-1. The memory 220-1 may include an application 222 (e.g., a smart contract application) configured to execute within the client device 210 and couple with the input device 214 and the output device 216. The application 222 may be downloaded by a user from the server 230 and may be hosted by the server 230. In some embodiments, the client device 210 is a mobile phone used to collect and upload videos or images to the server 230 using the video or image collection application 222 for storage in the training database 252. In the smart contract application 222, the communication module 218-1 sends the contract party signatures 225 to the server 230 for inclusion in the smart contract 227. The smart contract 227 is sent from the server 230 to all parties to the smart contract via the communication module 218-2. Thus, a smart contract 227 may include one or more signatures from the parties to the contract. More generally, an application 222 may include any transaction application with verifiable authority for each party to the transaction.

[0025] Server 230 includes memory 220-2, processor 212-2, and communications module 218-2. Processors 212-1 and 212-2 and memories 220-1 and 220-2 are hereinafter collectively referred to as “processor 212” and “memory 220,” respectively. Processor 212 is configured to execute instructions stored in memory 220. In some embodiments, memory 220-2 includes a transaction engine 232 and a VM management engine 234. Transaction engine 232 may include a key mapping tool 240 and a validation tool 242.

[0026] The key mapping tool 240 is configured to handle encrypted keys for authorizing signatures from one or more parties to transactions processed by the application 222. In some embodiments, the key mapping tool 240 creates a common low-level key-value store that implements a complete non-custodial application where the user who claims the root key is the only user who can modify the application state. Some example application data formats where the user is the only entity that controls the data may include a simple byte string such as: [my name] / [application]_[data-record]. In some embodiments, the key mapping tool 240 may establish a "feed" from a single value to power a distributed "feed", connecting a chain of files by their hash. Thus, the key-value store only needs to store the "tip" of the chain in state, and the remaining hashes may be determined by walking back from the tip. In some embodiments, the key mapping tool 240 implements an Interplanetary Name System (IPNS) to dynamically generate / add values ​​to a given "content address". This results in faster replication than IPFS, which enhances content addressing, and makes connecting to the latest data complicated with just a user-specified prefix / key.

[0027] The validator 242 is configured to verify signatures provided by multiple parties for a transaction (e.g., in the data set 225) using encrypted keys mapped by the key mapping tool 240. In some embodiments, the validator 242 implements PoW to determine the validity of a transaction given a certain amount of network congestion (the more congestion, the more work required to be valid).

[0028] After receiving and verifying the signature 225, the transaction engine 232 may share or provide the data set 227 to the parties to the transaction. The parties to the transaction may access the transaction engine 232 through the application 222 installed in the memory 220-1. Thus, the application 222 may execute scripts and other routines installed by the server 230 and provided by the server 230 through any one of a number of tools. The execution of the application 222 may be controlled by the processor 212-1. In some embodiments, the transaction engine 232, the tools included therein, and at least a portion of the training database 252 may be hosted on different servers that are accessible by the server 230 or the client device 210.

[0029] 3 is a flow chart illustrating steps in a method 300 for implementing a key-value mapping virtual machine, according to some embodiments. In some embodiments, at least one or more steps of the method 300 may be performed by a processor executing instructions stored in memory of either a client device, a server or a virtual machine, or a database, as disclosed herein (see processor 212, memory 220, client devices 110 and 210, servers 130 and 230, and databases 152 and 252). The client device, server, VM, and database may be communicatively coupled to each other via a communication module through a network (e.g., communication module 218 and network 150). In some embodiments, the memory may include a transaction engine and a VM management engine including tools such as a key mapping tool or a validation tool, as disclosed herein (see transaction engine 232, VM management engine 234, key mapping tool 240, and validation tool 242). In some embodiments, methods consistent with the present disclosure may include at least one or more of the steps of method 300 being performed in a different order, simultaneously, near-simultaneously, or overlapping in time.

[0030] Step 302 includes generating a tokenless fee model that advocates healthy use of the service. In some embodiments, step 302 is part of state transition logic and can be applied to a modified version of an existing VM. In some embodiments, step 302 includes limiting the amount of workload caused by user transactions and limiting dynamic resource utilization of the network to achieve similar goals as other blockchains and / or VMs. In some embodiments, step 302 includes generating PoW for each feeless transaction (e.g., tokenless). In some embodiments, step 302 includes selecting PoW. Thus, in some embodiments, step 302 includes retaining recent block hashes to avoid mining conflicts. Mining conflicts are undesirable because they increase complexity and lead to a few sophisticated parties monopolizing the blockchain network. In some embodiments, step 302 includes using ASIC-resistant mining to avoid ASIC dominance / entry.

[0031] Step 304 includes modeling a general key-value mapping. In some embodiments, step 304 includes allowing hierarchical naming conventions. For example, in some embodiments, step 304 may include breaking down each "key" into multiple levels (e.g., path names in an OS where components from each level act like a directory). In some embodiments, step 304 includes attributing key ownership (e.g., permission to change key values) based on a hierarchy. For example, in some embodiments, step 304 includes allowing creators of some directories to manipulate all content below the directory.

[0032] If a user wishes to manipulate the key-value state (introduce a new mapping or modify existing content), step 304 may include receiving a transaction request from the user that includes a block hash referencing a block from the recent past (e.g., one minute). This limits the ability to pre-generate work that would monopolize or destabilize the system. Also, in some embodiments, step 304 may include receiving from the user a number of fixed-length integers known as "graffiti" (or "nonce", e.g., Bitcoin). The graffiti values ​​are used as part of the PoW process to validate transactions. Thus, step 304 may include executing a controllable amount of computational power to validate transactions. The degree of complexity for generating the PoW is determined by the system load. In some embodiments, step 304 includes deterministically deriving the degree of PoW complexity from a rolling window of the network's current congestion. In some embodiments, step 304 may also include determining a block-based work overhead that is met when blocks are generated faster than a targeted block rate. In some embodiments, step 304 includes offloading key values ​​for storage in IPFS to enable indexing of larger files.

[0033] 4 is a flow chart illustrating steps in a method 400 for implementing a tokenless key-value mapping virtual machine, according to some embodiments. In some embodiments, at least one or more steps of method 400 may be performed by a processor executing instructions stored in memory of either a client device, a server or virtual machine, or a database, as disclosed herein (see processor 212, memory 220, client devices 110 and 210, servers 130 and 230, and databases 152 and 252). The client device, server, VM, and database may be communicatively coupled to each other via a communication module through a network (e.g., communication module 218 and network 150). In some embodiments, the memory may include a transaction engine and a VM management engine including tools such as a key mapping tool or a validation tool, as disclosed herein (see transaction engine 232, VM management engine 234, key mapping tool 240, and validation tool 242). In some embodiments, methods consistent with the present disclosure may include at least one or more of the steps of method 400 being performed in a different order, simultaneously, near-simultaneously, or overlapping in time.

[0034] Step 402 includes, at a client device, requesting a block hash of the transaction, the block hash having a preselected complexity. In some embodiments, step 402 further includes instructing nodes in the blockchain network to calculate the block hash. In some embodiments, step 402 includes sampling a preselected number of recent blocks to find the block hash of the transaction. In some embodiments, step 402 includes iteratively modifying a proof-of-work request threshold until the block hash has a complexity above the preselected complexity or a time limit for the block hash has elapsed.

[0035] Step 404 includes constructing a virtual machine transaction that includes the public key and the block hash. In some embodiments, step 404 includes storing the transaction in a blockchain database. In some embodiments, step 404 includes sorting the list of transactions in the database by the degree of complexity of each transaction.

[0036] Step 406 includes generating a block that includes one or more transactions that exceed a preselected complexity. In some embodiments, step 406 includes verifying that a sum of the differences between the complexity of the one or more transactions and the preselected complexity exceeds the preselected complexity. In some embodiments, the preselected complexity is a fixed surcharge on the desired complexity of the block hash with all transactions above a minimum complexity. In some embodiments, step 406 includes increasing the preselected complexity when the block production rate is above a target rate and decreasing the preselected complexity when the block production rate is below the target rate. In some embodiments, the target rate of block production is one block created within 1 second and 2 seconds.

[0037] Step 408 includes serializing state transitions within a valid block. In some embodiments, step 408 includes prioritizing transactions that include more work. If the prefix is ​​not in use or has expired, step 408 includes claiming the prefix. In some embodiments, step 408 includes claiming a prefix of up to X bytes and verifying that the prefix is ​​not the address of a public key. When the user is a public key holder, step 408 includes allowing the user to use the public key or a portion thereof as a prefix. In some embodiments, step 408 includes modifying a key in the prefix hierarchy. In some embodiments, step 408 includes verifying that the key to be modified is under a controlled prefix.

[0038] In some embodiments, step 408 includes adding a life span transaction for the prefix. In some embodiments, the prefix decays over time (a prefix with no key lasts 7 days, prefixes with more subkeys decay faster). Thus, step 408 may include adding a 7 day life span to the prefix. In some embodiments, step 408 may include spreading the life span across all subkeys (e.g., a 1 day life with 7 keys in a given hierarchy). In some embodiments, to have deterministic state at each hierarchy state and allow for fast synchronization, the VMs disclosed herein do not asynchronously delete old prefixes. In some embodiments, users can add life spans to prefixes without having keys, and a community of users can support long life spans for keys and prefixes. In some embodiments, step 408 includes verifying that the KVVM contains relevant valid data and that bloating the state for a third party would be too CPU intensive depending on the degree of complexity.

[0039] In some embodiments, step 408 may include the following additions: Step 408 may include requiring multi-signature key ownership of the prefix of the decentralized autonomous organization-owned account. In some embodiments, step 408 includes a mining race for a common prefix / enforced lifespan limit to avoid stalled validation procedures taking over. In some embodiments, step 408 includes stateless execution of the new block. Thus, step 408 may include requiring a Merkle path for the modified block and all keys in the hierarchy. Thus, validators can store only the state root hash. In some embodiments, step 408 includes replicating large files outside of the blockchain state to avoid external sources for large files (e.g., entire file blobs in IPFS). The above additions to step 408 may be performed repeatedly (in any order) until all new blocks are incorporated into the blockchain and validated.

[0040] Hardware Overview 5 is a block diagram illustrating an exemplary computer system 500 on which headsets and other client devices 110 and methods 300 and 400 can be implemented, according to some embodiments. In certain aspects, computer system 500 may be implemented using hardware or a combination of software and hardware, in a dedicated server, integrated into another entity, or distributed across multiple entities. Computer system 500 may include a desktop computer, laptop computer, tablet, phablet, smartphone, feature phone, server computer, or otherwise. The server computer may be located remotely in a data center or stored locally.

[0041] Computer system 500 includes a bus 508 or other communication mechanism for communicating information, and a processor 502 (e.g., processor 212) coupled with bus 508 for processing information. By way of example, computer system 500 may be implemented with one or more processors 502. Processor 502 may be a general purpose microprocessor, a microcontroller, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), a programmable logic device (PLD), a controller, a state machine, gated logic, a discrete hardware component, or any other suitable entity capable of performing calculations or other manipulations of information.

[0042] In addition to hardware, computer system 500 may include code that creates an execution environment for computer programs of interest, for example code constituting a processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of these, including memory 504 (such as memory 220), for example random access memory (RAM), flash memory, read only memory (ROM), programmable read only memory (PROM), erasable PROM (EPROM), registers, a hard disk, a removable disk, a CD-ROM, a DVD, or any other suitable storage device coupled to bus 508 for storing information and instructions executed by processor 502. Processor 502 and memory 504 may be supplemented by, or incorporated in, special purpose logic circuitry.

[0043] The instructions may be stored in memory 504 and implemented in one or more computer program products, e.g., in one or more modules of computer program instructions encoded on a computer-readable medium for execution by or to control the operation of computer system 500, and according to any manner known to those skilled in the art, including, but not limited to, computer languages ​​such as data-oriented languages ​​(e.g., SQL, dBase), system languages ​​(e.g., C, Objective-C, C++, Assembly), architecture languages ​​(e.g., Java, .NET), and application languages ​​(e.g., PHP, Ruby, Perl, Python). The instructions may also be implemented in a computer language such as an array language, an aspect-oriented language, an assembly language, an authoring language, a command line interface language, a compiled language, a concurrent language, a curly brace language, a data flow language, a data structure language, a declarative language, an esoteric language, an extensible language, a fourth generation language, a functional language, an interactive mode language, an interpreted language, an iterative language, a list-based language, a little language, a logic-based language, a machine language, a macro language, a metaprogramming language, a multi-paradigm language, numerical analysis, a non-English based language, an object-oriented class-based language, an object-oriented prototype-based language, an offside rule language, a procedural language, a reflective language, a rule-based language, a scripting language, a stack-based language, a synchronous language, a syntax processing language, a visual language, a worth language, and an xml-based language. The memory 504 may also be used to store temporary variables or other intermediate information during execution of instructions to be executed by the processor 502.

[0044] A computer program as discussed herein does not necessarily correspond to a file in a file system. A program can be stored as part of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., a file that stores one or more modules, subprograms, or portions of code). A computer program can be deployed to run on one computer or multiple computers located at one site or distributed across multiple sites and interconnected by a communications network. The processes and logic flows described herein can be performed by one or more programmable processors executing one or more computer programs to perform functions by manipulating input data and generating output.

[0045] The computer system 500 further includes a data storage device 506, such as a magnetic or optical disk, coupled to the bus 508 for storing information and instructions. The computer system 500 can be coupled to various devices via an input / output module 510. The input / output module 510 can be any input / output module. An exemplary input / output module 510 includes a data port, such as a USB port. The input / output module 510 is configured to connect to a communication module 512. An exemplary communication module 512 includes a networking interface card, such as an Ethernet card and a modem. In certain aspects, the input / output module 510 is configured to connect to multiple devices, such as input devices 514 and / or output devices 516. An exemplary input device 514 includes a keyboard and a pointing device, such as a mouse or trackball, by which a consumer can provide input to the computer system 500. Other types of input devices 514, such as a tactile input device, a visual input device, an audio input device, or a brain computer interface device, can also be used to provide interaction with a consumer. For example, feedback provided to the consumer can be any form of sensory feedback, e.g., visual, auditory, or tactile feedback, and input from the consumer can be received in any form, including acoustic, speech, tactile, or brainwave input. Exemplary output devices 516 include display devices, such as LCD (liquid crystal display) monitors for displaying information to the consumer.

[0046] According to one aspect of the disclosure, the headset and client device 110 may be implemented using computer system 500, at least in part, in response to processor 502 executing one or more sequences of one or more instructions contained in memory 504. Such instructions may be read into memory 504 from another machine-readable medium, such as data storage device 506. Execution of the sequences of instructions contained in main memory 504 causes processor 502 to perform the process steps described herein. One or more processors of a multi-processing arrangement may also be employed to execute the sequences of instructions contained in memory 504. In alternative aspects, hard-wired circuitry may be used in place of or in combination with software instructions to implement various aspects of the disclosure. Thus, aspects of the disclosure are not limited to any specific combination of hardware circuitry and software.

[0047] Various aspects of the subject matter described herein may be implemented in a computing system, or any combination of one or more such back-end, middleware, or front-end components, including a back-end component, e.g., a data server, including a middleware component, e.g., an application server, or a front-end component, e.g., a client computer having a graphical consumer interface or web browser through which a consumer can interact with an implementation of the subject matter described herein. The components of the system may be interconnected by any form or medium of digital data communication, e.g., a communication network. The communication network may include, for example, any one or more of a LAN, a WAN, the Internet, and the like. Furthermore, the communication network may include, for example, any one or more of the following network topologies, including, but not limited to, a bus network, a star network, a ring network, a mesh network, a star-bus network, a tree or hierarchical network, and the like. The communication module may be, for example, a modem or an Ethernet card.

[0048] Computer system 500 may include clients and servers. Clients and servers are generally remote from each other and typically interact through a communications network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. Computer system 500 may be, for example, but not limited to, a desktop computer, a laptop computer, or a tablet computer. Computer system 500 may also be embedded in another device, for example, but not limited to, a mobile phone, a PDA, a mobile audio player, a Global Positioning System (GPS) receiver, a video game console, and / or a television set-top box.

[0049] In one aspect, a method may be an operation, an instruction, or a function, and vice versa. In one aspect, a claim may be amended to include a term (e.g., an instruction, an operation, a function, or a component), one or more words, one or more sentences, one or more phrases, one or more paragraphs, and / or part or all of one or more claims recited in one or more other claims.

[0050] Many of the features and applications described above may be implemented as a software process specified as a set of instructions recorded on a computer-readable storage medium (alternatively referred to as a computer-readable medium, a machine-readable medium, or a machine-readable storage medium). When these instructions are executed by one or more processing units (e.g., one or more processors, processor cores, or other processing units), they cause the processing units to perform the actions indicated in the instructions. Examples of computer-readable media include, but are not limited to, RAM, ROM, read-only compact discs (CD-ROMs), recordable compact discs (CD-Rs), rewritable compact discs (CD-RWs), read-only digital versatile discs (e.g., DVD-ROMs, dual layer DVD-ROMs), various recordable / rewritable DVDs (e.g., DVD-RAMs, DVD-RWs, DVD+RWs, etc.), flash memory (e.g., SD cards, mini SD cards, micro SD cards, etc.), magnetic and / or solid state hard drives, ultra-high density optical disks, any other optical or magnetic media, and floppy disks. In one or more embodiments, the computer-readable medium does not include carrier waves and electronic signals that pass wirelessly or over a wired connection, or any other transitory signals. For example, the computer-readable medium may be entirely limited to tangible physical objects that store information in a form that is readable by a computer. In one or more embodiments, the computer-readable medium is a non-transitory computer-readable medium, a computer-readable storage medium, or a non-transitory computer-readable storage medium.

[0051] In one or more embodiments, a computer program product (also known as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted, declarative or procedural languages, and can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, object, or other unit suitable for use in a computing environment. A computer program may, but need not, correspond to a file in a file system. A program can be stored in part of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, subprograms, or portions of code). A computer program can be deployed to be executed on one computer or multiple computers located at one site or distributed across multiple sites and interconnected by a communication network.

[0052] While the above discussion primarily refers to microprocessors or multi-core processors executing software, one or more embodiments are performed by one or more integrated circuits, such as application specific integrated circuits (ASICs) or field programmable gate arrays (FPGAs). In one or more embodiments, such integrated circuits execute instructions stored on the circuit itself.

[0053] Those skilled in the art will appreciate that the various illustrative blocks, modules, elements, components, methods, and algorithms described herein may be implemented as electronic hardware, computer software, or a combination of both. To illustrate this interchangeability of hardware and software, the various illustrative blocks, modules, elements, components, methods, and algorithms have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends on the particular application and design constraints imposed on the overall system. Those skilled in the art may implement the described functionality in various ways for each particular application. The various components and blocks may be arranged in different ways (e.g., arranged in a different order or divided in a different way) without departing from the scope of the subject technology.

[0054] It is understood that any specific order or hierarchy of blocks in the disclosed processes is an illustration of an example approach. It is understood that the specific order or hierarchy of blocks in a process may be rearranged or that not all illustrated blocks are performed based on implementation preferences. Any of the blocks may be performed simultaneously. In one or more embodiments, multitasking and parallel processing may be advantageous. Furthermore, it should be understood that the separation of various system components of the embodiments described above does not require such separation in all embodiments, and that the program components and systems described may generally be integrated together in a single software product or packaged in multiple software products.

[0055] The subject technology is illustrated, for example, according to various aspects described above. This disclosure is provided to enable those skilled in the art to practice the various aspects described herein. This disclosure provides various examples of the subject technology, and the subject technology is not limited to these examples. Various modifications to these aspects will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other aspects.

[0056] Reference to an element in the singular is not intended to mean "one and only one" unless specifically stated, but rather "one or more." The term "several" refers to one or more, unless specifically stated otherwise. Masculine pronouns (e.g., his) include feminine and neuter (e.g., her and its), and vice versa. Headings and subheadings, if any, are used merely for convenience and are not intended to limit the invention.

[0057] The word "exemplary" is used herein to mean "serving as an example or illustration." Any aspect or design described herein as "exemplary" is not necessarily to be construed as preferred or advantageous over other aspects or designs. In one aspect, various alternative configurations and operations described herein may be considered at least equivalent.

[0058] As used herein, the phrase "at least one of" preceding a list of items is followed by the term "or" to separate any of the items and modifies the list as a whole, not each item in the list. The phrase "at least one of" does not require the selection of at least one of the items, rather the phrase allows for a meaning including any one of the items, and / or at least one of any combination of the items, and / or at least one of each of the items. By way of example, the phrase "at least one of A, B, or C" may refer to only A, only B, or only C, or any combination of A, B, and C.

[0059] The use of phrases such as "aspects" does not imply that such aspects are essential to the subject technology or that such aspects apply to all configurations of the subject technology. Disclosure regarding an aspect may apply to all configurations, or to one or more configurations. An aspect may provide one or more examples. A phrase such as an aspect may refer to one or more aspects, and vice versa. A phrase such as "embodiments" does not imply that such embodiments are essential to the subject technology or that such embodiments apply to all configurations of the subject technology. Disclosure regarding an embodiment may apply to all embodiments, or to one or more embodiments. An embodiment may provide one or more examples. A phrase such as an embodiment may refer to one or more embodiments, and vice versa. A phrase such as "configuration" does not imply that such configurations are essential to the subject technology or that such configurations apply to all configurations of the subject technology. Disclosure regarding a configuration may apply to all configurations, or to one or more configurations. A configuration may provide one or more examples. A phrase such as a configuration may refer to one or more configurations, and vice versa.

[0060] In one aspect, unless otherwise stated, all measurements, values, ratings, positions, dimensions, sizes, and other specifications set forth in this specification, including the following claims, are approximate and not precise, and in one aspect, they are intended to have a reasonable range consistent with what is customary in the art to which they pertain and the function to which they pertain.

[0061] It is understood that some or all of the steps, operations, or processes may be performed automatically without user intervention. The method claims may be provided to present the various steps, operations, or process elements in a sample order, and are not meant to be limited to the specific order or hierarchy presented.

[0062] All structural and functional equivalents to the elements of the various aspects described throughout this disclosure that are known or that later become known to those skilled in the art are expressly incorporated herein by reference and are intended to be encompassed by the included claims. Moreover, nothing disclosed herein is intended to be publicly exhibited, regardless of whether such disclosure is expressly recited in the claims. No element of a claim is to be construed under the provisions of 35 U.S.C. 112(f) unless the element is expressly recited using the phrase "means for" or, in the case of a method, unless the element is recited using the phrase "step for". Moreover, to the extent that terms such as "include", "have", and the like are used, such terms are intended to be inclusive in a manner similar to the term "compress", as "comprises" is interpreted when used as a transitional term in a claim.

[0063] The title, background, and brief description of the drawings of the present disclosure are incorporated into this disclosure and are provided as illustrative examples of the present disclosure, not as a limiting description. They are submitted with the understanding that they are not used to limit the claims or the spirit. In addition, it is understood that in the detailed description, the description provides illustrative examples, and that various features are grouped together in various embodiments to streamline the disclosure. The method of disclosure should not be interpreted as reflecting an intention that the included subject matter requires more features than are expressly recited in any claim. Rather, as the claims reflect, inventive subject matter lies in less than all features of a single disclosed structure or operation. The claims are incorporated into the detailed description, with each claim standing on its own as a separate claimable subject matter.

[0064] The claims are not intended to be limited to the embodiments described herein, but are to be accorded full scope consistent with the claim language and encompass all legal equivalents. Nonetheless, none of the claims are intended to cover subject matter that does not meet the requirements of 35 U.S.C. §§ 101, 102, or 103, and they should not be construed in such a manner.

Claims

1. 1. A computer-implemented method, comprising: requesting a block hash of a transaction at a client device, the block hash having a preselected complexity; constructing, via the client device, a virtual machine transaction that includes a public key and the block hash; generating a new block that includes one or more transactions above the preselected complexity.

2. 2. The computer-implemented method of claim 1, wherein requesting the block hash includes selecting a node in a blockchain network to compute the block hash.

3. 2. The computer-implemented method of claim 1, wherein requesting the block hash includes sampling a preselected number of recent blocks to find the block hash for the transaction.

4. 2. The computer-implemented method of claim 1, wherein requesting the block hash includes iteratively modifying a proof-of-work request threshold until the block hash has a complexity that exceeds the preselected complexity.

5. 2. The computer-implemented method of claim 1, wherein requesting the block hash includes modifying a proof-of-work request threshold when the block hash expires.

6. 2. The computer-implemented method of claim 1, wherein constructing a virtual machine transaction comprises storing the virtual machine transaction in a blockchain database.

7. 2. The computer-implemented method of claim 1, wherein constructing the virtual machine translation includes sorting the list of transactions in the blockchain database by a complexity of each virtual machine transaction.

8. 2. The computer-implemented method of claim 1, wherein generating new blocks comprises increasing the preselected complexity when a block generation rate exceeds a target rate.

9. 2. The computer-implemented method of claim 1, wherein generating new blocks comprises reducing the preselected complexity when a block generation rate is slower than a target rate.

10. 2. The computer-implemented method of claim 1, wherein generating a new block including one or more transactions includes verifying that a sum of differences between a complexity of the one or more transactions and the preselected complexity exceeds the preselected complexity.

11. 1. A system comprising: A memory for storing a plurality of instructions; one or more processors configured to execute the instructions to cause the system to perform a process, the process comprising: requesting, at a client device, a block hash of a transaction, the block hash having a preselected complexity; constructing, via the client device, a virtual machine transaction that includes a public key and the block hash; generating a new block that includes one or more transactions that exceed the preselected complexity; and and serially processing state transitions within the valid block.

12. 12. The system of claim 11, wherein to request the block hash, the one or more processors execute instructions to select a node within a blockchain network for computing the block hash.

13. 12. The system of claim 11, wherein to request the block hash, the one or more processors execute instructions to sample a preselected number of recent blocks to find the block hash of the transaction.

14. 12. The system of claim 11, wherein to request the block hash, the one or more processors execute instructions to iteratively modify a proof-of-work request threshold until the block hash has a complexity that exceeds the preselected complexity.

15. 12. The system of claim 11, wherein to request the block hash, the one or more processors execute instructions to modify a proof-of-work request threshold when the block hash expires.

16. A non-transitory computer-readable medium storing instructions that, when executed by one or more processors, cause a computer to perform a method, the method comprising: requesting a block hash of a transaction at a client device, the block hash having a preselected complexity; constructing, via the client device, a virtual machine transaction that includes a public key and the block hash; and generating a block including one or more transactions above the preselected complexity.

17. 20. The non-transitory computer-readable medium of claim 16, wherein requesting the block hash includes selecting a node in a blockchain network to compute the block hash.

18. 20. The non-transitory computer-readable medium of claim 16, wherein requesting the block hash includes sampling a preselected number of recent blocks to find the block hash for the transaction.

19. 20. The non-transitory computer-readable medium of claim 16, wherein requesting the block hash includes iteratively modifying a proof-of-work request threshold until the block hash has a complexity that exceeds the preselected complexity.

20. 20. The non-transitory computer-readable medium of claim 16, wherein requesting the block hash includes modifying a proof-of-work request threshold when the block hash expires.

Citation Information

Patent Citations

  • Block chain system and computer program with consensus building protocol using solution search for optimization problem

    JP2020188503A

  • Energized identity powered blockchain

    WO2020168389A1

  • Time-locked blockchain transactions and related blockchain technology

    WO2021059091A1