Method and system for synchronizing and controlling states in computer-implemented environment
By using random functions and hash chain key generation algorithms in computer environments to lock the data room, secure communication and data synchronization in multi-user and multi-region systems are realized, and the problem of difficult state consistency and security is difficult to control. In blockchain and other technical environments.
Patent Information
- Application Number
- CN202380036671.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2022-04-25
- Filing Date
- 2023-04-17
- Publication Date
- 2024-12-06
AI Technical Summary
In multi-user, multi-region computer systems, maintaining data state consistency and security is a challenge, especially in distributed networks and systems, where independent operation of users makes data synchronization and security difficult to control.
By introducing a computing-based system in a computer environment, using random functions and hash chain key generation algorithms to lock and unlock the data room, secure communication and data synchronization between actors are achieved, and bit promises ensure data consistency and Security.
It realizes secure communication and data synchronization between actors in multi-user and multi-region computer systems, ensures state consistency and enhances security, and is suitable for technical environments such as blockchain.
Smart Images

Figure CN119096531A_ABST
Abstract
Description
Technical Field
[0001] The present disclosure generally relates to methods and systems for enabling secure communications between multiple actors (e.g., users operating within a domain having zones). Such a domain may include a computer-implemented environment, including but not limited to a virtual machine (VM), an execution thread and / or process, or a network enclave, etc. Advantageously, embodiments of the present disclosure may be used to synchronize, monitor, and control the operations of actors within a zone, thereby providing a number of technical advantages, such as ensuring state consistency and enhancing security.
[0002] According to one or more embodiments, an actor may monitor the domain or a portion thereof, an actor may determine the presence of another actor, and may also contact and interact with the area. The domain and a portion thereof may represent real-world assets and / or digital assets. The assets may have functions and / or variables. Embodiments provide enhanced cryptographic security solutions for the processing of sensitive or secret data within the domain, and provide a platform and / or underlying mechanism that various technical implementations may utilize to their advantage. The present invention is particularly suitable for, but not limited to, use with blockchain-related technologies. Background Art
[0003] It is necessary to control and / or monitor the presence, actions, and associated data of users (actors) within a computer system to maintain state consistency and integrity of the data within the system. State consistency is critical in order to ensure that there is a version of reality that can be trusted by all users of the system. For example, with respect to graph databases and distributed systems, it is understandable that the actions of multiple users at different times may result in overlapping / conflicting results. Avoiding inconsistencies and ensuring synchronization of data and state is particularly challenging in distributed networks and systems because users typically act independently of each other when using and navigating the system and may come and go dynamically. In addition to reducing overlap, implementing and controlling record systems and methods for tracking changes to actors within the system may require or at least benefit from a permanent, immutable record of functions performed by or by an entity and changes to any variables. The present disclosure is intended to provide techniques that can at least mitigate or eliminate these technical challenges. Summary of the invention
[0004] The methods and systems herein generally support communication from at least one actor to all other actors in a given domain, and communication between two or more actors occupying the same space / region within the domain. Preferably, the domain and regions within the domain have functions and / or attributes. The methods disclosed herein may support monitoring and / or synchronization of functions performed by multiple actors in the same region and / or changes to attributes.
[0005] Consider an illustrative but non-limiting scenario in which multiple actors (e.g., users) are active in a computer-based system that includes multiple environments. These environments may include one or more of virtual machines (VMs), code segments, threads, processes, or "boxes," among others. In other examples, an environment may include or have access to a portion of a database or data storage resource or other resource. According to a preferred embodiment, such an environment may be modeled as a room, table, or other data structure. A room may be referred to as a "region" within a larger domain / system.
[0006] Preferably, one or more actors may be located in (i.e., active or belonging to / joining) a given environment or a portion thereof at a particular point in time, but a given actor may only be located in one room at any point in time. In some cases, an actor may be considered active or located within an environment when the actor wishes to perform operations such as accessing data and / or writing data to resources associated with the environment. In other examples, an actor may be considered to be in a room when the actor signals its presence to other actors. Actors may enter and exit rooms.
[0007] A "room" may include one or more computing resources. These resources may include hardware, software, and / or firmware. Therefore, each room may be able to receive and send communications, store data (status), provide data, etc. A room may include a controller that authorizes and / or specifies the functions associated with the room. A room and / or its controller may be subordinate to a domain / controller.
[0008] An actor may wish to perform certain functions and operations on the room it enters, such as writing data to a storage resource associated with the room. Therefore, other actors present in the same room need to be aware of the actor's presence. They may also need to know the data the actor wishes to generate and / or the actions he wishes to perform. Actors in a room may need to:
[0009] 1. Interact and engage with each other;
[0010] 2. Lock the data they wish to operate on to prevent inconsistencies;
[0011] 3. Interact with the resources associated with the room.
[0012] In a preferred embodiment, the n data rooms in the system can be described as {R0, R1, ... R n-1 Each data room in the system can generate a seed {r0,r1,…r n-1} to describe or define the random function. i In this case, the user can unlock and know Ri structure.
[0013] Preferably, the keys {K0, K1, ... K n-1} Lock each data room. These keys can be linked by using hash chains or key generation algorithms that allow subkeys to be derived from the master key. In a preferred embodiment, given a data room R i Users in can use the key K i Encrypt and send the transmission data. Preferably, the same data room R i All users in the i The key K i The data and resources in the data room can be viewed and / or accessed by the actors in the data room. i The state of the data room can be read by the actors in that data room, but not by anyone else.
[0014] The keys for a given data room can be updated over time or when a triggering event occurs (e.g., when a user changes a data room).
[0015] Preferably, a bit commit may be set and used for each data room, as described in more detail below. BRIEF DESCRIPTION OF THE DRAWINGS
[0016] To facilitate an understanding of the embodiments of the present disclosure and to show how such embodiments may be implemented, reference will now be made, by way of example only, to the accompanying drawings, in which:
[0017] Figure 1 is a schematic block diagram of a system for implementing a blockchain;
[0018] Figure 2 Some examples of transactions that may be recorded in a blockchain are schematically shown;
[0019] Figure 3A A schematic block diagram of a client implementation is shown;
[0020] Figure 3B It shows that Figure 3A A schematic model of an exemplary user interface represented by a client implementation of
[0021] Figure 4 A schematic block diagram of some node software for processing transactions is shown;
[0022] Figure 5 is a schematic block diagram representing domains, subdomains, regions, and sub-regions representing entities or locations in which operators communicate and work;
[0023] Figure 6 is a flow chart representing the communication between two operators. DETAILED DESCRIPTION
[0024] According to one aspect disclosed herein, a method and corresponding system for securely communicating or indicating the presence of a first actor / a first actor within a computing environment is provided, the computing environment being implemented as a component of a computer-based system / environment. Additionally or alternatively, the present disclosure may be described as providing an enhanced computer-implemented solution for broadcasting messages to actors (users) within a computer system or communicating between actors (users) to ensure collaboration and communication between the actors. An actor may be a person, a machine-based entity, or a computing entity, such as an oracle or a robot. The terms "actor," "operator," "user," or "entity" or "party" may be used interchangeably herein.
[0025] The term "presence" may be used to describe an actor's relationship to a domain and / or position / location within a domain. An actor may be "present" physically within a domain or a portion thereof. However, a virtual actor may not actually be present in a domain or a portion thereof, but may be "present" or have a "sense of presence" in a relevant manner. In other words, a virtual entity may be present within a domain by being operationally active or associated with a domain, and therefore being operable or currently active (e.g., in use or performing an action, or being active or inactive within the domain).
[0026] The term “presence” can be relational or visible and can therefore be applied to virtual entities, i.e., related to other actors when they are located in the same domain / region or close to each other.
[0027] Preferably, a domain comprises one area or multiple areas. An area may be defined as a part of a particular area, region or domain. One or more boundaries may be defined or calculated for a given area. An area may also be referred to as a "sub-area". An area may comprise one or more other (sub)areas, such that a domain may comprise a hierarchy of areas. For simplicity and ease of reference, the term "area" will be used. In the above examples, the term "room" is used. In the following examples, the term "area" is used instead.
[0028] Regions within a given domain may be associated with one or more attributes that relate to or determine the state of the region. For example, if the domain is a leisure center that includes sub-regions "gym", "swimming pool", and "dance studio", an attribute of the "swimming pool" sub-region may be "has showers", while an attribute of the "gym" may be "has treadmills". In the example of a virtual domain, the domain may be a gaming environment, where actors (players / avatars) may move between different rooms, levels, worlds, etc. (regions) within the virtual environment; consider another example involving a simulated environment such as a medical simulation or an aircraft simulator. In some examples, a region may be a virtual machine or a code segment running on a computer, or a database, etc.
[0029] Additionally or alternatively, a region may be associated with one or more functions or capabilities that can be performed by an actor associated with the region. For example, an actor actively associated with the "swimming pool" region of a leisure center may be able to perform a "start shower" action, or an actor actively associated with the "gym" may be able to perform a "change the speed of the treadmill" action. Players in a game may be able to move from one room to another in a building and pick up designated items in each room. Each region may be associated with a set of rules that govern how actors in the room operate and how they use any resources associated with the region. Preferably, the attributes associated with one or more regions in a domain and / or its regions may be predetermined by an administrator or controller, as these attributes cannot be changed by actors in the domain. Similarly, the functions associated with a region cannot be determined or changed by an actor. When an actor actively contacts a domain / region or is associated with a domain / region, the actor may be considered to be "active" in the domain or region. Each domain / region may have its own security / authentication requirements that actors must meet to become active members. This will be described in more detail below.
[0030] The methods and systems herein generally support communication from at least one actor to all other actors in a domain, and communication between two or more actors occupying the same area in the domain. The domain and areas within the domain have functions and / or attributes. The methods herein may support monitoring and / or synchronization of functions performed by multiple operators in the same area and / or changes to attributes. The system may be an application domain. An application domain may act as a mechanism or process, such as by enabling separation / isolation of executed software applications from each other.
[0031] A domain may be a logical or technical space / environment defined based on or according to an implementation of an embodiment of the present disclosure. In some preferred embodiments, a domain may model a real-world entity or location (e.g., a digitally represented building such as a shopping mall, manufacturing facility, or warehouse). A domain, its regions, any functions, and / or attributes may be represented by a computer-based recording system or database (e.g., a distributed database or blockchain ledger). Alternatively, a domain, its regions, any functions, and / or attributes may be in digital form, for example, an online game, a spreadsheet, or a graphical database may be represented. For example, a domain and / or region may be represented as a tokenized resource or entity. The functions of a domain and / or the region or each region may implement rules for determining operations.
[0032] Examples herein describe technical solutions that enable multiple actors to perform operations on or within a domain and / or regions of the domain. Operations may include at least one of controlling, influencing, or directing an entity within the system (e.g., an actor taking action on a domain or a portion thereof). The methods herein enable a domain to maintain state consistency by enabling actors to communicate securely and / or privately. In this way, actors in or near a region can collaborate to avoid overlap and support eventual consistency.
[0033] Furthermore, a control and / or recording system is disclosed for controlling and / or monitoring a system representing a domain (D) to track functions performed within the system and / or changes to variables of the zone, which may benefit from a permanent, immutable record of changes to variables of the zone and functions performed by an operator in the zone or by the zone. A zone may be a technical environment that comprises a part of a larger technical environment. In other words, a zone may be a child environment that forms a part or component of a system and / or a parent environment / larger environment.
[0034] As non-limiting examples, the methods herein may be applied to the following scenarios: two players in an online chess game; two data analysts wishing to update the same cell in a spreadsheet; two or more autonomous robots accessing the same storage location within a warehouse; a security system that sounds an alarm when two vehicles (e.g., airplanes) are in close proximity to each other; and determining the location of an electronic tag worn by a person relative to a specific area and / or another tag worn by another person within a building or complex of buildings having areas. When applied to determining the location of an electronic tag worn by a person, the method may support ensuring that criminals and / or parolees do not approach a victim's residence or prohibited locations such as a liquor store.
[0035] Synchronization - Overview
[0036] Figure 5Schematically shows multiple operators (actors) in a domain (D) n , marked as O A , O B , O C , O D , O E and O F The operator can be a user, or other types of actors such as humans, machine-based entities, or computational entities, such as an oracle or a robot. The domain includes subdomains sDn, which are labeled sD1, SD2, and SD3 in this example. The subdomain can have regions Zn labeled Z1 to Z5 as shown in the figure, and each region can have subregions sZ labeled sZ1 to SZ4 n A domain may also be occupied by parties that have read-only access or view-only access to the state and / or operation of the domain and its regions, referred to as viewers V1 to V4. Domain D is described only as an example and the present invention is not limited thereto. The number of subdomains, regions, and subregions will vary depending on the application and / or implementation of the present invention.
[0037] In the digital domain, regions can often be referred to as virtual rooms, spaces, data structures, or environments, using programs or data rooms {Z1, Z2, Z3…Z N-1}, they have functionality and / or contain variables. These virtual rooms can be objects in a program that model the entities to be controlled. Models have functionality implemented through methods, functions and procedures that can be called at runtime, and variables that provide static or dynamic state.
[0038] The sub-region can be represented by Z', the sub-sub-region by Z", and so on. N-1}Access / View Area.
[0039] Knowing z1, one can (i) "unlock" the zone to perform a function on or within the zone Z1, and (ii) read the contents of Z1. Each room has a corresponding "control" key {k1, k2, k3 ... k N-1}. Possession of a control key enables the holder to lock, unlock, modify, or encrypt a zone or a portion thereof.
[0040] In the following example, two actors O are mentioned. A and O B, nominally called Alice and Bob, who intend to perform functions in a region within the domain. In practice, Alice and Bob represent the first actor and the second actor, respectively. Although the examples in this article describe Alice and Bob as people who perform functions and interact with domain D, they are actors such as computing entities whose functions include providing at least one of communication, synchronization, verification, authentication, and security. For example, a region can represent a storage compartment in a warehouse, a location in a game (which can be a digital online location), or a cell in a spreadsheet. If Alice and Bob are located in the same region, or want to perform functions related to the region, then they can know each other's existence and / or collaborate. Similarly, to protect privacy, actors such as Alice and Bob do not have information about other actors, such as their location.
[0041] The term "region" is a general term used hereinafter to describe a divisible / defined portion of a domain D. In some embodiments, a region may be the smallest divisible area of a domain D, such as Figure 5 As shown in sZ1 in. Based on the teachings herein, it will be appreciated that the present invention can enable a first actor to determine the presence and / or absence of a second actor in a region, sub-region, sub-domain, or domain. The granularity and level of perception of "presence" or "absence" and similar "active" and "inactive" states can be configured according to the implementation.
[0042] Actors initially access domain D and / or a digital representation of the domain through a login or similar security process, during which the operator / actor is verified and / or authenticated depending on the implementation. Upon accessing the domain, each actor may be provided with their own tag that enables the domain and / or other actors to identify and / or address the actor. Tags are referred to herein as tags. For biological actors, tags may be physically worn or attached as an actor holding a tag. Tags may be configured based on the usage scenario and may reside in at least one of the following forms: a digital format, where the tag resides in a program running on a device with a memory storing the tag, used when communicating with other actors; hardware, where the device stores the tag in its memory and / or a radio frequency identification (RFID) device, and the device may be attached to a robot module or a wearable device (e.g., a wristband). The device and / or program holding the tag is configured to communicate with (i) the domain and any region therein and (ii) each actor within the domain. The tag assigned to an actor is unique to the actor. The tag may be dynamically assigned each time the actor enters the domain, or it may be static and thus remain at the actor. The tag may be an alphanumeric code, which may be represented in digital form or in physical form, such as a QR code. The tag may be a public address associated with a cryptographic key pair. The tag may be a public key value derived from a temporary private key. If the tag is connected to a biometric actor, the tag may be derived from or include, at least in part, biometric data.
[0043] Each of the domain D and the subdomains, regions and subregions has an identifier S A , the identifier S A Distinguishes domain D from other regions in the domain and enables actors to determine their location (i.e., region) in the domain.
[0044] The actor can only obtain the identifier S in the region A . As non-limiting examples, the identifier may be obtained by at least one of the following: reading a code displayed in the zone (e.g., a barcode), which may be read from a physical marker or digital display using a vision system; detecting a digital signal using radio frequency (e.g., RFID); the identifier may be obtained by Alice communicating with zone Z, whose function is to manage its own identifier and any updates thereto, and Alice may receive and store the identifier. The identifier for zone Z may be fixed or dynamic. If the identifier is dynamic, it may be modified, replaced, or updated in other ways. The update trigger may be at least one of the following: a period of time; an event or condition being met, such as a new actor entering the zone; an actor leaving the zone; or when the zone is vacated. In other examples, a controller such as a domain or zone manager may initiate an update.
[0045] Regions Z within a domain or subdomain sD can be nested. For example, Figure 5 The example shows a sub-region sZ1, which is co-located with three other sub-regions in region Z1, which co-exists with two other regions in sub-domain sD1, which co-exists with two other sub-domains in domain D. For example, a cell of a table in a spreadsheet (e.g., Excel (RTM)) can be part of a row or column, and the table can be one of multiple tabs within a particular file. Similarly, a storage location within a warehouse can be located in a sub-region within the warehouse, on a specific row on a specific level. A region can be configured with multiple identifiers, including: an identifier S that distinguishes it from other regions in a domain A ; and at least one other identifier that identifies the location relationship of the region to other regions. In other words, the other identifier may indicate the identity of at least one of the following: adjacent regions, e.g., sZ1 is next to sZ2; the region, e.g., sZ1 is within Z1; and the subdomain, e.g., sZ1 is within sD1. Regions that inform actors of their relative location within a domain allow actors to determine who is in the same region and who is an adjacent region.
[0046] The control system of domain D can determine the positional relationships of all actors, such as the relative proximity of at least one actor to another actor, which may be important if actors are prohibited from being in the same area, or within a predetermined proximity of another actor.
[0047] The control system may perform at least one of the following operations: monitoring and / or observing actions taken by actors; monitoring and / or observing functions or operations performed by regions; collating acquired data to allow viewers V N Capable of read-only access or view-only access to the status and / or operation of a domain and its zones. View-only access can be domain-wide access, e.g. Figure 5 Viewer V1 and V2 in sZ1, or local access, such as viewer V3. When the function provided by the domain is a forum supporting online games, for example, Alice and Bob in sZ1 are playing a chess game, view-only access can be allowed.
[0048] Each of the domain D and the partitions (e.g., subdomain sD, region Z, and subregion sZ) has the functions and / or attributes required to implement the present invention. Region Z can be represented in digital form as a program that runs on a machine with a processor and associated memory. The machine can be locally configured to the region, or remotely centrally controlled at a location such as a control center of domain D. In one example, a region can be a storage location within a warehouse, and an identification of the region is displayed, which can be read by a robot configured to add items to the storage location or remove items from the storage location. In another example, a region can represent an online game such as chess, in which the program not only provides the identification of the region, but also controls the rules or protocols of the game, as well as a list of chess pieces and their positions in the game.
[0049] Synchronization-Communication
[0050] In the context, Alice enters a domain with multiple areas. Alice can be a robot that enters a warehouse and operates therein, and is configured to place items in or take items out of a storage location. Alternatively, Alice can be a person wearing a tag that serves as a mobile communication device, such as a smart tag such as a smart watch. Further alternatively, Alice can be a player in an online chess game, and she enters the game through a user interface (UI) 500 or the like. Regardless of whether Alice enters a physical space or a digital domain, for example, for security reasons, she cannot know who is in the domain or who she can communicate with before establishing contact. In addition, if Alice is a robot and wants to modify the inventory of a storage location, she must collaborate with any other robot that intends to do the same thing.
[0051] If another actor (e.g., Bob) exists in the same zone, Alice must commit to the actions she performs in order to synchronize the state of zone Z and prohibit overlapping actions and / or fraud. Synchronization is particularly important, for example, when Alice and Bob are playing an online game (e.g., chess or poker) and need to determine the actions taken. The examples in this article enable actors to perform their functions and interact in a trustless system. Inconsistencies in data and state within the system are also avoided.
[0052] For example, Figure 6 The multiple steps of providing (broadcasting) the presence of a first actor, in this case "Alice" (O A ), which resides in a Figure 5 In one example, Alice resides on a server with identifier Z. AsZ1. It should be noted that these steps describe Alice or Bob performing the actions. However, in reality, Alice and / or Bob may be computer-based resources such that the steps may be performed by an operating system, host, program or device that performs the steps and functions. This enables the actions to be performed automatically. It should be noted that a domain or a portion thereof may be a software-implemented entity that may be implemented in hardware and / or executed as an application.
[0053] In s608, Alice creates a random bit string (e.g., generates a temporary key) to establish the secret S X In addition, Alice obtains the identifier Z associated with the zone A The value may be obtained from the zone itself. In some examples, the identifier may be data obtained using a physical device, such as a QR code or barcode that can be read from at least one of a fixed display, a digital display, or an RFID. In other embodiments, the identifier may be stored, requested, accessed, and received electronically rather than by physical capture using a scanner, camera, or the like. Additionally or alternatively, the identifier may be obtained by Alice communicating with zone Z, retrieving, and storing the identifier.
[0054] In s610, use her secret S X To establish a commitment. For example, Alice's secret (h(S X )) Perform a hash operation to generate the value H(S X ). Alice can send this value to all actors in domain D via each zone Z in the domain.
[0055] In s612, Bob, who happens to be in the same zone Z as Alice, receives and stores Alice's commitment. Bob is in the same zone as Alice and thus obtains the same identifier Z from that zone. A .
[0056] At s614, Alice prepares and broadcasts at least one transmission to all actors in the domain and / or to all zones Z in the domain. Each actor receives the transmission directly from Alice and / or through zone Z. The function of the transmission is to communicate, such as by sending information via a message or data packet, the information containing data that enables Bob to determine Alice's presence relative to zone Z. Using this information, such as the data in the transmission from Alice, Bob is able to compare the data with the data of the zone. This data may include the zone identifier Z A or its derivatives. When Bob is in the same partition of domain D, i.e., in the same region as Alice, and has access to the same region identifier (e.g., Z A ), it is determined that he is in the same area as Alice.
[0057] Additionally or alternatively, the data in Alice's transmission includes an identifier of any divisible portion of domain D. In this way, the identifier can indicate to another actor in which part of the domain they are present, so that the granularity and level of awareness of presence or absence can be configured according to the implementation. Figure 5 For example, when Alice O A While residing in sZ1, she may send a transmission including data indicating her presence in sZ1, Z1, and sD1. The transmission may include an identifier for each of sZ1, Z1, and sD1, or three separate transmissions may be made for each of the corresponding regions. F (Frankie) resides in subdomain sD1, to which Alice broadcasts at least one transmission indicating her presence (indicating her presence in each of sZ1, Z1, and sD1). The data in this transmission only enables Frankie to determine only that Alice resides in the same subdomain, but not the region or subregion she occupies.
[0058] In s616, Bob, or indeed Frankie, determines Alice's presence in the same partition by reading the transmission. They can reply with verification, which they can provide because they have access to the same identifier of the partition they are in. To be clear, the transmission sent by Alice enables Bob to confirm Alice's presence and / or absence in the partition, and Bob can send a reply verifying his own location in the domain.
[0059] In s618, Alice receives Bob's verification. Then, in S620, Alice can provide her own secret S X As proof of the earlier commitment, Bob can verify this in S622.
[0060] Of course, Bob can repeat the same steps as Alice so that they can both make a transmission that enables the other to determine their presence. Different zone configurations have different features that determine the rules or protocols that actors must follow.
[0061] exist Figure 6 In the example, Alice's data in the transmission enables people residing in the partition to determine her presence. Alice uses the identifier as her secret S X Establish a commitment within the transmitted data, i.e., the secret S X =Identifier Z A .like Figure 6As shown, in s610, Alice sends a commitment to Bob using her secret. In step s614, Alice creates a transmission that includes data that only Bob or another actor in the same partition as Alice can use to determine Alice's presence. Since Bob also knows the identifier, he can determine Alice's presence.
[0062] exist Figure 6 In the example of FIG. 1 , at least two different transmissions are performed: one transmission includes data of an identifier (S X ,Z A ) and the binary value "1", that is, S X |1, is (i) transmitted to all actors in the domain, and (ii) sent to at least one of the regions where Alice is located; at least one other transmission includes the identifier (S X ,Z A ) and the binary value "0", that is, S X |0, is (i) transmitted to all actors in the domain, and (ii) sent to at least one region in which Alice is not present. X The concatenated binary values may be referred to as indicators.
[0063] The concatenated values of the identifier and the indicator are used to create a commitment which forms part of the data in transmission s614, in this example a hash value of the concatenation, such as h(S X |1) and h(S X |0). Each of the other actors, including Bob, can respond by sending a corresponding reply (e.g., H(S X |1) and H(S X |0)) to confirm her location, as shown in step S616. Alice can check the reply (for example, H(S X |1) and H(S X |0)), and then in s620, change S X Sent to Bob so that he can verify in s622 the earlier commitment made by Alice in s610.
[0064] Using at least a second transmission indicating that Alice is not in the area prevents Alice or other actors from revealing their location to anyone outside the same area.
[0065] exist Figure 6 In the example, the identifier S XConcatenated with a binary value indicator. For example, an alternative to concatenating the identifier and the indicator may be an XOR operation. Furthermore, the indicator is not limited to non-binary values. For example, an identifier of a zone may be concatenated with an indicator that informs a recipient of at least one of an access level, presence, and / or intent of the first actor associated with at least one of a zone (Z), a domain (D), a subdomain (sD), and a subzone (sZ).
[0066] In general, the at least one transmission and / or the second transmission includes an operation on an identifier and an indicator, for example, the identifier and indicator are cascaded hashes, i.e., h(R1|p) and / or h(R1|q), where h represents the hash function applied to the transmission, R1 is an identifier of the region (Z), domain (D), subdomain (sD) or subregion (sZ) in which the first actor is located, |p and |q are indicators cascaded with the region identifier, which provides additional information to the other actor, informing the recipient of at least one of the first actor's access level, presence and / or purpose associated with the region.
[0067] As described above, the identifier may be unique to each partition (eg, zone (Z), subdomain (sD), and subzone (sZ)) and may be generated by the functional area. The identifier may be derived from a master key and / or updated at predetermined intervals.
[0068] Domain - Example Implementation
[0069] The examples herein apply to a domain (D) having partitions, for example, each having its own functionality and / or operating according to its own rules or protocols. A domain or a portion thereof may be at least one of the following: a physical entity represented by spatial data or geospatial data, such as a warehouse; may be represented as a virtual area in a virtual domain, such as a digital representation of a warehouse and / or its contents; may be represented as an entry in a database or data table, for example, where a location in a warehouse may be recorded by an entry on a spreadsheet. The examples herein are provided to illustrate the functionality of the systems and methods taught herein, and the claimed invention is not limited thereto.
[0070] In the example where Alice and Bob are robots storing or collecting items to or from a partition (e.g. a location within a warehouse), the or each robot must determine whether the item is alone in the location before modifying the quantity of the item. Figure 6, Alice can create a commitment s608 and / or broadcast transmission s614, where data is exchanged securely so that only robots present in the same location are aware of Alice's presence. Other robots (e.g., Bob) perform the same actions to determine that Alice exists. Afterwards, each robot can communicate and commit to adding items to or removing items from the location to prevent any errors in inventory counting. For example, the functionality of a location can be represented as a program that controls tokenized resources. Alice and Bob can establish secure communications between them and / or between other robots used to modify the inventory in the location. Additionally or alternatively, an actor can establish a secure communication channel with the program to interact with the inventory in the location.
[0071] In the example of Alice and Bob playing a chess game, the domain could be the online gaming platform that Alice and Bob subscribe to. Figure 5 , they are assigned to a board in partition sZ1, where the game is controlled by a program. The program can record the game by updating the state of the tokenized resource. Any actor accessing the platform can watch the game, or a group of games in a larger partition, for example, a viewer V3 in zone Z1 can watch four games, namely the games in the zones labeled sZ1 to sZ4. The program can be obtained by obtaining the seeds {z1,z2,z3…z N-1 Only those who participate in the game have the authority to unlock the area to perform functions such as moving chess pieces, and the authority is obtained by obtaining the corresponding "control" key {k1, k2, k3...k N-1} provided. Although Alice and Bob have accessed the gaming platform and chosen to play a game of chess, they are unaware of each other's existence. Using one or more of the steps described herein, Alice and Bob can perform at least one of the following operations: determine the presence of other players, such as enabling one player to know that the other player is still playing; exchange commitments, such as determining that a move has been made and completed; use identifiers for regions, etc. to establish new shared secrets, which enables players to communicate securely without exchanging private keys, as described in WO2017 / 145016, the entire contents of which are incorporated herein by reference. The program controlling the game and / or Alice and Bob can interact with a token that represents the game and records board statistics and move history in one or more transactions.
[0072] An analogy can be drawn between the game of chess and controlling a spreadsheet or other database with collated data or values (e.g., a cell of an Excel (RTM) spreadsheet that can hold a value entered directly or derived from a formula based on values in other cells). The actors again access a domain such as a database, and using one or more of the steps described herein, Alice and Bob perform at least one of the following operations: determine the presence of the other, such as to enable the actor to know whether the other actor intends to modify the contents of the call; exchange commitments, such as to determine that changes made to the values of cells and / or formulas will not overlap and cause errors; establish a new shared secret using an identifier for the cell, etc., which may be required if the purpose of the change is confidential and must remain secure.
[0073] In yet another non-limiting example, the domain may be one of a school, a prison, or a leisure center, and the actors wear tags, such as their personal smart watches. The tag or smart watch is an electronic device configured to be used alone or in combination with a domain control system to implement the methods herein. The domain may be implemented within any range (e.g., a road network or a city). The tags may operate autonomously to implement the methods herein, for example, at least determining which other actors are located in the same area and / or proximity. The tags may issue an audible warning and / or a tactile warning when, for example, the actor is not allowed to enter the area, and / or the tag determines that the first actor and another actor are prohibited from existing by a restraining order. The tags may determine which functions the actor may collaborate with another actor and / or perform within the area.
[0074] The domain may include a control system that can monitor and determine at least one of the following: the number of actors in a given area; and the relative proximity between actors. For example, the control system may take at least one of the following actions: warn actors that there are too many actors in a segmented area (e.g., a zone) by communicating with tags and / or through the zone; restrict access by preventing entry through an electronic security gate, etc.
[0075] As described above, functions and / or variables of a zone may be controlled using tokenized resources (e.g., UTXOs residing on a blockchain). A domain and zones therein may be controlled by at least one program running on a machine to enable an actor to determine the presence or absence and relative proximity of another actor. The or each program may be implemented on at least one of the distributed data structures and configured on a distributed ledger (e.g., a blockchain ledger).
[0076] Domain-Security Enhancement
[0077] The use of shared secrets to establish secure communications between actors is described above in conjunction with WO2017 / 145016. It should be noted that the transmission can be further enhanced by passing a secret as disclosed in WO2019 / 220298, the entire contents of which are incorporated herein by reference.
[0078] in conclusion
[0079] Other variations or uses of the disclosed technology may become apparent to those skilled in the art once given the disclosure herein.The scope of the present disclosure is not limited by the described embodiments but only by the appended claims.
[0080] For example, some of the embodiments above have been described in terms of the Bitcoin network 106, the Bitcoin blockchain 150, and the Bitcoin node 104. However, it should be understood that the Bitcoin blockchain is a specific example of a blockchain 150, and the above description can generally be applied to any blockchain. That is, the present invention is by no means limited to the Bitcoin blockchain. More generally, any references to the Bitcoin network 106, the Bitcoin blockchain 150, and the Bitcoin node 104 above can be replaced with reference to the blockchain network 106, the blockchain 150, and the blockchain node 104, respectively. Blockchains, blockchain networks, and / or blockchain nodes may share some or all of the characteristics of the Bitcoin blockchain 150, the Bitcoin network 106, and the Bitcoin node 104 described above.
[0081] In a preferred embodiment of the present invention, the blockchain network 106 is a Bitcoin network, and the Bitcoin node 104 performs at least all of the functions described in creating, publishing, propagating and storing blocks 151 of the blockchain 150. It is not excluded that there may be other network entities (or network elements) that perform only one or some of these functions but not all of them. That is, a network entity may perform the functions of propagating and / or storing blocks without creating and publishing blocks (remember that these entities are not considered to be nodes of the preferred Bitcoin network 106).
[0082] In other embodiments of the present invention, the blockchain network 106 may not be a Bitcoin network. In these embodiments, it is not excluded that the node can perform at least one or part of the functions of creating, publishing, propagating and storing blocks 151 of the blockchain 150, but not all of the functions. For example, on these other blockchain networks, "node" may be used to refer to a network entity that is configured to create and publish blocks 151 but does not store and / or propagate these blocks 151 to other nodes.
[0083] Even more generally, any reference above to the term "Bitcoin node" 104 may be replaced with the term "network entity" or "network element," where such entity / element is configured to perform some or all of the roles in creating, publishing, propagating, and storing blocks. The functionality of such a network entity / element may be implemented in hardware in the same manner as described above with reference to blockchain node 104.
[0084] It should be understood that the above embodiments are described by way of example only. In more general terms, a method, apparatus or program may be provided according to any one or more of the following statements.
[0085] The present invention generally relates to a computer-implemented method for encrypting or decrypting data or a portion thereof using blockchain content. The content can be customized, i.e., a unique parameter or reference. The content is used as an input to the encryption or decryption process.
[0086] List the terms
[0087] It should be understood that the above embodiments are described by way of example only. In more general terms, a method, apparatus or procedure may be provided in accordance with any one or more of the following clauses, or substantially as described / illustrated herein.
[0088] A region may also be referred to as a "data structure" or "environment". A region may be similar to a room in a larger structure. Actors may be referred to as users or operators. A domain may be referred to as a computing system and may include one or more of physical, virtual software and / or firmware based resources (e.g., network architecture, virtual machines, code segments, etc.). In some examples, a room may be provided using an execution thread, process, or instance running on a processor.
[0089] In one or more embodiments: an actor may be a subscriber to an IPv6 multicast group; an actor may "enter" or "leave" a zone by subscribing / unsubscribing to an IPv6 multicast group.
[0090] These terms generally involve broadcasting the presence of a first actor (O1) within a zone (Z) of a domain (D), or their proximity to the zone (Z), where the domain (D) comprises a plurality of zones (Z). The terms "presence" and "proximity" may be used to describe an actor's relationship to a domain and / or position / orientation relative to a domain. In physical form, an actor may "exist" within a domain or a portion thereof, or be close to the domain or a portion thereof. However, a virtual entity may not actually exist in or near a domain or a portion thereof, but may be close, "exist" or have a "sense of presence" by being associated with the domain or a portion thereof. In other words, a virtual entity may exist within a domain by being associated, and therefore being operational or currently active (e.g., in use). The terms "presence" and "proximity" may be associated or visible / visible, and may therefore be applied to virtual entities, i.e., associated with other actors when they are located in the same domain / zone.
[0091] The teachings herein may be applied to real-world scenarios or situations or representations thereof, where a first actor (user) is able to make another (i.e., at least one other) actor aware of their presence or relevance, such as that they are operable or currently active (e.g., in use in an area). Additionally or alternatively, "relevance" may include interpretations of "associated with," "desire to operate or be active within," and / or "need to interact with." The at least one other actor may determine the presence, proximity, or status of the first actor by being located in the same area or close to the area. The at least one other actor may need to be present or relevant to determine the proximity or status of the first actor. The at least one other actor may be limited to determining that the other actor is not present.
[0092] In exemplary terms, the first actor (O1) may be Alice and / or the at least one other actor may be Bob, or an actor authorized by Alice / Bob to act on their behalf.
[0093] Clause 1: In one aspect, a computer-implemented method is provided, the method comprising the steps of broadcasting, indicating or otherwise providing the presence of a first actor (O1) within a zone (Z) of a domain (D), wherein the domain (D) comprises a plurality of zones (Z). The broadcasting step may be performed by the first actor (O1). The first actor may send, indicate or otherwise provide data to at least one other (i.e., at least one other) actor (O2) within the domain, the data enabling the at least one other actor (O2) to determine the proximity of the first actor relative to the zone (Z).
[0094] The first actor may send, instruct or otherwise provide data to the at least one other actor by sending at least one transmission including the data or by means for computing / obtaining the data.
[0095] The data may include a secret. The secret may be or include an identifier. The secret / identifier may be or include a key or a means for generating a key. The key may be an encryption key. The secret / key / identifier may be derived from a master secret / key / identifier or otherwise obtained using a master secret / key / identifier.
[0096] According to additional or alternative wording, there may be provided a computer-implemented method comprising the steps of:
[0097] A first actor (O1) sends data to at least another actor, the data enabling the at least another actor (O2) to determine the proximity of the first actor relative to a zone (Z) within a domain. Determining the proximity of the first actor to the zone may include determining that the first actor is present within the zone and / or absent from the zone. "Presence" may include physical presence or virtual presence, depending on the application. For example, virtual presence may include the first actor's activity status, membership, or association with the zone.
[0098] The domain may be a network, and may be used to define or be defined by an environment or domain such as a warehouse. A region may be an asset within the domain, and may be used to define or be defined by a sub-environment or sub-domain. A region may be a component of a domain.
[0099] The first actor may make its presence known by at least one transmission, the transmission being sent to at least one other actor (O2) within the domain. The transmission may be at least one of a communication, a message, and a data packet. The at least one other actor may be limited to determining the absence of the other actor based on data in the transmission.
[0100] Thus, in some embodiments, the present disclosure may enable an actor to monitor the domain or a portion thereof, and / or enable multiple actors to determine the presence of other actors, engage with and interact with them in the current area in which they are located (i.e., present). The domain and a portion thereof may represent real-world assets and / or digital assets. The assets may have functions and / or variables. Embodiments provide enhanced cryptographic security solutions for the processing of sensitive or secret data within a domain, and provide a platform and / or underlying mechanisms that various technical implementations may take advantage of.
[0101] Clause 2: The first actor (O1) may also send at least one other transmission (also referred to as at least one additional transmission), the at least one other transmission containing data enabling the at least one other actor (O2) to determine the proximity of the first actor to the region (Z) in the domain (X).
[0102] For example, the data enabling the determination of the presence of the first actor may be associated with an area (e.g., a location). Thus, only other actors with access to the same data can verify the presence of the first actor. For example, the data may include an identifier for a hotel room. The data may also include data indicating the floor or wing, etc., where the first actor is located. In this way, only other actors located on the same floor, wing, or room can determine the presence of the first actor in an area such as the same room and / or proximity to an area such as the same wing or the same floor of the hotel.
[0103] Clause 3: The first actor may send the at least one transmission and / or the at least one further transmission to all actors in the domain (D).
[0104] By sending information to all other actors and all other actors performing the same action, the first actor can determine the presence and / or proximity of all other actors in the region and / or domain. Thus, the actions performed by an actor can take into account the actions performed by others on the same region or assets therein. Thus, when multiple users' actions may occur at different times, actors are able to synchronize their actions, thereby preventing overlapping / conflicting results, thereby supporting eventual consistency of domains and regions therein.
[0105] Clause 4: The domain (D) further comprises at least one of a subdomain (sD) and a subzone (sZ).
[0106] Clause 5: The at least one of the zone (Z), the domain (D), the sub-domain (sD) and the sub-zone (sZ) comprises an identifier.
[0107] Clause 6: The identifier may be at least one of the following:
[0108] is unique to each of the zone (Z), the domain (D), the subdomain (sD), and the subzone (sZ);
[0109] Derived from the master key;
[0110] included in said at least one transmission and / or said at least one other transmission;
[0111] Updates are made at scheduled intervals;
[0112] generated by at least one of the zone (Z), the domain (D), the subdomain (sD) and the subzone (sZ);
[0113] In some exemplary embodiments, this may be performed at predetermined time intervals (e.g., every hour), or when specified conditions are met (e.g., if more than 5 actors are present in the area), or when a triggering event is performed (e.g., an administrator or other controller has initiated an update).
[0114] The identifier may be generated by at least one of the zone (Z), the domain (D), the sub-domain (sD) and the sub-zone (sZ).
[0115] The identifiers can be used to enable actors to determine their presence. Additionally or alternatively, the identifiers provide a unique and updateable way for actors within a domain / region to transmit dynamic changes in their presence. For example, each actor within a domain / region that operates and / or moves between regions of the domain can transmit data indicating its presence each time it changes regions within the domain, and / or transmit data periodically. In the case where all actors transmit data, the presence of all actors can be dynamically determined and / or monitored. In other words, the movement and / or operation of actors can be continuously tracked and recorded.
[0116] Clause 7: The at least one transmission and / or the at least one further transmission may comprise: a promise to identify the presence and / or absence of the first actor; and / or a promise to perform a function in the area and / or modify a characteristic (attribute) of the area.
[0117] The transmitted data may be used to communicate messages, such as instructions for a planned action, in a secure manner. Commitments may be used to establish a shared secret between two or more actors that are aware of each other's existence.
[0118] Clause 8: The at least one transmission and / or the at least another transmission may contain or otherwise include an indicator, wherein the indicator informs the recipient of at least one of the access level, existence and / or purpose of the first actor associated with at least one of the zone (Z), the domain (D), the subdomain (sD) and the subzone (sZ).
[0119] Additionally or alternatively, in addition to communicating its presence, the data transmitted by the first actor may be used to determine a hierarchy or sequence of actions taken within the area of the domain.
[0120] Clause 9: The at least one transmission and / or the further transmission may include h(R1|p) and / or h(R1|q), wherein:
[0121] h represents a hash function applied to the at least one transmission and / or the at least one other transmission;
[0122] R1 is the identifier of the zone (Z), the domain (D), the subdomain (sD) or the subzone (sZ) in which the first actor is located;
[0123] |p and |q are indicators concatenated with the zone identifier, the indicators informing the recipient of at least one of the first actor's access level, presence and / or purpose with respect to the zone.
[0124] Clause 10: The zone (Z), the domain (D), the subdomain (sD) or the sub-region (sZ) is at least one of the following: a physical entity represented by spatial data or geospatial data; can be represented as a virtual area in a virtual domain; and can be represented as an entry in a database or data table.
[0125] Clause 11: The zone (Z), the domain (D), the sub-domain (sD) or the sub-zone (sZ) may include: functions and / or variables; and / or be controlled by a program representing the zone.
[0126] Clause 12: The domain (D) may be at least one data structure in a distributed data structure and / or configured on a distributed ledger.
[0127] Clause 13: The method may further comprise at least one of the following steps: contacting and / or communicating with another actor; protecting the area; and modifying the variable of the area.
[0128] After determining that another actor exists in the region, the first actor may communicate with the other actor to establish secure communication between them and / or with the region. Additionally or alternatively, an actor present in the region may communicate to modify a state or variable of the region.
[0129] Clause 14: The operations of each region and / or said domain and / or said variables may be at least partially recorded on at least one of a database and a blockchain ledger.
[0130] Clause 15: The method may further comprise: receiving a reply transmission from the at least one other actor (O2) within the domain, the reply transmission enabling the first actor to determine the presence and / or absence of the at least one other actor.
[0131] Clause 16: The method may further comprise: broadcasting a commitment to all actors in the domain (D), the commitment indicating that the first actor (O n)'s identity; upon determining that the at least another actor (O2) exists, providing proof of the commitment; and establishing secure communication with the at least another actor.
[0132] Clause 17: In another aspect, a computer-implemented method comprises: controlling and / or monitoring a system, wherein the system represents a domain (D), the domain (D) comprising a plurality of zones (Z); receiving an indication of a first actor ( n ) broadcast of a transmission present within a zone (Z) of a domain (D) comprising a plurality of zones (Z); receiving data from said domain and / or said zone enabling said system to determine the presence and / or absence of another actor relative to said zone (Z).
[0133] Clause 18: At least one of the multiple regions may be implemented using tokenized resources.
[0134] On the other hand, there is a computer device, which includes: a memory, the memory including one or more memory units; and a processing device, the processing device including one or more processing units, wherein the memory stores a code configured to be executed on the processing device, and the code is configured to perform the claimed method when executed on the processing device.
[0135] In another aspect, there is a computer program embodied on a computer readable memory and configured to, when run on one or more processors, perform the claimed method.
[0136] Blockchain-Related Background
[0137] Specific reference Figures 1 to 4 The following content is provided by providing background information about the technology implemented by blockchain, which can provide an implementation environment for certain embodiments of the present disclosure.
[0138] Blockchain refers to a distributed data structure in which a copy of the blockchain is maintained at each of a plurality of nodes in a distributed peer-to-peer (P2P) network (hereinafter referred to as a "blockchain network") and is widely disclosed. The blockchain includes a series of data blocks, each of which includes one or more transactions. Except for the so-called "coinbase transaction", each transaction points to a previous transaction in a sequence, which can span one or more blocks back to one or more coinbase transactions. The coinbase transaction will be discussed further below. Transactions submitted to the blockchain network are included in new blocks. The process of creating a new block is generally referred to as "mining", which involves each of a plurality of nodes competing to perform "proof of work", i.e., solving a cryptographic puzzle based on a representation of a defined set of ordered and verified valid pending transactions waiting to be included in a new block of the blockchain. It should be noted that the blockchain can be pruned at some nodes, and the publication of blocks can be achieved by publishing only the block header.
[0139] Transactions in a blockchain can be used for one or more of the following purposes: transferring digital assets (i.e., a certain number of digital tokens); sorting a set of entries in a virtualized ledger or registry; receiving and processing time-stamped entries; and / or sorting index pointers by time. Blockchains can also be used to implement hierarchical additional functions on blockchains. For example, a blockchain protocol may allow additional user data or data indexes to be stored in a transaction. There is no pre-specified limit on the maximum data capacity that can be stored in a single transaction, so increasingly complex data can be incorporated. For example, this can be used to store electronic documents, audio, or video data in a blockchain.
[0140] The nodes of the blockchain network (commonly referred to as "miners") perform a distributed transaction registration and verification process, which will be described in more detail later. In summary, in this process, nodes verify transactions and insert them into block templates, which attempt to identify a valid proof-of-work solution for the block template. Once a valid solution is found, the new block is propagated to other nodes of the network, so that each node can record the new block on the blockchain. In order to record a transaction in the blockchain, a user (e.g., a blockchain client application) sends the transaction to one of the nodes in the network for propagation. The nodes receiving the transaction can compete to find a proof-of-work solution that incorporates the verified valid transaction into the new block. Each node is configured to execute the same node protocol, which will include one or more conditions for confirming that the transaction is valid. Invalid transactions will not be propagated or incorporated into the block. Assuming that the transaction has been verified to be valid and thus accepted on the blockchain, the transaction (including any user data) will therefore be registered and indexed as an immutable public record on each node in the blockchain network.
[0141] The node that successfully solves the proof-of-work puzzle to create the latest block is usually rewarded with a new transaction called a "coinbase transaction" that distributes the amount of digital assets, i.e. the number of tokens. The detection and rejection of invalid transactions is performed by the actions of competing nodes, which act as agents of the network and are incentivized to report and prevent improper behavior. The widespread publication of information allows users to continuously audit the performance of nodes. Publishing only block headers allows participants to ensure the continued integrity of the blockchain.
[0142] In the "output-based" model (sometimes referred to as the UTXO-based model), the data structure of a given transaction includes one or more inputs and one or more outputs. Any spendable output includes an element that specifies the amount of a digital asset, which can be derived from the ongoing sequence of transactions. Spendable outputs are sometimes called UTXOs ("unspent transaction outputs"). Outputs may also include a locking script that specifies future redemption conditions for the output. A locking script is a predicate that defines the conditions necessary to verify and transfer a digital token or asset. Each input of a transaction (except for a coinbase transaction) includes a pointer (i.e., a reference) to such an output in a previous transaction, and may also include an unlocking script for unlocking the locking script pointing to the output. Thus, consider a pair of transactions, referred to as a first transaction and a second transaction (or "target" transaction). The first transaction includes at least one output that specifies the amount of a digital asset, and includes a locking script that defines one or more conditions for unlocking the output. The second (target) transaction includes at least one input and an unlocking script, the at least one input including a pointer to the output of the first transaction; the unlocking script is used to unlock the output of the first transaction.
[0143] In such a model, when the second (target) transaction is sent to the blockchain network to be propagated and recorded in the blockchain, one of the validity conditions applied at each node will be that the unlocking script satisfies all of the one or more conditions defined in the locking script of the first transaction. Another condition will be that the output of the first transaction has not been redeemed by another earlier valid transaction. Any node that finds the target transaction invalid according to any of these conditions will not propagate the transaction (as a valid transaction, but may register an invalid transaction) nor include the transaction in a new block to be recorded in the blockchain.
[0144] Another transaction model is the account-based model. In this case, each transaction is defined not by reference to the UTXO of the previous transaction in the past transaction sequence, but by reference to the absolute account balance. The current state of all accounts is stored individually by the node in the blockchain and is constantly updated.
[0145] Exemplary System Overview
[0146] Figure 1 An exemplary system 100 for implementing a blockchain 150 is shown. The system 100 may include a packet-switched network 101, typically a wide area internet such as the Internet. The packet-switched network 101 includes a plurality of blockchain nodes 104, which may be arranged to form a peer-to-peer (P2P) network 106 within the packet-switched network 101. Although not shown, the blockchain nodes 104 may be arranged as a nearly complete graph. Thus, each blockchain node 104 is highly connected to other blockchain nodes 104.
[0147] Each blockchain node 104 includes a computer device of a peer, and different nodes 104 belong to different peers. Each blockchain node 104 includes a processing device, which includes one or more processors, such as one or more central processing units (CPUs), accelerator processors, special processors and / or field programmable gate arrays (FPGAs), and other devices, such as application-specific integrated circuits (ASICs). Each node also includes a memory, that is, a computer-readable memory in the form of a non-transitory computer-readable medium. The memory may include one or more memory units, which use one or more memory media, such as magnetic media such as hard disks, electronic media such as solid-state drives (SSDs), flash memory, or electrically erasable programmable read-only memories (EEPROMs), and / or optical media such as optical disk drives.
[0148] The blockchain 150 includes a series of data blocks 151, wherein a respective copy of the blockchain 150 is maintained at each of the plurality of blockchain nodes 104 in the distributed or blockchain network 106. As described above, maintaining a copy of the blockchain 150 does not necessarily mean storing the blockchain 150 in its entirety. Instead, the blockchain 150 can be pruned as long as each blockchain node 150 stores a block header (discussed below) for each block 151. Each block 151 in the blockchain includes one or more transactions 152, wherein a transaction in this context refers to a data structure. The nature of the data structure will depend on the type of transaction protocol used as part of the transaction model or plan. A given blockchain uses a particular transaction protocol throughout. In a common transaction protocol, the data structure of each transaction 152 includes at least one input and at least one output. Each output specifies an amount of a digital asset represented as a property, an example of which is an output that is cryptographically locked to a user 103 (requiring the user's signature or other solution to unlock, thereby redeeming or spending). Each input points to the output of a previous transaction 152, thereby linking these transactions.
[0149] Each block 151 also includes a block pointer 155, which points to a previously created block 151 in the blockchain to define the order of blocks 151. Each transaction 152 (except for the coinbase transaction) includes a pointer to a previous transaction to define the order of the transaction sequence (Note: the sequence of transactions 152 can branch). The blockchain of blocks 151 is traced back to the genesis block (Gb) 153, which is the first block in the blockchain. One or more original transactions 152 earlier in the blockchain 150 point to the genesis block 153, not to the previous transaction.
[0150] Each blockchain node 104 is configured to forward transactions 152 to other blockchain nodes 104, so that transactions 152 are propagated throughout the network 106. Each blockchain node 104 is configured to create blocks 151 and store corresponding copies of the same blockchain 150 in its corresponding memory. Each blockchain node 104 also maintains an ordered set (or "pool") 154 of transactions 152 waiting to be incorporated into block 151. Ordered pools 154 are often referred to as "memory pools". In this article, the term is not intended to be limited to any particular blockchain, protocol, or model. The term refers to a set of ordered transactions that a node 104 has accepted as valid, and for which the node 104 is forced to not accept any other transaction that attempts to spend the same output.
[0151] In a given current transaction 152j, an input (or each input) includes a pointer that references an output of a previous transaction 152i in the transaction sequence, specifying that the output is to be redeemed or "spent" in the current transaction 152j. In general, the previous transaction can be any transaction in the ordered set 154 or any block 151. Although the previous transaction 152i will need to exist and be verified to be valid in order to ensure that the current transaction is valid, the previous transaction 152i does not have to exist when the current transaction 152j is created or even sent to the network 106. Therefore, in this article, "previous" refers to the predecessor in the logical sequence linked by the pointer, and not necessarily the creation time or sending time in the time sequence, and therefore, does not necessarily exclude the situation where transactions 152i, 152j are created or sent out of order (see the discussion of orphan transactions below). The previous transaction 152i can also be called a predecessor transaction or a predecessor transaction.
[0152] The inputs of the current transaction 152j also include input authorizations, such as the signature of the user 103a to whom the outputs of the previous transaction 152i are locked. In turn, the outputs of the current transaction 152j may be cryptographically locked to the new user or entity 103b. Thus, the current transaction 152j may transfer the amounts defined in the inputs of the previous transaction 152i to the new user or entity 103b defined in the outputs of the current transaction 152j. In some cases, a transaction 152 may have multiple outputs to split the input amounts among multiple users or entities (one of which may be the original user or entity 103a for changes). In some cases, a transaction may also have multiple inputs to aggregate the amounts from multiple outputs of one or more previous transactions and reallocate them to one or more outputs of the current transaction.
[0153] According to an output-based transaction protocol, such as Bitcoin, when a party 103, such as an individual user or an organization, wishes to issue a new transaction 152j (either by an automated program employed by the party or manually), the issuing party sends the new transaction from its computer terminal 102 to a recipient. The issuing party or recipient will ultimately send the transaction to one or more blockchain nodes 104 of the network 106 (now typically a server or data center, but in principle it can also be other user terminals). It is also not excluded that the party 103 issuing the new transaction 152j can send the transaction directly to one or more blockchain nodes 104, and in some examples, the transaction may not be sent to the recipient. The blockchain node 104 receiving the transaction checks whether the transaction is valid according to the blockchain node protocol applied at each blockchain node 104. The blockchain node protocol typically requires the blockchain node 104 to check whether the cryptographic signature in the new transaction 152j matches the expected signature, which depends on the previous transaction 152i in the ordered sequence of transactions 152. In such an output-based transaction protocol, this may include checking whether the cryptographic signature or other authorization of the party 103 included in the input of the new transaction 152j matches the condition defined in the output of the previous transaction 152i assigned by the new transaction, wherein the condition typically includes at least checking whether the cryptographic signature or other authorization in the input of the new transaction 152j unlocks the output of the previous transaction 152i to which the input of the new transaction is linked. The condition may be defined at least in part by a script included in the output of the previous transaction 152i. Alternatively, this may be determined solely by the blockchain node protocol, or may be determined by a combination thereof. In either case, if the new transaction 152j is valid, the blockchain node 104 forwards it to one or more other blockchain nodes 104 in the blockchain network 106. These other blockchain nodes 104 apply the same test according to the same blockchain node protocol, and therefore forward the new transaction 152j to one or more other nodes 104, and so on. In this way, the new transaction is propagated throughout the network of blockchain nodes 104.
[0154] In the output-based model, the definition of whether a given output (e.g., UTXO) is allocated (e.g., spent) is whether it is validly redeemed by the input of another subsequent transaction 152j according to the blockchain node protocol. Another condition for the transaction to be valid is that the output of the previous transaction 152i that it attempts to redeem has not been redeemed by another transaction. Similarly, if invalid, the transaction 152j will not be propagated (unless marked as invalid and propagated for reminder) or recorded in the blockchain 150. This prevents double spending, that is, the transaction processor allocates the output of the same transaction more than once. On the other hand, the account-based model prevents double spending by maintaining account balances. Because there is also a defined transaction order, the account balance has a single defined state at any time.
[0155] In addition to verifying that transactions are valid, blockchain nodes 104 compete to be the first node to create a block of transactions in a process generally referred to as mining, which is supported by "proof of work". At a blockchain node 104, a new transaction is added to an ordered pool 154 of valid transactions that have not yet appeared in a block 151 recorded on the blockchain 150. The blockchain nodes then compete to assemble a new valid transaction block 151 of transactions 152 in the ordered transaction set 154 by attempting to solve a cryptographic puzzle. Typically, this involves searching for a "nonce" value such that when the nonce is juxtaposed with a representation of the ordered pool 154 of pending transactions and hashed, the output of the hash value satisfies a predetermined condition. For example, the predetermined condition may be that the output of the hash value has a certain predefined number of leading zeros. Note that this is only one specific type of proof of work puzzle, and other types are not excluded. A property of a hash function is that it has an unpredictable output relative to its input. Therefore, this search can only be performed by brute force, consuming a large amount of processing resources at each blockchain node 104 that attempts to solve the puzzle.
[0156] The first blockchain node 104 that solves the puzzle announces the puzzle solution on the network 106, providing the solution as proof, which can then be easily checked by other blockchain nodes 104 in the network (once a solution to the hash value is given, it is directly possible to check whether the solution satisfies the output of the hash value). The first blockchain node 104 propagates a block to other nodes that accept the block to reach a threshold consensus, thereby enforcing the protocol rules. The ordered set of transactions 154 is then recorded by each blockchain node 104 as a new block 151 in the blockchain 150. A block pointer 155 is also assigned to the new block 151n pointing to the previously created block 151n-1 in the blockchain. The large amount of work required to create a proof-of-work solution (e.g., in the form of a hash) signals the first node 104's intention to follow the blockchain protocol. These rules include not accepting a transaction as valid if it allocates the same output as a previously verified valid transaction, otherwise it is called a double spend. Once created, the block 151 cannot be modified because it is identified and maintained at each blockchain node 104 in the blockchain network 106. The block pointers 155 also impose an order on the blocks 151. Because transactions 152 are recorded in ordered blocks at each blockchain node 104 in the network 106, an immutable public ledger of transactions is provided.
[0157] It should be noted that the different blockchain nodes 104 competing to solve a puzzle at any given time may do so based on different snapshots of the pool 154 of transactions that have not yet been published at any given time, depending on when they began searching for a solution or the order in which they received the transactions. The person solving the corresponding puzzle first defines the transactions 152 included in the new block 151n and their order, and updates the current pool of unpublished transactions 154. The blockchain nodes 104 then continue to compete to create blocks from the newly defined ordered pool of unpublished transactions 154, and so on. In addition, there is a protocol to resolve any "forks" that may occur, where two blockchain nodes 104 solve puzzles within a short time of each other, thereby propagating conflicting views of the blockchain between the nodes 104. In short, the fork direction that is the longest becomes the final blockchain 150. It should be noted that this does not affect users or agents of the network, as the same transaction will appear in both forks.
[0158] According to the Bitcoin blockchain (and most other blockchains), a node that successfully constructs a new block 104 is granted the ability to newly allocate an additional, accepted amount of digital assets in a new special type of transaction that allocates an additional limited amount of digital assets (as opposed to an inter-agent or inter-user transaction, which transfers a certain amount of digital assets from one agent or user to another). This special type of transaction is often called a "coinbase transaction", but may also be called a "starting transaction" or "generating transaction". It usually forms the first transaction of a new block 151n. The proof of work signals the intention of the node that constructs the new block to follow the protocol rules, thereby allowing the particular transaction to be redeemed later. The blockchain protocol rules may require a maturation period, such as 100 blocks, before the special transaction can be redeemed. Typically, a regular (non-generating) transaction 152 will also specify an additional transaction fee in one of its outputs to further reward the blockchain node 104 that created the block 151n in which the transaction was published. This fee is often called a "transaction fee" and is discussed below.
[0159] Due to the resources involved in transaction verification and publication, typically at least each blockchain node 104 takes the form of a server comprising one or more physical server units, or even an entire data center. However, in principle, any given blockchain node 104 may take the form of a user terminal or a group of user terminals networked together.
[0160] The memory of each blockchain node 104 stores software configured to run on the processing device of the blockchain node 104 to perform its corresponding role according to the blockchain node protocol and process transactions 152. It should be understood that any action attributed to the blockchain node 104 herein can be performed by software running on the processing device of the corresponding computer device. The node software can be implemented in one or more applications at the application layer or a lower layer such as an operating system layer or a protocol layer, or any combination of these layers.
[0161] Computer devices 102 of each of the parties 103 acting as consuming users are also connected to the network 101. These users can interact with the blockchain network 106 but do not participate in verifying transactions or constructing blocks. Some of these users or agents 103 can act as senders and receivers in transactions. Other users can interact with the blockchain 150 without acting as senders or receivers. For example, some parties can act as storage entities that store a copy of the blockchain 150 (e.g., having obtained a copy of the blockchain from the blockchain node 104).
[0162] Some or all of the parties 103 may be connected as part of a different network, such as a network overlaid on the blockchain network 106. Users of the blockchain network (often referred to as "clients") may be referred to as being part of a system that includes the blockchain network 106; however, these users are not blockchain nodes 104 because they do not perform the roles required of blockchain nodes. Instead, each party 103 may interact with the blockchain network 106, thereby utilizing the blockchain 150 by connecting to (i.e., communicating with) the blockchain node 106. For illustrative purposes, two parties 103 and their corresponding devices 102 are shown: a first party 103a and its corresponding computer device 102a, and a second party 103b and its corresponding computer device 102b. It should be understood that more such parties 103 and their corresponding computer devices 102 may exist and participate in the system 100, but for convenience, they are not illustrated. Each party 103 may be an individual or an organization. For illustrative purposes only, in this document, the first party 103a is referred to as Alice and the second party 103b is referred to as Bob, but it should be understood that this is not limited to Alice or Bob, and any reference to Alice or Bob in this document can be replaced with "first party" and "second party" respectively.
[0163] The computer device 102 of each party 103 includes a corresponding processing device, which includes one or more processors, such as one or more CPUs, graphics processing units (GPUs), other accelerator processors, specific application processors and / or FPGAs. The computer device 102 of each party 103 also includes a memory, that is, a computer-readable memory in the form of a non-temporary computer-readable medium. The memory may include one or more memory units, which use one or more memory media, such as magnetic media such as hard disks, electronic media such as SSDs, flash memory or EEPROMs, and / or optical media such as optical disk drives. The memory on the computer device 102 of each party 103 stores software, which includes a corresponding instance of at least one client application 105 that is set to run on the processing device. It should be understood that any action attributed to a given party 103 in this article can be executed by software running on the processing device of the corresponding computer device 102. The computer device 102 of each party 103 includes at least one user terminal, such as a desktop or laptop computer, a tablet computer, a smart phone, or a wearable device such as a smart watch. The computer device 102 of a given party 103 may also include one or more other network resources, such as cloud computing resources accessed through a user terminal.
[0164] The client application 105 may initially be provided to the computer device 102 of any given party 103 via a suitable computer-readable storage medium downloaded from a server, for example, or via a removable storage device such as a removable SSD, flash memory key, removable EEPROM, removable disk drive, floppy disk or tape, an optical disk such as a CD or DVD ROM, or a removable optical drive, etc.
[0165] The client application 105 includes at least a "wallet" function. This has two main functions. One of the functions is to enable the corresponding party 103 to create, authorize (e.g., sign) and send transactions 152 to one or more Bitcoin nodes 104, which are then propagated in the network of blockchain nodes 104 and included in the blockchain 150. Another function is to report to the corresponding party the amount of digital assets it currently owns. In an output-based system, this second function includes collating the amounts defined in the outputs of various transactions 152 belonging to the relevant parties scattered in the blockchain 150.
[0166] Note: While various client functions may be described as being integrated into a given client application 105, this is not necessarily limiting, and rather, any client function described herein may be implemented in a suite consisting of two or more different applications, such as interfacing via an API or one application as a plug-in to another application. More generally, the client functions may be implemented at the application layer or at a lower layer such as an operating system, or any combination of these layers. The following description will be based on the client application 105, but it should be understood that this is not limiting.
[0167] An instance of a client application or software 105 on each computer device 102 is operably coupled to at least one of the blockchain nodes 104 of the network 106. This can enable a wallet function of the client 105 to send transactions 152 to the network 106. The client 105 can also contact the blockchain node 104 to query the blockchain 150 for any transactions to which the corresponding party 103 is a recipient (or indeed to check other parties' transactions in the blockchain 150, because in an embodiment, the blockchain 150 is a public facility that provides transaction trust to some extent through its public visibility). The wallet function on each computer device 102 is configured to formulate and send transactions 152 according to a transaction protocol. As described above, each blockchain node 104 runs software that is configured to verify transactions 152 according to the blockchain node protocol and forward transactions 152 for propagation in the blockchain network 106. The transaction protocol and the node protocol correspond to each other, and a given transaction protocol and a given node protocol together implement a given transaction model. The same transaction protocol is used for all transactions 152 in the blockchain 150. All nodes 104 in the network 106 use the same node protocol.
[0168] When a given party 103 (say Alice) wishes to send a new transaction 152j to be included in the blockchain 150, she will formulate the new transaction according to the relevant transaction protocol (using the wallet function in her client application 105). She will then send the transaction 152 from the client application 105 to one or more blockchain nodes 104 to which she is connected. For example, this may be the blockchain node 104 that Alice's computer 102 is best connected to. When any given blockchain node 104 receives the new transaction 152j, it will process it according to the blockchain node protocol and its corresponding role. This includes first checking whether the newly received transaction 152j meets certain conditions for becoming "valid", specific examples of which will be discussed in detail later. In some transaction protocols, the validity conditions may be configurable on a per-transaction basis through a script included in the transaction 152. Alternatively, the conditions may simply be a built-in function of the node protocol, or defined by a combination of script and node protocol.
[0169] If the newly received transaction 152j passes the validity test (i.e., under the “valid” condition), any blockchain node 104 that receives the transaction 152j will add the new verified valid transaction 152 to the ordered transaction set 154 maintained at the blockchain node 104. Further, any blockchain node 104 that receives the transaction 152j will then propagate the verified valid transaction 152 to one or more other blockchain nodes 104 in the network 106. Since each blockchain node 104 applies the same protocol, it is assumed that the transaction 152j is valid, which means that the transaction will soon be propagated throughout the network 106.
[0170] Once in the ordered pool 154 of pending transactions maintained at a given blockchain node 104, that blockchain node 104 will begin racing to solve the proof-of-work puzzle on the latest version of its respective pool 154 containing the new transaction 152 (keep in mind that other blockchain nodes 104 can attempt to solve the puzzle based on different transaction pools 154. However, whoever solves the puzzle first will define the set of transactions included in the latest block 151. Ultimately, the blockchain node 104 will solve the puzzle for a portion of the ordered pool 154, which includes Alice's transaction 152j). Once the pool 154 including the new transaction 152j completes the proof-of-work, it will immutably become part of one of the blocks 151 in the blockchain 150. Each transaction 152 includes a pointer to an earlier transaction, so the order of transactions is also immutably recorded.
[0171] Different blockchain nodes 104 may initially receive different instances of a given transaction and therefore have conflicting views about which instance is “valid” before one instance is published in a new block 151, at which point all blockchain nodes 104 agree that the published instance is the only valid instance. If a blockchain node 104 accepts one instance as valid and then discovers that a second instance has been recorded in the blockchain 150, the blockchain node 104 must accept this and will discard (i.e., treat as invalid) the instance it originally accepted (i.e., the instance that has not yet been published in block 151).
[0172] Another type of transaction protocol operated by some blockchain networks as part of the account-based transaction model can be called an "account-based" protocol. In the account-based case, each transaction is defined not by reference to the UTXO of a previous transaction in the past sequence of transactions, but by reference to an absolute account balance. The current state of all accounts is stored individually in the blockchain by the nodes of the network and is continuously updated. In such systems, transactions are ordered using an account's running transaction record (also called a "position"). This value is signed by the sender as part of their cryptographic signature and hashed as part of the transaction reference calculation. In addition, optional data fields can also be signed in the transaction. For example, a data field can point to a previous transaction if it contains the ID of the previous transaction.
[0173] UTXO-based model
[0174] Figure 2 An exemplary transaction protocol is shown. This is an example of a UTXO-based protocol. A transaction 152 ("Tx" for short) is the basic data structure of the blockchain 150 (each block 151 includes one or more transactions 152). The following will be described with reference to an output-based or "UTXO"-based protocol. However, this is not limited to all possible embodiments. It should be noted that although the exemplary UTXO-based protocol is described with reference to Bitcoin, it can also be implemented on other exemplary blockchain networks.
[0175] In the UTXO-based model, each transaction ("Tx") 152 includes a data structure that includes one or more inputs 202 and one or more outputs 203. Each output 203 may include an unspent transaction output (UTXO), which can be used as a source of input 202 for another new transaction (if the UTXO has not been redeemed). The UTXO includes a value that specifies the amount of a digital asset. This represents a set of tokens on a distributed ledger. The UTXO may also include a transaction ID of its source transaction and other information. The transaction data structure may also include a header 201, which may include an indicator of the size of the input field 202 and the output field 203. The header 201 may also include an ID for the transaction. In an embodiment, the transaction ID is a hash value of the transaction data (excluding the transaction ID itself) and is stored in the header 201 of the original transaction 152 submitted to the node 104.
[0176] Let's say Alice 103a wishes to create a transaction 152j that transfers the relevant amount of digital assets to Bob 103b. Figure 2 In , Alice's new transaction 152j is labeled "Tx1". This new transaction takes the amount of digital assets locked to Alice in output 203 of the previous transaction 152i in the sequence and transfers at least a portion of such amount to Bob. Figure 2 , the previous transaction 152i is labeled "Tx0". Tx0 and Tx1 are just arbitrary labels that do not necessarily mean that Tx0 refers to the first transaction in blockchain 151 and Tx1 refers to a subsequent transaction in pool 154. Tx1 can point to any previous (i.e., preceding) transaction that still has unspent output 203 locked to Alice.
[0177] When Alice creates her new transaction Tx1, or at least when she sends it to the network 106, the previous transaction Tx0 may already be valid and included in block 151 of the blockchain 150. The transaction may have been included in one of the blocks 151 at this time, or it may still be waiting in the ordered set 154, in which case it will be included in the new block 151 soon. Alternatively, Tx0 and Tx1 may be created and sent to the network 106 together; or, if the node protocol allows buffering of "orphan" transactions, Tx0 may even be sent after Tx1. The terms "previous" and "successor" as used herein in the context of transaction sequences refer to the order of transactions in the sequence defined by the transaction pointers specified in the transactions (which transaction points to which other transaction, etc.). They may equally be replaced by "predecessors" and "successors", "predecessors" and "descendants", or "parents" and "children", etc. This does not necessarily refer to the order in which they are created, sent to the network 106, or arrive at any given blockchain node 104. However, subsequent transactions (descendant transactions or "child transactions") pointing to a previous transaction (predecessor transaction or "parent transaction") will not be valid unless the parent transaction is valid. A child transaction that arrives at the blockchain node 104 before the parent transaction is considered an orphan transaction. Depending on the node protocol and / or node behavior, it may be discarded or buffered for a period of time to wait for the parent transaction.
[0178] One of the one or more outputs 203 of the previous transaction Tx0 includes a specific UTXO, labeled UTXO0. Each UTXO includes a value specifying the amount of digital assets represented by the UTXO and a locking script that defines the conditions that the unlocking script in the input 202 of the subsequent transaction must satisfy in order for the subsequent transaction to be valid and thus successfully redeem the UTXO. Typically, the locking script locks the amount to a specific party (the beneficiary of the transaction for that amount). That is, the locking script defines the unlocking condition, which typically includes the following conditions: the unlocking script in the input of the subsequent transaction includes the cryptographic signature of the party to which the previous transaction was locked.
[0179] The locking script (also known as scriptPubKey) is a piece of code written in a domain-specific language recognized by the node protocol. A specific example of such a language is called a "Script" (with a capital S), which can be used by the blockchain network. The locking script specifies the information required to spend the transaction output 203, such as the requirement for Alice's signature. The unlocking script appears in the output of the transaction. The unlocking script (also known as scriptSig) is a piece of code written in a domain-specific language that provides the information required to meet the locking script criteria. For example, it can contain Bob's signature. The unlocking script appears in the input 202 of the transaction.
[0180] Thus in the example shown, UTXO0 in output 203 of Tx0 includes a locking script [Checksig P A], the locking script requires Alice’s signature Sig P A , in order to redeem UTXO0 (strictly speaking, to make subsequent transactions that attempt to redeem UTXO0 valid). A ] contains Alice's public key P from her public-private key pair A The input 202 of Tx1 includes a pointer to Tx1 (e.g., by its transaction ID (TxID0), which in the embodiment is the hash value of the entire transaction Tx0). The input 202 of Tx1 includes an index identifying UTXO0 in Tx0 to identify it among any other possible outputs of Tx0. The input 202 of Tx1 further includes an unlocking script <Sig P A >, the unlocking script includes Alice's cryptographic signature, which is created by Alice by applying the private key of her key pair to a predetermined portion of data (sometimes called a "message" in cryptography). The data (or "message") that Alice needs to sign to provide a valid signature can be defined by the locking script, the node protocol, or a combination thereof.
[0181] When a new transaction Tx1 arrives at a blockchain node 104, the node applies the node protocol. This includes running the locking script and the unlocking script together to check whether the unlocking script satisfies the conditions defined in the locking script (where the conditions may include one or more criteria). In an embodiment, this involves juxtaposing two scripts:
[0182] <Sig PA> <pa>||[Checksig PA]
[0183] Where "||" means concatenation, "<…>" means putting data on the stack, and "[…]" means a function consisting of locked scripts (in this case, a stack-based language). Similarly, scripts can be run one after another using a common stack instead of concatenating scripts. In either case, when run together, the scripts use Alice's public key P A (included in the locking script of the output of Tx0) to verify that the unlocking script in the input of Tx1 contains Alice's signature when signing the expected portion of the data. The expected partial data itself (the "message") also needs to be included in order to perform this verification. In an embodiment, the signed data includes the entire Tx1 (so there is no need to include a separate element to plaintext specify the signed partial data, as it is already present).
[0184] Those skilled in the art will be familiar with the details of verification by public-private cryptography. Basically, if Alice has signed a message using her private key encryption, then given Alice's public key and the message in plain text, other entities such as node 104 can verify that the message must have been signed by Alice. Signing typically includes hashing the message, signing the hash value, and marking this to the message as a signature, so that any holder of the public key can verify the signature. Therefore, it should be noted that in embodiments, any reference to signing a particular data fragment or transaction portion, etc. herein can mean signing the hash value of the data fragment or transaction portion.
[0185] If the unlocking script in Tx1 satisfies one or more conditions specified in the locking script of Tx0 (so, in the example shown, if Alice's signature is provided and verified in Tx1), then the blockchain node 104 considers Tx1 to be valid. This means that the blockchain node 104 will add Tx1 to the pending transaction ordered pool 154. The blockchain node 104 will also forward the transaction Tx1 to one or more other blockchain nodes 104 in the network 106 so that it will propagate throughout the network 106. Once Tx1 is valid and included in the blockchain 150, this will define UTXO0 from Tx0 as spent. It should be noted that Tx1 is only valid if it spends unspent transaction output 203. If it attempts to spend an output that has already been spent by another transaction 152, then Tx1 will be invalid even if all other conditions are met. Therefore, the blockchain node 104 also needs to check whether the UTXO referenced in the previous transaction Tx0 has been spent (that is, whether it has formed a valid input for another valid transaction). This is one of the reasons why it is important for the blockchain 150 to impose a defined order on transactions 152. In practice, a given blockchain node 104 may maintain a separate database marking the UTXO 203 of a transaction 152 as having been spent, but ultimately defining whether a UTXO has been spent depends on whether it has formed a valid input to another valid transaction in the blockchain 150.
[0186] If the total amount specified in all outputs 203 of a given transaction 152 is greater than the total amount pointed to by all its inputs 202, this is another basis for failure in most transaction models. Therefore, such a transaction will not be propagated or included in block 151.
[0187] Note that in the UTXO-based transaction model, a given UTXO needs to be spent as a whole. You cannot "leave behind" a portion of the amount defined in a UTXO as spent while spending another portion. However, the amount of a UTXO can be split between multiple outputs of subsequent transactions. For example, the amount defined in UTXO0 of Tx0 can be split between multiple UTXOs in Tx1. Therefore, if Alice does not want to give all of the amount defined in UTXO0 to Bob, she can use the remaining portion to make change for herself in the second output of Tx1, or to pay another party.
[0188] In practice, Alice will also typically need to include a fee for the Bitcoin node 104 that successfully includes Alice's transaction 104 in block 151. If Alice does not include such a fee, Tx0 may be rejected by the blockchain node 104, and therefore, although technically valid, may not be propagated and included in the blockchain 150 (if the blockchain node 104 does not want to accept transaction 152, the node protocol does not force the blockchain node 104 to accept). In some protocols, the transaction fee does not require its own separate output 203 (i.e., no separate UTXO is required). Instead, any difference between the total amount pointed to by input 202 and the total amount specified by output 203 of a given transaction 152 will be automatically provided to the blockchain node 104 that issued the transaction. For example, assume that a pointer to UTXO0 is the only input of Tx1, and Tx1 has only one output UTXO1. If the amount of the digital asset specified in UTXO0 is greater than the amount specified in UTXO1, the difference can be distributed by the node 104 that wins the proof-of-work competition to create a block containing UTXO1. Alternatively or additionally, this does not necessarily preclude that a transaction fee may be explicitly specified in one of the UTXOs 203 in the transaction 152 itself.
[0189] Alice and Bob's digital assets consist of the UTXO locked to them in any transaction 152 anywhere in the blockchain 150. Therefore, in general, the assets of a given party 103 are scattered among the UTXOs of various transactions 152 throughout the blockchain 150. No single number defining the total balance of a given party 103 is stored anywhere in the blockchain 150. The role of the wallet function of the client application 105 is to collate the various UTXO values locked to the respective parties and not yet spent in other subsequent transactions. To achieve this, it can query a copy of the blockchain 150 stored at any one Bitcoin node 104.
[0190] It should be noted that script code is often represented schematically (i.e., using an imprecise language). For example, an opcode (opcode) may be used to represent a particular function. "OP_..." refers to a particular opcode of the scripting language. For example, OP_RETURN is a scripting language opcode that, when preceded by OP_FALSE at the beginning of a locking script, creates an unspendable output of a transaction that can store data within the transaction, thereby immutably recording the data in the blockchain 150. For example, the data may include a file to be stored in the blockchain.
[0191] Typically, the inputs to a transaction contain a digital signature corresponding to the public key PA. In an embodiment, this is based on ECDSA using the elliptic curve secp256k1. The digital signature signs a specific piece of data. In an embodiment, for a given transaction, the signature will sign part of the transaction input and part or all of the transaction output. Signing a specific part of the output depends on the SIGHASH flag. The SIGHASH flag is typically a 4-byte code included at the end of the signature that selects the output to be signed (and is therefore fixed at the time of signing).
[0192] The locking script is sometimes referred to as "scriptPubKey", which means that it usually includes the public key of the party to which the corresponding transaction is locked. The unlocking script is sometimes referred to as "scriptSig", which means that it usually provides the corresponding signature. However, more generally speaking, in all applications of blockchain 150, the conditions for UTXO redemption do not necessarily include verification of the signature. More generally speaking, the scripting language can be used to define any one or more conditions. Therefore, the more general terms "locking script" and "unlocking script" may be preferred.
[0193] Side Channel
[0194] like Figure 1 As shown, the client application on each of Alice and Bob's computer devices 102a, 120b can include additional communication functionality. This additional functionality enables Alice 103a to establish a separate side channel 107 with Bob 103b (at the instigation of any party or third party). Side channel 107 enables data to be exchanged away from the blockchain network. Such communications are sometimes referred to as "off-chain" communications. For example, this can be used to exchange transactions 152 between Alice and Bob without registering the transaction (yet) on the blockchain network 106 or publishing it on the chain 150 until one of the parties chooses to broadcast it to the network 106. Sharing transactions in this way is sometimes referred to as sharing "transaction templates". The transaction template may lack one or more inputs and / or outputs required to form a complete transaction. Alternatively or additionally, the side channel 107 can be used to exchange any other transaction-related data, such as keys, negotiation amounts or terms, data content, etc.
[0195] The side channel 107 may be established via the same packet switching network 101 as the blockchain network 106. Alternatively or additionally, the side channel 301 may be established via a different network such as a mobile cellular network or a local area network such as a wireless local area network, or even via a direct wired or wireless link between Alice's and Bob's devices 102a, 102b. In general, a side channel 107 referred to anywhere in this document may include any one or more links via one or more networking technologies or communication media that are used to exchange data "off-chain", i.e., off-chain. The bundle or collection of off-chain links may be referred to as a side channel 107 as a whole. Therefore, it should be noted that if Alice and Bob are said to exchange certain information or data, etc., via a side channel 107, this does not necessarily mean that all of this data must be sent over exactly the same link or even the same type of network.
[0196] Client Software
[0197] Figure 3A An exemplary implementation of a client application 105 for implementing an embodiment of the disclosed solution is shown. The client application 105 includes a transaction engine 401 and a user interface (UI) layer 402. According to the solution discussed above and discussed in further detail later, the transaction engine 401 is configured to implement basic transaction-related functions of the client 105, such as formulating transactions 152, receiving and / or sending transactions and / or other data through the side channel 301, and / or sending transactions to one or more nodes 104 for propagation through the blockchain network 106. According to the embodiments disclosed herein, the transaction engine 401 of each client 105 includes functionality 403.
[0198] The UI layer 402 is configured to present a user interface through a user input / output (I / O) mode of the corresponding user's computer device 102, including outputting information to the corresponding user 103 through the user output mode of the device 102, and receiving input from the corresponding user 103 through the user input mode of the device 102. For example, the user output mode may include one or more screens (touch or non-touch screen) that provide visual output, one or more speakers that provide audio output, and / or one or more tactile output devices that provide tactile output, etc. The user input mode may include, for example, an input array of one or more touch screens (which may be the same or different from that / those used for the output mode); one or more cursor-based devices such as a mouse, trackpad, or trackball; one or more microphones and voice or sound recognition algorithms for receiving voice or sound input; one or more gesture-based input devices for receiving input in the form of manual or physical gestures; or one or more mechanical buttons, switches, or joysticks, etc.
[0199] Note: Although various functions in this document may be described as being integrated into the same client application 105, this does not necessarily constitute a limitation. Instead, they can be implemented in a suite of two or more different applications, such as one application as a plug-in to another application or interfacing via an API (application programming interface). For example, the functionality of the transaction engine 401 can be implemented in a separate application rather than in the UI layer 402, or the functionality of a given module such as the transaction engine 401 can be split between multiple applications. At the same time, it is not excluded that some or all of the described functions can be implemented, for example, at the operating system level. Where a single or given application 105 or the like is referenced anywhere in this document, it should be understood that this is only by way of example, and more generally, the described functions can be implemented in any form of software.
[0200] Figure 3B A model is given of an example of a user interface (UI) 500 that may be presented by the UI layer 402 of the client application 105a on Alice's device 102a. It should be understood that a similar UI may be presented by the client 105b on Bob's device 102b or any other party's device.
[0201] By means of diagrams, Figure 3B The UI 500 is shown from Alice's perspective. The UI 500 may include one or more UI elements 501, 502, 503, which are presented as different UI elements through user output.
[0202] For example, the UI elements may include one or more user-selectable elements 501, which may be different buttons on a screen, different options in a menu, or the like. The user input method is configured to enable the user 103 (in this case, Alice 103a) to select or otherwise operate one of the options, such as by clicking or touching the UI element on the screen, or speaking the name of the desired option (Note: the term "manual" as used herein is only used to contrast with automatic, and is not necessarily limited to performing operations by hand).
[0203] Alternatively or additionally, the UI element may include one or more data entry fields 502 through which a user can perform ... These data entry fields are presented via a user output means, such as on a screen, and data may be entered into the fields via a user input means, such as a keyboard or touch screen. Alternatively, the data may be received verbally, such as based on speech recognition.
[0204] Alternatively or additionally, the UI element may include one or more information elements 503 that output information to the user. For example, this / these may be presented on a screen or audibly.
[0205] It should be understood that the specific manner in which various UI elements, selection options, and input data are presented is not important. The functions of these UI elements will be discussed in more detail later. It should also be understood that the UI 500 shown in Figure 3 is only a diagram model, and in practice, it may include one or more further UI elements, which are not described for the sake of brevity.
[0206] Node software
[0207] Figure 4 An example of node software 450 running on each blockchain node 104 of the network 106 in an example of a UTXO-based or output-based model is shown. It should be noted that another entity may run the node software 450 without being classified as a node 104 on the network 106, i.e., not performing the actions required of the node 104. The node software 450 may include, but is not limited to, a protocol engine 451, a scripting engine 452, a stack 453, an application-level decision engine 454, and a collection of one or more blockchain-related functional modules 455. Each node 104 may run node software that includes, but is not limited to, all three of the following: a consensus module 455C (e.g., proof of work), a propagation module 455P, and a storage module 455S (e.g., a database). The protocol engine 401 is typically configured to identify different fields of a transaction 152 and process such fields according to the node protocol. When a transaction 152i (Tx m-1 )’s output (e.g., UTXO) is an input transaction 152j (Tx j ), the protocol engine 451 identifies Tx j The unlocking script in and passes it to the script engine 452. The protocol engine 451 also j Pointer in the input to identify and retrieve Tx i .Tx i may be published on blockchain 150, in which case the protocol engine may retrieve Tx from the copy of block 151 of blockchain 150 stored at node 104 i . Or, Tx i It can also be published on blockchain 150. In this case, protocol engine 451 can retrieve Tx from unpublished ordered transaction set 154 maintained by node 104. i Regardless of the method used, the script engine 451 will identify Tx i The locked script in the reference output is passed to the script engine 452.
[0208] Therefore, the script engine 452 has Tx i The locking script and the j The unlocking script for the corresponding input. For example, Figure 2 Transaction labels Tx0 and Tx1 are shown in FIG, but the same transaction can also be applied to any transaction pair. As previously described, the script engine 452 runs two scripts together, which will include placing data on and retrieving data from the stack 453 according to the stack-based scripting language used (e.g., script).
[0209] By running the scripts simultaneously, the script engine 452 determines whether the unlocking script satisfies one or more criteria defined in the locking script, i.e., whether the unlocking script unlocks the output including the locking script? The script engine 452 returns the result of the determination to the protocol engine 451. If the script engine 452 determines that the unlocking script does meet one or more criteria specified in the corresponding locking script, the result "TRUE" is returned. Otherwise, the result "FALSE" is returned.
[0210] In the output-based model, the result "TRUE" from the script engine 452 is one of the conditions for the validity of the transaction. Typically, one or more further protocol-level conditions evaluated by the protocol engine 451 must also be satisfied; for example, Tx j The total amount of digital assets specified in the inputs of tx does not exceed the total amount pointed to in its outputs, and tx i The pointed output of has not been spent by another valid transaction. The protocol engine 451 evaluates the result from the script engine 452 and one or more protocol-level conditions, and only if they are all TRUE, the protocol engine verifies the transaction Tx j The protocol engine 451 outputs an indication of whether the transaction is valid to the application-level decision engine 454. j Only when the conditions are really valid, the decision engine 454 can choose to control the consensus module 455C and the propagation module 455P at the same time to execute its Tx j. This includes the consensus module 455C, adding Tx to the corresponding ordered transaction set 154 of the node. j , for incorporation into block 151; and propagation module 455P, Tx j Forwarded to another blockchain node 104 in the network 106. Optionally, in an embodiment, the application-level decision engine 454 may apply one or more additional conditions before triggering one or both of these functions. For example, the decision engine may choose to publish a transaction only if the transaction is valid and sufficient transaction fees are reserved.
[0211] In addition, it should be noted that in this article, the terms "TRUE" and "FALSE" are not necessarily limited to returning results that are expressed only in the form of a single binary number (bit), although this is indeed a possible implementation. More generally, "TRUE" can refer to any state indicating a successful or positive result, while "FALSE" can refer to any state indicating an unsuccessful or non-positive result. For example, in an account-based model, the combination of implicit protocol-level verification of the signature and the additional positive output of the smart contract can be used to indicate that the result is "TRUE" (if both individual results are TRUE, the overall result is considered to be TRUE).< / pa>
Claims
1. A computer-implemented method, the method comprising: include: Broadcast the first actor (O 1 ) in a region (Z) of a domain (D) comprising a plurality of regions (Z); wherein: The first actor (O 1 ) to at least one other actor (O) within the domain 2 ) sends at least one transmission, the at least one transmission comprising data enabling the at least one other actor (O 2 ) is capable of determining the proximity of the first actor relative to the zone (Z).
2. The method according to claim 1, wherein The first actor (O 1 ) also sends at least one further transmission, the at least one further transmission comprising data causing the at least one other actor (O 2 ) is capable of determining the proximity of the first actor relative to the area (Z) in the domain (X).
3. The method according to claim 1 or 2, wherein The first actor sends the at least one transmission and / or the at least one further transmission to all actors in the domain (D).
4. The method according to claim 1, wherein The domain (D) further includes at least one of a subdomain (sD) and a subzone (sZ).
5. The method according to claim 1 or 4, wherein At least one of the zone (Z), the domain (D), the sub-domain (sD), and the sub-zone (sZ) comprises an identifier.
6. The method of claim 5, wherein at least one of the following applies: i) said identifier is unique to each of said zone (Z), said domain (D), said sub-domain (sD) and said sub-zone (sZ); ii) the identifier is, includes or is derived from a master key; iii) said identifier is included in said at least one transmission and / or said at least one further transmission; iv) modifying, replacing or updating the identifier, preferably, modifying, replacing or updating the identifier at predetermined time intervals, or when a specified condition is met, or when a triggering event is executed; v) said identifier is generated by at least one of said zone (Z), said domain (D), said sub-domain (sD) and said sub-zone (sZ).
7. The method according to claim 1 or 2, wherein the at least one transmission and / or the at least one further transmission include: identifying the presence and / or absence of a commitment by said first actor; and / or, a commitment to perform functions in said area and / or to modify characteristics of said area.
8. A method according to any preceding claim, wherein The at least one transmission and / or the at least one further transmission comprises an indicator, wherein the indicator is the first actor The recipient is informed of at least one of an access level, existence and / or purpose associated with at least one of the zone (Z), the domain (D), the subdomain (sD), the subzone (sZ).
9. A method according to any preceding claim, wherein The at least one transmission and / or the at least one further transmission comprises h(R 1 |p) and / or h(R 1 |q), where h represents a hash function applied to the at least one transmission and / or the at least one further transmission; R1 is the identifier of the zone (Z), the domain (D), the subdomain (sD) or the subzone (sZ) in which the first actor is located; |p and |q are indicators cascaded with the identified area, which inform the recipient of at least one of the first actor's access level, presence and / or purpose associated with the area.
10. The method according to any of the preceding claims, wherein the zone (Z), the domain (D), the subdomain (sD) or the subzone (sZ) is at least one of: A physical entity represented by spatial or geospatial data; Can be represented as a virtual area in a virtual domain; Can be represented as an entry in a database or table.
11. The method according to any of the preceding claims, wherein the zone (Z), the domain (D), the subdomain (sD) or the subzone (sZ): including functions and / or variables; and / or Controlled by a program representing said area.
12. The method according to any of the preceding claims, wherein the domain (D) is at least one of the following: (i) distributed data structures, and / or (ii) deployed on a distributed ledger.
13. The method according to any of the preceding claims, further comprising at least one of the following steps: engaging and / or communicating with other actors; protect said area; Modify the variable of the zone.
14. A method according to any preceding claim, wherein the operations of each region and / or the domain and / or the variables are at least partially recorded on at least one of a database and a blockchain ledger.
15. A method according to any preceding claim, further comprising: include: receiving from the at least one other actor within the domain (O 2 )'s reply transmission, the reply transmission enabling the first actor to determine the presence and / or absence of the at least one other actor.
16. A method according to any preceding claim, further comprising: include: Broadcasts a commitment to all actors in the domain (D), the commitment indicating that the first actor (O n ) In determining the at least one other actor (O 2 ) exists, provide proof of said commitment; as well as Secure communications are established with the at least one other actor.
17. A computer-implemented method, the method include: controlling and / or monitoring a system representing a domain (D) comprising a plurality of zones (Z); Receive the instruction first actor (O n ) broadcast of a transmission present in a zone (Z) of a domain (D) comprising a plurality of zones (Z); From said domain and / or said zone, data are received which enable said system to determine the presence and / or absence of other actors relative to said zone (Z).
18. The method of claim 17, wherein at least one of the plurality of regions is implemented using at least one tokenized resource.
19. A computer device, wherein include: a memory, the memory comprising one or more memory units; as well as A processing device comprising one or more processing units, wherein the memory stores a code arranged to be executed on the processing device, the code being configured to execute the method according to any one of claims 1 to 18 when executed on the processing device.
20. A computer program embodied on a computer readable memory and configured to, when run on one or more processors, perform the method according to any one of claims 1 to 18.
