Abstract: A method for value mapping and exercise of digital rights, the method comprising: an operation pool, namely, a data structure T, and two operations, namely, a G operation and an E operation, performed on the operation pool. The C operation increases or decreases elements of T in the same direction and correspondingly increases or decreases credentials s. The E operation increases or decreases the elements of T in opposite directions and correspondingly locks or releases credentials corresponding to the elements. The increase or decrease in the credentials s can be mapped to the asset attribute changes of the rights; the increase or decrease in the elements of T can be mapped to the market value changes of the rights. The G operation and the E operation are independent from each other and semantically self-consistent. The operation pool T remains semantically self-consistent before and after each operation.

Abstract: A method for parallel maintenance of data consistency includes: 1) a node broadcasts requests to other nodes in a network, request a synchronization data block of current synchronization cycle, and calculates a synchronization anchor of this synchronization cycle; 2) for node i requiring data feeding, writing the synchronization anchor of the current synchronization cycle in data block A0, and to produce an array [A]N based on the requirement; data block A0 is the provision that is be added into consistency data in the current synchronization cycle; 3) each node builds its own array [A]N in parallel and broadcasts the array; and 4) the node filters all received arrays of [A]N by the synchronization anchor of array, discards invalid data, and thereafter builds the synchronization data block for the next synchronization cycle.

Abstract: A a method for generating and maintaining trusted data in a network environment includes: 1) initializing a data block [A]0 and shared computation rules, and broadcasting the same to the network; 2) acknowledging a node of the data block [A]0 as a participating node; when new data A needs to be added, n participating nodes independently computing a candidate data block [A]T of [A]1 according to the shared computation rules, and broadcasting the same to the other n?1 participating nodes, wherein [A]1 is a data block containing the newly added data A; 3) The n participating nodes determine an acknowledged candidate result [A]Y according to a monitored broadcast packet; and 4) the participating nodes computing the monitored [A]T/[A]Y, and, when the computation result satisfies a predetermined condition, the participating node determining the computation result thereof as an acknowledged result and broadcasting the same.

Abstract: A method is disclosed for accumulating and co-assembling consistent data.

Abstract: A method and a system for strategy-based digital asset trading are disclosed. The method includes: 1) generating an ownership identifier for a digital asset; 2) setting, in a transaction server, a transaction strategy for a digital asset owner associated with each ownership identifier; and 3) performing, by the transaction server, transaction matching and pricing according to a transaction strategy of a digital asset purchaser and the transaction strategy set for the ownership identifier. The method removes a bottleneck of human dealmaking in digital asset transactions, by performing direct matching of a supplier and a buyer of a fragmented transaction, thereby solving a low-efficiency problem in digital asset transactions in the Internet era.

Abstract: A method is disclosed for accumulating and co-assembling consistent data.

Abstract: A method for parallel maintenance of data consistency includes: 1) a node broadcasts requests to other nodes in a network, asking for a synchronization data block of current synchronization cycle, and calculates a synchronization anchor of this synchronization cycle.

Abstract: The present invention discloses a method for generating and maintaining trusted data in a network environment. The present method includes: 1) initializing a data block [A]0 and a shared computation rules, and broadcasting the same to the network; 2) acknowledging a node of the data block [A]0 as a participating node; when new data A needs to be added, n participating nodes independently computing a candidate data block [A]T of [A]1 according to the shared computation rules, and broadcasting the same to the other n?1 participating nodes, wherein [A]1 is a data block containing the newly added data A; 3) The n participating nodes determine an acknowledged candidate result [A]Y according to a monitored broadcast packet; and 4) the participating nodes computing the monitored [A]T/[A]Y, and, when the computation result satisfies a predetermined condition, the participating node determining the computation result thereof as an acknowledged result and broadcasting the same.