CN113256417A - Transaction sharing-based consensus block method and system - Google Patents

Transaction sharing-based consensus block method and system Download PDF

Info

Publication number
CN113256417A
CN113256417A CN202110529719.4A CN202110529719A CN113256417A CN 113256417 A CN113256417 A CN 113256417A CN 202110529719 A CN202110529719 A CN 202110529719A CN 113256417 A CN113256417 A CN 113256417A
Authority
CN
China
Prior art keywords
transaction
block
node
chain
signature
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202110529719.4A
Other languages
Chinese (zh)
Other versions
CN113256417B (en
Inventor
郭光华
徐留成
卢瑞瑞
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hangzhou Lianwang Technology Co ltd
Original Assignee
Hangzhou Lianwang Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hangzhou Lianwang Technology Co ltd filed Critical Hangzhou Lianwang Technology Co ltd
Priority to CN202110529719.4A priority Critical patent/CN113256417B/en
Publication of CN113256417A publication Critical patent/CN113256417A/en
Application granted granted Critical
Publication of CN113256417B publication Critical patent/CN113256417B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
    • G06Q20/3825—Use of electronic signatures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
    • G06Q20/3827—Use of message hashing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
    • G06Q20/3829—Payment protocols; Details thereof insuring higher security of transaction involving key management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/40—Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
    • G06Q20/401—Transaction verification
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees

Abstract

The invention discloses a transaction sharing-based consensus block method, which comprises the following specific steps: responding to an transaction request on a user chain, constructing a corresponding transaction by a block outlet node on the block chain, signing the transaction, copying a plurality of copies, and sending the copies to other block outlet nodes on the chain; other block-out nodes sign the received transaction copy to form a signature certificate and broadcast the signature certificate and the public key on the chain; the block-out node packs the transaction transactions into blocks, broadcasts the blocks to the chain, and sends a block-out request to the consensus node; the consensus node verifies whether the transaction copy corresponds to the transaction based on the signature verification, and if so, the block node verification is carried out; if the block node stores a signature of the transaction copy of the history block, the block is permitted to be identified. The method is used for decomposing the bandwidth of the blocks, realizing a quick and flexible block distribution process, allowing the blocks to be packed into the blocks as soon as possible according to the speed of transaction dissemination in the network and realizing efficient block operation.

Description

Transaction sharing-based consensus block method and system
Technical Field
The invention belongs to the technical field of block chains, and particularly relates to a transaction sharing-based common identification block method and system.
Background
Blockchains keep the whole world in one state. As each block is dug, a new classification book replaces the previous state. Consensus mechanisms are aimed at ensuring that this state is agreed upon by a broader community. The blockchain itself is considered layer 1. The blockchain serves as a global true source of the current location of all encrypted assets in the network. All nodes on the network keep track of the current state of the ledger. Say bitcoin can handle more than one transaction in a second, but if bitcoin reaches the Visa (Visa) level, say 2000 transactions per second on average, then what changes do occur in the size of the blockchain run (where the transaction is stored)?
Blocks are currently added to the blockchain run every 10 minutes or so (bitcoin protocol measures the difficulty of mining-this is the process in which blocks are added, so it always takes about 10 minutes or so no matter how powerful the miners or mine pool platforms are). One block contains a large heap of newly validated transactions, but is limited in size to 1 MB. Individual transactions may vary in size (depending on a number of factors) with a maximum rate of transaction confirmation of between 5.2 and 10 per second. Therefore, as the block chain grows rapidly, the blocks become larger and the block chain also expands. Info shows that in the past 12 months, the average per transaction has increased by nearly 500 bytes into the blockchain (average 0.5 transactions per second-i think this is just "less than one transaction per second" by resiliant (UBS)). So from 0.5 transactions per second to 2000 transactions over 120 months — a 7% increase monthly. The last year blockchain operation has expanded from 5.7GB to 14GB and stores approximately 1800 million transactions. There is a pruning mechanism that allows blockchains to discard and store some old transactions, but if we assume that the model of future transactions is the same as current, blockchains will continue to expand at the same per transaction storage cost. Ten years later, the size of the blockchain run will reach 40TB, where the transaction efficiency will be very low.
Recent research suggests that transfer of tokens can be accomplished by entering into a local agreement between the parties, without the need for a global status update. This is commonly referred to as layer 2 or down-link transactions, which has a profound effect on transaction expansion. The idea here is that transactions between parties can be aggregated before writing to the blockchain. The layer 2 solution will provide great scalability to the block chain and it is crucial for cryptocurrency to meet the mainstream population requirements. However, even though layer 2 acts as a huge leverage, it can only scale up the underlying blockchain. Layer 2 cannot provide unlimited expansion by itself. Especially, in the block consensus process, all the block-out nodes must download the blocks to be identified for signature voting, the process consumes excessive network bandwidth of the blockchain, and one of the difficulties encountered by the blockchain at present is the bandwidth problem of data transmission, and if the stored files reach 100M or more, the bandwidth severely limits the block-out time. Therefore, it is important to optimize the network to use as little resources as possible for each transaction.
Disclosure of Invention
The invention is based on the problems of the background and the prior art, and aims to design a common identification block method and a system based on transaction sharing, which decompose the bandwidth of a block through transaction sharing, wherein in the block common identification process, a block outlet node does not need to download and store the whole block, only needs to store a transaction copy in advance and sign and verify the transaction copy, thereby providing a common identification basis for the packed block, realizing a fast and flexible block distribution process, designing a plurality of transaction pools, processing a plurality of transaction transactions in parallel, rapidly collecting a plurality of transaction write-in blocks, and allowing the transactions to be packed into the block as soon as possible according to the speed of spreading the transactions in a network and achieving common identification on the block at the speed close to the speed allowed by the network.
The concrete implementation steps comprise:
responding to an transaction request on a user chain, constructing a corresponding transaction by a block outlet node on the block chain, signing the transaction, copying a plurality of copies, and sending the copies to other block outlet nodes on the chain;
the block discharging node on the block chain is similar to the mining node, transaction of commission fees is additionally generated while transaction transactions of users are submitted, and block discharging rewards are obtained after the block discharging is successful; when a transaction is constructed, a POW mechanism is operated, a plurality of block-out nodes compete out blocks, the transaction is firstly calculated and the block can be submitted, and other block-out nodes can only be used as consensus nodes to verify the block-out node submitting the block.
The transaction is copied and sent to other nodes, which is equivalent to only occupying a small part of bandwidth for transmitting the transaction, and when other blocks are not used as common identification nodes, the whole block is required to be downloaded to verify the corresponding transaction, for example, the size of a certain transaction is 1M, the block to be written into the transaction is 100M (the maximum capacity of a bitcoin block is 100M) because of the transaction record before storage and other transaction, the transaction copy is shared in advance, and only the transaction with the size of 1M needs to be sent to other nodes one time, and the 100M block is not required to be downloaded by other nodes for verification, so that the bandwidth of a blockchain network is saved, and the downloading and sending time is reduced.
Other block-out nodes sign the received transaction copy to form a signature certificate and broadcast the signature certificate on the chain;
the other nodes carry out signature verification on the transaction copy to replace block signatures containing the transaction, and as the transaction is attached with the private key signature of the block exit node, the other nodes cannot carry out malicious operations such as tampering and disclosure on the transaction, so that the safety of the transaction is ensured; after other nodes sign the transaction copy, only the signature certificate is sent to the chain for broadcasting, and the traditional block after broadcasting the signature is replaced, so that the communication transmission capacity is further reduced.
Meanwhile, the block-out node packs the transaction transactions into blocks and broadcasts the blocks to the chain, and sends a block-out request to the consensus node;
and the fastest block-out node is calculated to package transaction transactions according to a normal flow and broadcast the transaction transactions on the chain, so that the common identification nodes can conveniently obtain and participate in common identification verification, the block-out request comprises a block version number of the block to be obtained, the common identification nodes are enabled to identify the block to be obtained, and as the common identification nodes participate in common identification voting and obtain excitation after the block is successfully obtained, the packaged transaction and the block-out request broadcasted on the chain are verified and received in real time.
The consensus node verifies whether the transaction copy corresponds to the transaction based on the signature verification, and if so, the block node verification is carried out;
if the block node stores a signature of the transaction copy of the history block, the block is permitted to be identified.
And after receiving the block output request, the common identification node respectively performs block output permission double verification on the packaging block and the block output node, and permits the common identification block after the verification is passed, thereby completing the block chaining process.
The method is characterized in that the maximum common agreement POW common agreement verification is replaced, common agreement nodes carry out common agreement verification on a packed block and carry out block-out permission verification on a block-out node, random front block verification is adopted, and due to the randomness of front block extraction, in order to increase the probability of block-out permission verification, the block-out node must record transaction copies received each time, so that the block-out node can continuously stimulate the signature of the transaction copies.
Further, the block outlet node and the consensus node are deployed in a blockchain, and the blockchain is realized based on a Substate framework;
the block output node is used for analyzing a user transaction request, integrating an account address of a user requester as a transaction input, and using a receiver as a transaction output to form a transaction, wherein the transaction also comprises a transaction timestamp, a transaction hash value and a block version number;
the transaction is signed based on a private key, a backup copy command of the transaction is executed, a plurality of transaction copies are generated and distributed to other block output nodes, wherein the backup copy command comprises a backup copy file name, a suffix name, a storage path and a storage designated position, and the transaction copies are accompanied with private key signatures.
The infrastructure is an open-source, modular and extensible block chain development framework for building a block chain, can be used as a basis for developing public chains, alliance chains and private chains, can build a complete and configurable block chain system in a short time, provides no-bifurcation upgrading, and can enable a block chain network to be updated and iterated quickly; chain governance greatly simplifies the complexity of protocol upgrades.
Because the blockchain is a distributed ledger for storing continuously-growing recorded transactions, transaction requests on a user chain are input and output in the blockchain system, a network transmission path is formed by taking a requester account address as input and a receiver account address as output, one transaction can comprise a plurality of inputs and a plurality of outputs, and a timestamp and a blockversion number are one of the essential parameters for the non-falsifiable and real-time traceable blockchain ledger record.
The block-out node signs the transaction by using a private key, and performs privacy protection on the transaction by using an encryption algorithm to prevent the transaction copy from being maliciously tampered after being sent to other block-out nodes. The backup copy command is a cyclic command program written into the block node, and when the signed transaction copy exists, the execution command of the backup copy is automatically started.
The designated storage position in the backup copy command is the account address of other block output nodes, and when a transaction copy is generated, the account addresses of other block output nodes are randomly allocated to be sequentially used as the designated storage position of the backup copy;
in particular, when executing the backup copy command, the method further comprises the following steps:
and forming an account address set by the account addresses of all the block outlet nodes on the aggregation chain, and randomly distributing the account addresses in the account address set one by one to serve as the storage designated positions of the transaction copies. And when the backup copy command is executed, randomly distributing the account addresses in the account address set one by one as the storage designated positions of the transaction copies.
In the command of executing the backup transaction copy, the account addresses of all the block-out nodes are collected, and when the command is executed, one account address is randomly selected as a storage designated position for generating the transaction copy, namely the transaction copy is directly generated in the accounts of other block-out nodes.
The number of the generated transaction copies is consistent with the number of the block outlet nodes, when a new block outlet node is added into the block chain, the account address set in the backup copy command is updated, and the account address of the new block outlet node is added in the existing account address set; and when the exit block node exits the block chain, updating the account address set in the backup copy command, and deleting the account address exiting the exit block node in the existing account address set.
Further, the other block-out nodes sign the received transaction copy to form a signature certificate, and broadcast the signature certificate on the chain, which is specifically as follows:
and other nodes perform hash transformation on the received transaction copies by using a hash function to generate a digital abstract, then use a private key to sign the digital abstract to form a signature certificate, store the transaction copies held by the other nodes, and broadcast the formed signature certificate and the public key to the chain.
The hash function properties include:
1. collision resistance: different inputs are difficult to find and are mapped to the same output, and the method can prevent tampering, wherein the input is tampered, and the output is changed;
2. hiding: the output is difficult to push out of the input, which can be used for leakage prevention,
hash (message of arbitrary length) > fixed length message (digital digest).
The transaction copy is operated by the hash function, so that the transaction copy signed by other nodes is prevented from being tampered, the transaction copy can be compressed to generate a signature certificate, and when the consensus node is identified and verified, the public key of the block node is identified by the account address of the block node and the number of the signature certificates is counted to complete consensus.
Further, the out-block node packs the transaction into blocks and broadcasts the transaction blocks to the chain, and sends out-block requests to the consensus node, wherein the method comprises the following steps:
the block outlet node arranges input and output information of a transaction, a transaction timestamp and a block version number and carries out hash operation to obtain a transaction unique hash value, calculates the transaction unique hash value and a final merkle hash root of the hash root of a previous block in the block by using merkle operation, packs the transaction unique hash value, the final merkle hash root and the timestamp into a block, broadcasts the block on a chain, records the version number of the block and sends the block to a chain common identification node by taking the transaction as a block outlet request, and waits for the common identification to identify the block.
The block chain is a continuously running merkle tree operation as a whole, and comprises a block head and a block body, wherein the block head contains merkle hash root, time stamp and the like of all transactions, the block head comprises all transaction records, and the transaction records and the hash root of the previous block are subjected to hash operation, namely are associated with the previous block to prepare for block uplink.
Further, the consensus node verifies whether the transaction copy corresponds to the transaction based on the signature verification, specifically:
verifying the signature certificate associated with the transaction contained in the packaging block, decrypting the signature certificate by using the public key to confirm that the transaction copy corresponds to the transaction, confirming that the total number of the block outlet nodes of which the number of the corresponding signature certificates is greater than 2/3 passes the verification.
And the common identification node receives the block output request, participates in common identification verification, performs statistical verification on the transaction copy signature deposit certificate associated with the transaction by combining a Byzantine mechanism, performs decryption and identification on the signature deposit certificate by using the block output node public key for sending the signature deposit certificate, acquires the digital abstract of the transaction copy, confirms the transaction copy and ensures that the verified signature deposit certificate is the transaction copy of the transaction corresponding to the packaging block.
After the verification is passed, further, if the transaction copy of the history block is stored in the block node, the specific steps are as follows:
the consensus node randomly extracts any current history block on the chain and verifies whether the block node stores the signature of the transaction copy of the history block.
If the block exists, the block is allowed to be identified, and if the block does not exist, the block is rejected.
Randomly extracting a history block on the chain, randomly selecting a transaction record in the history block according to a transaction merkle tree, and requiring a block output node to provide a transaction copy signature proof of the transaction record. If the transaction copy signature exists in the block output node, the block output permits the verification to pass.
An extraction threshold may be set to extract the history block within a predetermined range, thereby reducing the load of node storage without affecting the excitation effect.
Further, still include:
constructing a plurality of transaction pools in a block output node by using a Frame control, and processing a plurality of transactions in parallel in the plurality of transaction pools by the block output node, wherein the transactions comprise transaction signatures, transaction copy generation and transaction packaging into blocks;
when the number of the processed transactions is less than or equal to the preset value of the transaction capacity allowed by the block, the processed transactions are subjected to merkle operation to obtain a final hash root serving as a parameter, and all transactions are packed into blocks;
and when the number of the processed transactions is larger than the preset value of the transaction capacity allowed by the block, removing excessive transactions, and carrying out merkle operation on the transactions within the preset value range and packaging the transactions into blocks.
The Frame control, also called container control, can group the control on the form, use the container control can classify various functions in a form further, use the Frame control to construct a plurality of trading pools here, each trading pool is operated independently, can process a plurality of trading pools in parallel with the Frame control.
In a blockchain, each block may contain multiple transactions without exceeding the maximum capacity at the block height, but each transaction requires the most competitive out-of-block node to be packed and written to the block with consensus. When the number of processed transactions is less than or equal to the preset value of transaction capacity allowed by the blocks, the processed transactions are subjected to merkle operation to obtain final hash root serving as a parameter, and all transactions are packed into blocks;
furthermore, the invention provides a transaction sharing-based common identification block system, which comprises a signature sending module, a signature broadcasting module, a request sending module, a first verification module and a second verification module, wherein the signature sending module is used for sending a request to a client;
the signature sending module is used for responding to an transaction request on a user chain, constructing a corresponding transaction by a block output node on the block chain, signing the transaction, copying a plurality of transaction copies and sending the transaction copies to other block output nodes on the chain;
the signature broadcasting module is configured to: other block-out nodes sign the received transaction copy to form a signature certificate and broadcast the signature certificate on the chain;
the request sending module is configured to: the block-out node packs the transaction transactions into blocks, broadcasts the blocks to the chain, and sends a block-out request to the consensus node;
the first verification module is configured to: the consensus node verifies whether the transaction copy corresponds to the transaction based on the signature verification, and if so, the block node verification is carried out;
the second verification module is configured to: if the block node stores a signature of the transaction copy of the history block, the block is permitted to be identified.
Further, the first authentication module is configured to:
verifying the signature certificate associated with the transaction contained in the packaging block, decrypting the signature certificate by using the public key to confirm that the transaction copy corresponds to the transaction, confirming that the total number of the block outlet nodes of which the number of the corresponding signature certificates is greater than 2/3 passes the verification.
The invention designs a transaction sharing-based consensus block method and a system, firstly, transaction sharing is carried out by using a transaction copy, a signature is generated and stored, the block consensus network bandwidth is dispersed, the traditional POW consensus mechanism is replaced by using double-out block approval verification, a history block is randomly extracted, the block approval is verified, sustainable excitation is carried out, a plurality of transaction transactions are processed in parallel, a plurality of transaction write-in blocks are quickly integrated, and efficient block operation is realized.
Drawings
FIG. 1 is an overall flow diagram of a transaction sharing based consensus block of the present invention;
FIG. 2 is a flow chart of the signature generation and verification process performed by other nodes of the present invention;
FIG. 3 is a block flow diagram of the packaging of transaction transactions according to the present invention;
FIG. 4 is a block-out permit dual verification flow chart of the present invention;
FIG. 5 is a diagram illustrating the parallel processing of multiple transaction transactions using a transaction pool according to the present invention;
FIG. 6 is a diagram of a transaction sharing based consensus block system.
Detailed Description
In order to clearly illustrate the present invention and make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention are clearly and completely described below with reference to the drawings in the embodiments of the present invention, so that those skilled in the art can implement the technical solutions by referring to the description text, and the interactive processes of the specific implementations can be described by using the common asset transaction process as an example, so as to facilitate the understanding of those skilled in the art.
Specific example 1:
and setting that the user Alice sends out a transfer transaction request related to Bob on a chain, wherein N block nodes exist on the chain, and M consensus nodes exist on the chain.
As shown in fig. 1, which is an overall flowchart of a transaction sharing-based consensus block, the specific implementation steps include:
step1, responding the transaction request on the user Alice chain, the N block-out nodes on the block chain compete with each other, and finally the block-out node NiFirstly, constructing a transaction Tx of a user Alice, copying a plurality of copies { Tx } after signing the transaction Tx, and sending the copies { Tx } to other (N-1) out-block nodes on a chain;
step2, the other out-block nodes Sign the received transaction copy { Tx }, form a signature certificate Sign { Tx }, and broadcast the signature certificate on the chain together with the public key PK of the out-block node;
at the same time, node N is out of blockiPacked into Block | Tx | broadcast onto chain transaction TxSending a block output request to the consensus node;
step3, after the consensus node receives the block-out request, it respectively processes the block-out block | Tx | and the block-out node NiAnd performing block-out permission double verification, and after the block-out permission double verification is passed, permitting the block to be identified in common, and finishing the block uplink process.
The block output node Ni constructs a corresponding transaction Tx, signs the transaction, copies a plurality of copies and sends the copies to other block output nodes on the chain, and the method specifically comprises the following steps:
firstly, building a related user building block chain, namely that a user requester Alice and a receiver Bob need to register on the block chain based on a Substate framework to generate respective unique account addresses DA，DBN block-out nodes and M consensus nodes are deployed on the chain and used for running the block chain, each node on the chain generates a respective public and private key pair PK/SK used for signature encryption on the chain, and the nodes participate in the block-out and consensus to obtain incentives to stimulate on-chain requests from users.
Responding to the on-chain transaction request of the user Alice, and outputting a block node NiResolving the transfer transaction request, and integrating the Alice account address D of the requesterAAs a transaction input TxIn, the recipient Bob account address DBAs transaction output TxOut, a transaction Tx is formed, which further includes a transaction timestamp (timestamp) and a transaction hash value (Tx hash) and a block version number V to be writteniI.e. Tx [. TxIn,. TxOut,. timetag,. Tx hash, Vi]；
Where Tx hash is the 16-ary output of SHA256, i.e. a 64-bit string, such as: 8152e25169fde1cd2a81ca794b94a144ff07ae7061d4afe72ae9282a4c654081,
Tx hash＝SHA256(Timestamp+Vi+Payload)
payload refers to specific transaction content, which here includes transaction inputs and outputs and transfer amounts. Whether Timestamp, ViOr Payload, is presented in the form of byte sequences in the actual block, so the "+" in the formula is equivalent to concatenating these sequences. SHA256 function without inverse functionAnd there is little possibility of finding a conflict in the value range, so a change in the input will result in a change in the output.
After generating transaction Tx, block-out node Ni uses private key SK to Sign Sign of transactionskTx, and executes its backup copy command, generating multiple transaction copies { Tx } accompanied by the private key signature Sign of node NiskTx, and distributes to other (N-1) out-block nodes; the command of the backup copy is a cyclic command program written in the block node, when the signed transaction copy exists, the execution command of the backup copy can be automatically started, and the command of the backup copy comprises a file name of the backup copy, a suffix name, a storage path and a storage designated position.
The storage designated position is the account addresses of other block-out nodes, when the transaction copy is generated, the account addresses of other block-out nodes are randomly allocated to be sequentially used as the storage designated position of the backup copy, and the transaction copy is randomly allocated to the account addresses of other block-out nodes, specifically as follows:
the account addresses of all the block outlet nodes on the backup copy command set chain form an account address set { drN1,drN2…drNi…drNAnd when a backup copy command is executed, randomly distributing account addresses in the account address set one by one as a storage designated position of the transaction copy. For example, the execution command for one transaction copy includes transaction file name Tx, suffix name Tx, save path, and randomly allocated save designated location drN2Upon execution of the transaction copy command, a transaction copy { Tx } is generated in the account address of the egress node N2. The account address set is updated in real time according to the change of the number of the block outlet nodes on the block chain.
Here, the private key of the egress node is processed by the SECP256K1 algorithm to generate the public key. The SECP256K1 is an elliptic curve algorithm, a public key can be calculated when a known private key is used, and the private key cannot be reversely calculated when the public key is known; like SHA256, ripemm 160 is also a Hash algorithm, public key Hash can be calculated by a public key, an address version number of one byte is connected to the head of the public key Hash, then SHA256 operation is performed twice on the public key Hash, and the first 4 bytes of the result are used as a check value of the public key Hash and are connected to the tail of the public key Hash.
The account address is obtained by encoding the result of the previous step using BASE 58. For example, 1A1zP1eP5QGefi2 dmptfttl 5SLmv7 DivfNa.
FIG. 2 is a flow chart of signature generation and verification for other nodes, where any one node N in the other nodes is a block output nodejJ ∈ (0, N), signing the received transaction copy to form a signature certificate, and broadcasting the signature certificate on the chain, which is specifically as follows:
other nodes perform hash calculation on the received transaction copies by using a hash function to generate a digital abstract hash { Tx }, and then perform signature on the digital abstract by using a private key to form a signature and verification Signj{ hash { Tx } }, and storing the formed signature Signj{ hash { Tx } } together with public key pkjBroadcast onto the chain.
The out-block node Ni packs the transaction Tx into blocks and broadcasts them to the chain, and issues out-block requests to the consensus node, as shown in fig. 3, including the following:
the block outlet node arranges input and output information of a transaction, a transaction timestamp and a block version number and carries out hash operation to obtain a transaction unique hash value Tx hash, calculates the transaction unique hash value and a final merkle hash root of the hash root of a previous block in the block by using merkle operation, packs the transaction unique hash value and the final merkle hash root into a block, broadcasts the block on a chain, records the block version number and the transaction as a block outlet request to be sent to a chain common identification node, and waits for the common identification to identify the block.
The consensus node obtains the packed block and the block output request on the chain and the signature certificate broadcast by other block output nodes, and performs block output permission double verification, including packed block verification and block output node verification, as shown in fig. 4, which is a block output permission double verification flowchart, specifically as follows:
the packed block verification is as follows:
collecting signature certificate Sign associated with transaction1,2…j{ hash { Tx } }, j ∈ (0, N), and using PK in turnjDeposit certificate Sign for signaturej{ hash { Tx } } decrypts to obtain the transaction copy digest hash { Tx }, and verifies whether the hash { Tx } is identical to the obtained hash (Tx + Sign)skTx) are consistent with each other,
wherein, hash (Tx + Sign)skTx)＝Tx hash+SignskTx hash；
If the transaction copies are consistent with the transaction copies, the transaction copies are confirmed to correspond to the transaction transactions, and after the transaction copies are verified, the signature is recorded and the certificate is stored; if the transaction transactions are inconsistent, the transaction transactions do not correspond, the signature storage certificate is eliminated, the signature storage certificate of the next association is verified, the number N of the corresponding signature storage certificates is counted and confirmed to be {0,1,2, … j }, and the N is larger than the block outlet node N of 2/3, so that block outlet node verification is performed;
the out-of-block nodes are verified as follows:
the current storage chain is set to be V {1,2, … I, … V } blocks, and the block version number of the current outgoing block is set to be ViSelecting any sub-hash h (recall) from a merkle hash root directory in the current block header, associating the sub-hash h (recall) with a corresponding random history block recall, (randomly selecting one from the previous (v-1) blocks) and recording the time stamp t (recall) information of the random front block; selecting any transaction tx in the history block recall, and recording tx hash and Sign of transaction txsktx hash, requiring the current out-of-block node NiSignature verification Sign for providing a copy of transaction txj{ hash { tx } }, and decrypting with the public key to form a digital digest hash { tx }, which is further associated with (tx hash + Sign) }sktx hash), if the two blocks are consistent, the two blocks pass the verification, the block is permitted to be identified together, and if the two blocks do not exist, the block is rejected.
Constructing a plurality of transaction pools in a block output node by using a Frame control, and processing a plurality of transactions in parallel in the plurality of transaction pools by the block output node, wherein the transactions comprise transaction signatures, transaction copy generation and transaction packaging into blocks;
as shown in fig. 5, a plurality of transaction pools exist in the Frame control, the transactions tx (1,2, … n) are processed in parallel, when the number n of transaction transactions is smaller than the maximum capacity of the block, the transactions tx (1,2, … n) are subjected to merkle operation one by one to obtain hash [ tx (1,2, … n) ], the obtained transaction hash value is further subjected to merkle operation to obtain a tree structure finally, and a final merkle root is obtained and used as a parameter to pack all transactions into blocks;
and when the number of the processed transactions is larger than the preset value of the transaction capacity allowed by the block, removing excessive transactions, and carrying out merkle operation on the transactions within the preset value range and packaging the transactions into blocks.
Example 2
Take the example that the user Alice sends out a transfer transaction request related to Bob on the chain, wherein the account addresses are respectively DA＝asdhfeohfecl，DBJdsjflsjjdlc, transfer amount: 5; n block-out nodes and M common nodes are deployed on the chain, and respective public and private key pairs PK/SK are distributed.
The specific operation is as follows:
out-of-block node NiGenerating a transaction Tx [ [ TxIn, TxOut, timemap, Tx hash, V [ ]i]；
Wherein TxIn ═ asdhfeohfecl;
TxOut＝jdsjflsjjdlc；
Tx hash＝SHA256(Timestamp+Vi+Payload)；
out-of-block node NiUsing private key SKiSign encrypted for Tx signatureSKiTx；
A transaction copy execution command is deployed at each block outlet node, and the command is used for collecting account addresses of all the block outlet nodes to form an account address set { drN1,drN2…drNi…drNAnd, initiating the command, generating transaction copies { Tx }, Tx | Sign in the remaining (N-1) out-block node addressesSKiTx；
The remaining (N-1) out-block nodes exist for signing the generated { Tx }, wherein the out-block node NjJ ∈ (0, N) performs hash calculation on the received transaction copy { Tx } to generate a digital digest hash { Tx }, and then uses a private key to Sign the digital digest to form a signature and certificate Signj{ hash { Tx } }, and Signj{hash{Tx}}|pkjBroadcasting;
out-of-block node NiPerforming merkle operation on the Tx hash and the hash root of the previous block to obtain a final merkle hash root, and performing the Tx hash | merkle hash root | ViBroadcasting on the chain;
consensus node pair Tx hash merkle hash root ViPerforming out-of-block double-grant verification:
collecting signature and certificate Sign1,2…j{ hash { Tx } }, using pk in turnjDecrypting to obtain hash { Tx }, and verifying the hash { Tx } -, hash (Tx + Sign) one by oneskTx)＝Tx hash+SignskTx hash; if yes, the number n of signature certificates satisfying the above equation is counted as {0,1,2, … j },
n is greater than 2/3N, performing out-block node verification, and rejecting out-blocks when N is less than 2/3N;
when n is>2/3N, randomly selecting history block recall, selecting any transaction tx in the block recall, and recording tx hash and Sign thereofsktx hash and with the current node NiThe digital digest hash tx providing a copy of the transaction tx is compared,
if hash { tx } -, tx hash + Signskthe Tx hash holds, verifies, grants the V containing TxiAnd if the block is not existed, rejecting the block.
Example 3
Fig. 6 is a schematic diagram of a transaction sharing-based consensus block system, which includes a signature sending module, a signature broadcasting module, a request issuing module, a first verification module, and a second verification module;
the signature sending module is used for responding to an transaction request on a user chain, constructing a corresponding transaction by a block output node on the block chain, signing the transaction, copying a plurality of transaction copies and sending the transaction copies to other block output nodes on the chain;
the signature broadcasting module is configured to: other block-out nodes sign the received transaction copy to form a signature certificate and broadcast the signature certificate on the chain;
the request sending module is configured to: the block-out node packs the transaction transactions into blocks, broadcasts the blocks to the chain, and sends a block-out request to the consensus node;
the first verification module is configured to: the consensus node verifies whether the transaction copy corresponds to the transaction based on the signature verification, and if so, the block node verification is carried out;
the second verification module is configured to: if the block node stores a signature of the transaction copy of the history block, the block is permitted to be identified.
The first authentication module configured to:
verifying the signature certificate associated with the transaction contained in the packaging block, decrypting the signature certificate by using the public key to confirm that the transaction copy corresponds to the transaction, confirming that the total number of the block outlet nodes of which the number of the corresponding signature certificates is greater than 2/3 passes the verification.
The embodiments described above are presented to enable a person having ordinary skill in the art to make and use the invention. It will be readily apparent to those skilled in the art that various modifications to the above-described embodiments may be made, and the generic principles defined herein may be applied to other embodiments without the use of inventive faculty. Therefore, the present invention is not limited to the above embodiments, and those skilled in the art should make improvements and modifications to the present invention based on the disclosure of the present invention within the protection scope of the present invention.

Claims (10)

1. A transaction sharing based consensus block method, comprising the steps of:
responding to an transaction request on a user chain, constructing a corresponding transaction by a block outlet node on the block chain, signing the transaction, copying a plurality of transaction copies, and sending the transaction copies to other block outlet nodes on the chain;
other block-out nodes sign the received transaction copy to form a signature certificate and broadcast the signature certificate on the chain;
the block-out node packs the transaction transactions into blocks, broadcasts the blocks to the chain, and sends a block-out request to the consensus node;
the consensus node verifies whether the transaction copy corresponds to the transaction based on the signature verification, and if so, the block node verification is carried out;
if the block node stores a signature of the transaction copy of the history block, the block is permitted to be identified.
2. The transaction sharing based consensus-identified block method of claim 1, wherein the block-out node and consensus node are deployed in a blockchain implemented based on a Substate framework;
the block output node is used for analyzing a user transaction request, integrating an account address of a user requester as a transaction input, and using a receiver as a transaction output to form a transaction, wherein the transaction also comprises a transaction timestamp, a transaction hash value and a block version number;
the transaction is signed based on a private key, a backup copy command of the transaction is executed, a plurality of transaction copies are generated and distributed to other block output nodes, wherein the backup copy command comprises a backup copy file name, a suffix name, a storage path and a storage designated position, and the transaction copies are accompanied with private key signatures.
3. The transaction sharing based consensus method of claim 2, further comprising, upon executing a backup copy command, the steps of:
and forming an account address set by the account addresses of all the block outlet nodes on the aggregation chain, and randomly distributing the account addresses in the account address set one by one to serve as the storage designated positions of the transaction copies.
4. The transaction sharing-based consensus-recognized block method of claim 1, wherein the other block-out nodes sign the received transaction copy to form a signature certificate and broadcast the signature certificate on the chain, specifically as follows:
and other nodes perform hash transformation on the received transaction copies by using a hash function to generate a digital abstract, then use a private key to sign the digital abstract to form a signature certificate, store the transaction copies held by the other nodes, and broadcast the formed signature certificate and the public key to the chain.
5. The transaction sharing based consensus-identified block method of claim 1, wherein the out-block node packs transaction transactions into blocks to be broadcast onto the chain and issues out-block requests to the consensus node, comprising:
the block outlet node arranges input and output information of a transaction, a transaction timestamp and a block version number and carries out hash operation to obtain a transaction unique hash value, calculates the transaction unique hash value and final merkle hash roots of a plurality of previous transaction hash roots in the block by using merkle operation, packs the transaction unique hash value, the final merkle hash roots and the timestamp into a block and broadcasts the block on a chain;
the sending out of the block request to the consensus node is to additionally request the blockchain version number of the block while the transaction is packed into the block, and to wait for the consensus to recognize the block while broadcasting the blockchain version number together with the packed transaction on the chain.
6. The transaction sharing-based consensus block method according to claim 1, wherein the consensus node verifies whether the transaction copy corresponds to the transaction based on the signature, specifically:
verifying the signature certificate associated with the transaction contained in the packaging block, decrypting the signature certificate by using the public key to confirm that the transaction copy corresponds to the transaction, confirming that the total number of the block outlet nodes of which the number of the corresponding signature certificates is greater than 2/3 passes the verification.
7. The transaction sharing-based consensus-recognized block method of claim 1, wherein if a block node stores a signature of a transaction copy of the history block, specifically:
the consensus node randomly extracts any current history block on the chain and verifies whether the block node stores the signature of the transaction copy of the history block.
8. The transaction sharing based consensus block method of any of claims 1-7, further comprising:
constructing a plurality of transaction pools in a block output node by using a Frame control, and processing a plurality of transactions in parallel in the plurality of transaction pools by the block output node, wherein the transactions comprise transaction signatures, transaction copy generation and transaction packaging into blocks;
when the number of the processed transactions is less than or equal to the preset value of the transaction capacity allowed by the block, the processed transactions are subjected to merkle operation to obtain a final hash root serving as a parameter, and all transactions are packed into blocks;
and when the number of the processed transactions is larger than the preset value of the transaction capacity allowed by the block, removing excessive transactions, and carrying out merkle operation on the transactions within the preset value range and packaging the transactions into blocks.
9. A transaction sharing-based common identification block system is characterized by comprising a signature sending module, a signature broadcasting module, a request sending module, a first verification module and a second verification module;
the signature sending module is used for responding to an transaction request on a user chain, constructing a corresponding transaction by a block output node on the block chain, signing the transaction, copying a plurality of transaction copies and sending the transaction copies to other block output nodes on the chain;
the signature broadcasting module is configured to: other block-out nodes sign the received transaction copy to form a signature certificate and broadcast the signature certificate on the chain;
the request sending module is configured to: the block-out node packs the transaction transactions into blocks, broadcasts the blocks to the chain, and sends a block-out request to the consensus node;
the first verification module is configured to: the consensus node verifies whether the transaction copy corresponds to the transaction based on the signature verification, and if so, the block node verification is carried out;
the second verification module is configured to: if the block node stores a signature of the transaction copy of the history block, the block is permitted to be identified.
10. The transaction sharing based consensus block system of claim 9, wherein the first validation module is configured to:
verifying the signature certificate associated with the transaction contained in the packaging block, decrypting the signature certificate by using the public key to confirm that the transaction copy corresponds to the transaction, confirming that the total number of the block outlet nodes of which the number of the corresponding signature certificates is greater than 2/3 passes the verification.
CN202110529719.4A 2021-05-14 2021-05-14 Transaction sharing-based consensus block method and system Active CN113256417B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110529719.4A CN113256417B (en) 2021-05-14 2021-05-14 Transaction sharing-based consensus block method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110529719.4A CN113256417B (en) 2021-05-14 2021-05-14 Transaction sharing-based consensus block method and system

Publications (2)

Publication Number Publication Date
CN113256417A true CN113256417A (en) 2021-08-13
CN113256417B CN113256417B (en) 2022-07-12

Family

ID=77182135

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110529719.4A Active CN113256417B (en) 2021-05-14 2021-05-14 Transaction sharing-based consensus block method and system

Country Status (1)

Country Link
CN (1) CN113256417B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113495926A (en) * 2021-09-06 2021-10-12 支付宝(杭州)信息技术有限公司 Block output method of block chain network
CN113810378A (en) * 2021-08-19 2021-12-17 广东中科智能区块链技术有限公司 Transaction preprocessing method based on consensus sequencing

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106656974A (en) * 2016-10-17 2017-05-10 江苏通付盾科技有限公司 Block chain grouping consensus method and system
US20180091524A1 (en) * 2016-09-29 2018-03-29 Microsoft Technology Licensing, Llc. Verifiable outsourced ledgers
CN109560939A (en) * 2019-01-29 2019-04-02 张超 A kind of block method and the device out of block chain
WO2020022957A1 (en) * 2018-07-27 2020-01-30 Aioz Pte Ltd Method and apparatus for transaction verification in a blockchain-based network
CN110869967A (en) * 2019-03-28 2020-03-06 阿里巴巴集团控股有限公司 System and method for parallel processing of blockchain transactions
CN110971684A (en) * 2019-11-28 2020-04-07 北京工业大学 PBFT-based block chain network node load balancing method
CN111082943A (en) * 2019-12-06 2020-04-28 西安电子科技大学 Efficient block chain consensus method
US20200167243A1 (en) * 2018-11-28 2020-05-28 International Business Machines Corporation Resource management
US20200202318A1 (en) * 2018-12-21 2020-06-25 Honeywell International Inc. Systems and methods for recording licensing or usage of aviation software products using shared ledger databases
CN112689848A (en) * 2019-06-28 2021-04-20 深圳市网心科技有限公司 Consensus method of block chain data and related equipment

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180091524A1 (en) * 2016-09-29 2018-03-29 Microsoft Technology Licensing, Llc. Verifiable outsourced ledgers
CN106656974A (en) * 2016-10-17 2017-05-10 江苏通付盾科技有限公司 Block chain grouping consensus method and system
WO2020022957A1 (en) * 2018-07-27 2020-01-30 Aioz Pte Ltd Method and apparatus for transaction verification in a blockchain-based network
US20200167243A1 (en) * 2018-11-28 2020-05-28 International Business Machines Corporation Resource management
US20200202318A1 (en) * 2018-12-21 2020-06-25 Honeywell International Inc. Systems and methods for recording licensing or usage of aviation software products using shared ledger databases
CN109560939A (en) * 2019-01-29 2019-04-02 张超 A kind of block method and the device out of block chain
CN110869967A (en) * 2019-03-28 2020-03-06 阿里巴巴集团控股有限公司 System and method for parallel processing of blockchain transactions
CN112689848A (en) * 2019-06-28 2021-04-20 深圳市网心科技有限公司 Consensus method of block chain data and related equipment
CN110971684A (en) * 2019-11-28 2020-04-07 北京工业大学 PBFT-based block chain network node load balancing method
CN111082943A (en) * 2019-12-06 2020-04-28 西安电子科技大学 Efficient block chain consensus method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
储劲松: "基于PBFT算法的动态共识机制研究", 《中国优秀博硕士学位论文全文数据库(硕士)信息科技辑》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113810378A (en) * 2021-08-19 2021-12-17 广东中科智能区块链技术有限公司 Transaction preprocessing method based on consensus sequencing
CN113495926A (en) * 2021-09-06 2021-10-12 支付宝(杭州)信息技术有限公司 Block output method of block chain network

Also Published As

Publication number Publication date
CN113256417B (en) 2022-07-12

Similar Documents

Publication Publication Date Title
Chen et al. Sschain: A full sharding protocol for public blockchain without data migration overhead
JP7221355B2 (en) Method and Apparatus for Distributed Database Containing Anonymous Entries
Zamani et al. Rapidchain: Scaling blockchain via full sharding
Miller et al. The honey badger of BFT protocols
Ruffing et al. Liar, liar, coins on fire! Penalizing equivocation by loss of bitcoins
EP3420669B1 (en) Cryptographic method and system for secure extraction of data from a blockchain
JP6370016B2 (en) Hierarchical network system, node and program used therefor
Kaur et al. Scalability in blockchain: Challenges and solutions
CN106452785A (en) Block chain network, branch node and block chain network application method
WO2020157708A2 (en) Point-to-point distributed decentralized system
CN107171812A (en) It is a kind of based on block chain without key signature infrastructure construction method
CN106845280A (en) A kind of Merkle Hash trees cloud data integrity auditing method and system
CN113256417B (en) Transaction sharing-based consensus block method and system
CN109460405A (en) For the block generation method of block chain network, synchronous method, storage medium, calculate equipment
CN110569246B (en) Block chain node information synchronization method and device, computer equipment and storage medium
CN109743182B (en) Intelligent contract approval method and system based on block chain
JP2018112827A (en) Information processing system
CN112163950A (en) Block chain network construction method and system convenient for expansion and node resource reuse and terminal equipment
CN103067363A (en) Index conversion method for public data integrity checking
CN109840769B (en) Block chain based evidence storing method, device, system and storage medium
CN113626875A (en) Knowledge graph file storage method for block chain fragment enabling
JP2022551874A (en) Method and Apparatus for Secure Symbiosis Mining
Saad et al. Decentralized directed acyclic graph based dlt network
CN115943609A (en) Block propagation for poisoned transactions in block chain networks
Nagayama et al. Trail: a blockchain architecture for light nodes

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant