CN107274159B - Accounting system and method based on block concurrency execution algorithm - Google Patents
Accounting system and method based on block concurrency execution algorithm Download PDFInfo
- Publication number
- CN107274159B CN107274159B CN201710429813.6A CN201710429813A CN107274159B CN 107274159 B CN107274159 B CN 107274159B CN 201710429813 A CN201710429813 A CN 201710429813A CN 107274159 B CN107274159 B CN 107274159B
- Authority
- CN
- China
- Prior art keywords
- transaction
- block
- blocks
- verification
- merck tree
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 64
- 230000008569 process Effects 0.000 claims abstract description 42
- 238000012546 transfer Methods 0.000 claims abstract description 13
- 230000002457 bidirectional effect Effects 0.000 claims abstract description 11
- 238000012795 verification Methods 0.000 claims description 31
- 230000008901 benefit Effects 0.000 abstract description 3
- 230000006872 improvement Effects 0.000 abstract description 2
- 239000003999 initiator Substances 0.000 description 7
- 238000010586 diagram Methods 0.000 description 4
- 230000005540 biological transmission Effects 0.000 description 3
- 230000007246 mechanism Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
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
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/04—Payment circuits
- G06Q20/06—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme
- G06Q20/065—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme using e-cash
-
- 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/08—Payment architectures
- G06Q20/10—Payment architectures specially adapted for electronic funds transfer [EFT] systems; specially adapted for home banking systems
- G06Q20/102—Bill distribution or payments
-
- 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/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
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a billing method and a billing system based on a block concurrent execution algorithm, wherein the method comprises the following steps: step one: adding parallel execution enabling in each transaction block, so that each transaction block can execute transaction flow concurrently, and waiting for a transaction record result of a previous transaction block and a set fixed total time are avoided; setting bidirectional information transfer between each transaction block, enabling each transaction block to conduct transaction simultaneously based on concurrent execution; and thirdly, carrying out a concurrent execution process, and waiting for a previous transaction block to initiate a link by the transaction block for completing the account record work in advance until all the transaction blocks complete the account record. The accounting system and the accounting method based on the block concurrent execution algorithm have the advantages of high resource utilization rate, realization of an accountability accounting mode, improvement of accounting efficiency in multiple levels compared with a traditional accounting mode, and the like.
Description
Technical Field
The invention belongs to the technical field of accounting, and particularly relates to an accounting system and an accounting method based on a block concurrent execution algorithm.
Background
The transaction execution process of the traditional blockchain-like triple billing mode mainly comprises a transaction initiator, a transaction destination, a public key, a private key, a signature, a hash function and the like, transaction communication is carried out through a chained structure for transaction information transfer, and the transaction flow is relatively simple and direct to realize, like a flow chart. In the information transmission method of the chain structure, the transaction flow can be designed and the transaction accounting can be carried out as long as the connection between transaction block nodes, the direction of data transmission, the condition of circulation from one transaction block to the next transaction block and the like are described.
FIG. 1 shows a prior transaction execution information flow diagram, and the prior blockchain-like triple billing transaction model mainly includes the following transaction flows: transaction process, transaction verification and clearing process.
The transaction process mainly comprises a transaction initiator, a transaction destination, a hash function, a signature and the like, wherein the public key of the owner in fig. 1, namely the address of a transaction receiver, is used for indicating who the current transaction targets; signature, which is obtained by connecting the previous transaction data with the public key of the receiver through the initiator, solving the hash value of the data, and encrypting the hash value by using the private key of the initiator; the private key is only known by the person, and is not known by others. The order of occurrence of the transactions can be clearly determined from the figure, and the currency source and destination of the transactions are analyzed. During the transaction, each owner a signs a random hashed digital signature with his private key on the public keys of the former transaction T1 and the next transaction owner B, and the owners a make this data signature into a transaction ticket T2 and broadcast it across the network, and electronic money is sent to the next owners.
In the transaction verification process, firstly, the public key of the initiator A of the transaction in the transaction T2 is utilized to decrypt the signature to obtain an integer x, then the T1 transaction data and the public key of the owner B are connected, the hash value y is calculated by the same hash algorithm, if x=y, the fact that the transaction is initiated by the A is indicated, because the signature can only be generated by the private key of the A, the destination of the transaction is the B, and the initiator is the currency which is obtained by the A in the transaction T1 is sent to the B.
In the transaction clearing process, the time stamp is important, and the time stamp server needs to perform time stamp hashing of the transaction block and widely issue a hash algorithm. Each timestamp contains the previous timestamp and its hash algorithm, by changing the random number in the block continuously, an attempt is made to collide with a block hash value that is satisfactory, once found, a proof of the workload is considered to be completed, the transaction in that block will be recorded in the ledger, the hash value of the last block is put into the next block, forming a chain structure, each additional timestamp will also cover itself, and the transaction process can be verified without running the complete network node. The user only needs to keep a copy of the transaction block header file of the longest proof of work link he can get through the query.
Fig. 2 shows transaction block information including the header of the transaction block, the hash value of the previous transaction, the random value, the hash table root obtained after hash table generalization, and then concatenating the obtained hash branches into the transaction block under the timestamp. The user cannot check his own transaction process but by linking to a place in the chain he can see that a network node has accepted it and add blocks after it has further confirmed that the network has accepted, perform a clearing when the clearing is completed, create a new transaction block, and the transaction process ends.
Fig. 3 shows a conventional transaction execution flow, where each transaction block records transaction information within a few minutes (e.g., 10 minutes), and a new transaction block is generated every 10 minutes for subsequent transaction operations. Taking five transaction blocks as an example, the figure comprises a linear structure consisting of the transaction blocks, transaction information and a clearing process, after the transaction block 1 finishes the transaction information recording, a new transaction block 2 is generated for 10 minutes to record the subsequent transaction information, the transaction flow of the 5 transaction blocks is completed after at least 40 minutes, and the daily transaction information clearing is required to be carried out in a T+1 mode after all transaction operations are completed, so that the efficiency is low.
FIG. 4 is a flow chart of the execution of a transaction block between banks, and the shortcomings are particularly apparent when the conventional transaction process mode is applied to the management of transaction information between banks. In the figure, six bank transaction information flows A-F are displayed. The chain execution method in the traditional transaction process has a certain limitation, namely, the utilization of resources is insufficient, each transaction block is in a single-thread mode in the transaction process, and the next transaction block operation can be performed after a few minutes (for example, 10 minutes) pass after the transaction operation is performed by the last transaction block.
In summary, the conventional triple ledger performs sequential transactions according to the time stamp, transaction information is stored in transaction blocks, the transaction information is generated at a fixed speed, and transactions are processed and distributed along the time stamp, each transaction block records transaction information within several minutes (for example, 10 minutes), a new transaction block is generated after every 10 minutes, and then subsequent transaction operations are performed, wherein a clearing mode adopts a t+1 mode, and the time period is long, so that the efficiency of transaction performance is affected.
Disclosure of Invention
In order to solve the problems in the prior art, the invention provides a billing system and a billing method based on a block concurrency execution algorithm, so as to improve the resource utilization rate and billing efficiency.
In order to achieve the above purpose, the specific technical scheme of the billing system and method based on the block concurrent execution algorithm of the present invention is as follows:
A billing method based on a block concurrency execution algorithm, comprising a transaction process, a transaction verification and a clearing process, comprising the steps of: step one: adding parallel execution enabling in each transaction block, so that each transaction block can execute transaction flow concurrently, and waiting for a transaction record result of a previous transaction block and a set fixed total time are avoided; setting bidirectional information transfer between each transaction block, enabling each transaction block to conduct transaction simultaneously based on concurrent execution; step three, carrying out a concurrent execution process, and waiting for a previous transaction block to initiate a link by the transaction block for completing the account record work in advance until all the transaction blocks complete the account record; step four, after all transaction blocks complete account book records, transaction verification is carried out; and fifthly, carrying out a clearing process according to the transaction verification result.
Further, in step three, after each transaction block is completed, the execution status of the previous transaction block is queried to obtain that all transaction blocks complete the ledger record.
Further, in step four, the merck tree is utilized for transaction verification, so that the transaction verification efficiency is improved, and the uniqueness and authenticity of the transaction source are verified.
Further, the merck tree transaction verification in step four includes the steps of: acquiring the merck tree root of the file from the trusted source, acquiring the merck tree from the trusted source after acquiring the tree root from the trusted source, checking the received merck tree through the tree root acquired from the trusted source, and acquiring another merck tree from other sources if the merck tree is damaged or false until acquiring one merck tree matched with the trusted tree root, thereby verifying the uniqueness and authenticity of the transaction source.
Further, in the merck tree generating process of the fourth step, data are divided into small data blocks, corresponding hashes are corresponding to the data blocks, two adjacent hashes are combined into a character string, then the hashes of the character string are operated to obtain sub hashes, and repeated operation is conducted to obtain new one-stage hashes with smaller number until root hashes are obtained, so that transaction verification efficiency is improved.
Further, in step four, after all transaction blocks complete the account book record, the previous transaction block performs transaction verification by using the merck tree and transmits the transaction verification to the next transaction block so as to complete the transaction verification of all the transaction blocks.
In step one, the transaction information is generated according to the poisson distribution rule, the number of times of transaction is set to be executed according to the poisson distribution, and the generation of the transaction information on each transaction block is made to follow the poisson distribution, so that each transaction block processes the transaction information in parallel.
The invention also provides a billing system based on the block concurrency execution algorithm, which comprises a plurality of transaction blocks, wherein each transaction block is respectively and mutually connected with the parallel execution enabling submodule, and the parallel execution enabling submodule enables each transaction block to execute the transaction flow concurrency, so that the transaction record result of the previous transaction block and the set fixed total time are prevented from waiting.
Further, a bidirectional information transfer module is arranged between each transaction block to ensure bidirectional information transfer between every two adjacent transaction blocks, and each transaction block is enabled to conduct transactions simultaneously based on the concurrent execution enabling module.
Further, the transaction verification module is connected with the transaction blocks, and verifies all the transaction blocks of the parallel completion account book record by utilizing the merck tree so as to improve the transaction verification efficiency and verify the uniqueness and authenticity of the transaction source.
According to the billing system and the billing method based on the block concurrent execution algorithm, the generation of the transaction block is designed by adopting the concurrent execution mode, the multi-thread transaction flow is carried out, the information transfer is carried out between the multi-thread transaction flow and the multi-thread transaction flow, the transaction time can be effectively controlled, the clearing efficiency is improved, and a high-efficiency generation mechanism of the transaction block is provided. Therefore, the mode of generating one transaction block every t minutes (for example, 10 minutes) is improved to the mode of generating n transaction blocks every t minutes (n is greater than 1), concurrent transaction processing is carried out, dynamic period adjustment can be carried out between the front block and the rear block through information transmission, and clearing is carried out by taking t minutes as one period, so that the working efficiency is greatly improved, and the clearing time period is reduced.
The billing system and method based on the block concurrent execution algorithm of the invention mainly have the following advantages:
1) The resource utilization rate is high;
2) Realizing a non-responsible account-recording mode;
3) Compared with the traditional billing mode, the multiple level improves the efficiency;
4) Concurrent execution is applicable to the trend of accounting in the financial industry.
Drawings
FIG. 1 is a flow chart of a conventional transaction execution information;
FIG. 2 is a diagram showing a conventional transaction block information structure;
FIG. 3 is a flow chart of a prior art transaction execution;
FIG. 4 is a flow chart of a prior art block execution of an inter-bank transaction;
FIG. 5 is a block concurrent transaction flow diagram according to the present invention;
FIG. 6 is a flow chart of transaction information management between banks for a block concurrent transaction process application of the present invention;
Fig. 7 is a schematic diagram of a generation mode of the merck tree of the present invention.
Detailed Description
For a better understanding of the objects, structures and functions of the present invention, the billing system and method based on the block concurrency execution algorithm of the present invention will be described in further detail with reference to the accompanying drawings.
As shown in fig. 5, a flow chart of a billing system based on a block concurrency execution algorithm is shown, in the present invention, a parallel execution enable En is added to each transaction block, and since each transaction block contains a plurality of transaction flows, if a single transaction block is executed in a serial mode, the operation occupies space and resources. By adding a concurrency execution enable En in each transaction block, the concurrency execution enable is not only an execution signal, but also a kind of time stamp. On this basis, each transaction block is able to execute the transaction streams concurrently without waiting for the transaction record result of the previous transaction block and a waiting time of a fixed total time T (10 min).
Therefore, by increasing the parallel execution enable En of the transaction blocks, each transaction block can execute the transaction flow concurrently on the basis of the parallel execution enable En, and the transaction record result and the fixed t-minute waiting time of the previous transaction block do not need to be waited, so that the resource utilization rate is greatly improved.
Further, the transaction blocks are set to be in bidirectional information transfer. Fig. 6 shows an example flow of concurrent execution of blocks, and a transaction information management process between banks is described below as an example.
The bidirectional information transfer mode provided by the invention does not depend on the initiator, and each transaction block can be simultaneously transacted without time sequence division due to the existence of concurrent execution enable En. In the concurrent execution process, if the transaction block completes the account book record work in advance, waiting for the former transaction block k to initiate the link until all the transaction blocks complete the account book record, and performing a clearing process.
Therefore, the improvement of the mechanism fully utilizes the 10-minute waiting time delay in the traditional transaction flow, the operation of the accounting book of the transaction blocks is executed concurrently in the time delay process, and the clearing process is carried out when the execution of the transaction blocks is completed, so that the whole time is 10 minutes, and the working efficiency and the resource utilization rate are greatly improved. And in the time period of 10 minutes, each transaction block concurrently executes the transaction process, all nodes are connected in series in a chained mode when the nodes are completed, and a clearing process is performed, so that the efficiency is improved by n times under the condition that n transaction blocks participate.
With the merck tree improved verification flow, fig. 7 shows the generation of the merck tree, which can be regarded as a generalization of the hash table (the hash table can be regarded as a special merck tree, i.e. a multi-fork merck tree with a tree height of 2).
In fig. 7, the bottom layer is the same as the hash list, and we divide the data into small data blocks, and have corresponding hashes and data blocks. However, going upward, instead of directly going to the root hash, two adjacent hashes are combined into a string, and then the hash of the string is calculated, so as to obtain a sub-hash. If the lowest hash count is singular, then a single hash must occur to the end. This case directly hashes it so that its sub-hash can also be obtained. Pushing up, in the same way, a smaller number of new-level hashes can be obtained, and finally, an inverted tree is necessarily formed, and a root hash is left in the generation after the position of the root of the tree is reached.
Because the block header of the transaction block mainly comprises a timestamp, a random number, a source hash, a target hash and a merck tree root, wherein the merck tree root is obtained and generated by performing hash operation on different hash values generated by each layer of transaction information, and the merck tree root is unique and is put into the block header of the transaction block. The characteristics of the trusted comparison process of the merck tree are utilized to ensure that each transaction is not forged and repeated, the source of each transaction block merck root is the hash operation of the transaction information in the last trusted block, the merck tree root of the file is obtained from the trusted source, and then the merck tree matched with the trusted tree root is obtained by comparing with the merck tree obtained from other sources, so that the uniqueness and the authenticity of some previous transaction sources can be verified.
For example, the merck tree root of a file is obtained from a trusted source prior to the p2p network downloading the network. Once the root is obtained, the merck tree may be obtained from other untrusted sources. The received merck tree is checked by a trusted root. If the merck tree is corrupted or false, another merck tree is obtained from another source until a merck tree is obtained that matches the root of the trusted tree.
The main difference between the merck tree and the hash table is that one branch of the merck tree can be downloaded directly and verified immediately. Because the file can be split into small blocks of data, if there is a block of data corruption, only this block of data is re-downloaded. If the file is very large, then both the merck tree and the hash table are large, but the merck tree can download one branch at a time and then verify that branch immediately, if the branch verification passes, then the data can be downloaded, and the hash table can only be verified if the entire hash table is downloaded.
Since the poisson process is a random process with wide application, in the traditional billing system mode, the generation time system of the new transaction block is defined as 10 minutes, the generation mode of the transaction block follows poisson distribution, but the generation mode of the block every 10 minutes cannot be neglected, which causes unpredictable delay in the transaction process, causes time delay of the overall transaction flow or affects the clearing process.
For this purpose, in the present invention, transaction information is generated according to a certain rule, and poisson distribution is applied to represent the arrival process of the transaction information. Specifically, the number of occurrences of a transaction is set to be executed following a poisson distribution, and when the number of occurrences of a transaction follows a poisson distribution, assuming that the time constant for the occurrence of a transaction is τ=1/λ, the time required for the occurrence of one transaction follows an exponential distribution λe -λt. Then, in the total time T (e.g., 10 min), the probability of k transactions occurring satisfies the poisson distribution: k-Pois (λT), it is apparent that the average value of k is λT. The poisson process has stable independent increment, and the parameters are not influenced by time in the special case of the updating process.
Thus, if the clearing period is defined as 10 minutes, in the case that the total time period is 10 minutes, the generation of the transaction blocks no longer follows the poisson distribution, but a plurality of blocks are generated in a concurrent manner, and the transaction information is processed in parallel. On the basis, the generation of the transaction information on each transaction block obeys the poisson distribution, and the method has the advantage of stable independent increment, namely, on the basis of concurrent execution of the blocks, the generation of the transaction information obeys the poisson distribution.
On the other hand, the invention also provides a billing system based on the block concurrency execution algorithm, which comprises a plurality of transaction blocks, wherein each transaction block is respectively and mutually connected with a parallel execution enabling submodule, and the parallel execution enabling submodule enables each transaction block to execute transaction flow in concurrency, so that the transaction record result and the set fixed total time of the previous transaction block are prevented from waiting, and the resource utilization rate and billing efficiency are improved.
Further, a bidirectional information transfer module is arranged between each transaction block so as to ensure bidirectional information transfer between every two adjacent transaction blocks, and on the basis, the concurrent execution enabling module is utilized to enable each transaction block to conduct transaction simultaneously.
In addition, the accounting system also comprises a transaction verification module and a clearing module which are connected with the transaction blocks, wherein the transaction verification module utilizes the merck tree to verify all the transaction blocks of the parallel completed account book record so as to improve the transaction verification efficiency and verify the uniqueness and the authenticity of the transaction source. The clearing module clears the transaction information for completing the transaction verification.
It will be understood that the application has been described in terms of several embodiments, and that various changes and equivalents may be made to these features and embodiments by those skilled in the art without departing from the spirit and scope of the application. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the application without departing from the essential scope thereof. Therefore, it is intended that the application not be limited to the particular embodiment disclosed, but that the application will include all embodiments falling within the scope of the appended claims.
Claims (8)
1. A billing method based on a block concurrency execution algorithm, comprising a transaction process, a transaction verification and a clearing process, characterized by comprising the following steps:
Step one: adding parallel execution enabling in each transaction block, so that each transaction block can execute transaction flow concurrently, and waiting for a transaction record result of a previous transaction block and a set fixed total time are avoided;
Setting bidirectional information transfer between each transaction block, enabling each transaction block to conduct transaction simultaneously based on concurrent execution;
Step three, carrying out a concurrent execution process, and waiting for a previous transaction block to initiate a link by the transaction block for completing the account record work in advance until all the transaction blocks complete the account record;
Step four, after all transaction blocks complete account book records, transaction verification is carried out;
and fifthly, carrying out a clearing process according to the transaction verification result.
2. The accounting method of claim 1, wherein in step three, after each transaction block is completed, the execution state of the previous transaction block is queried to obtain that all transaction blocks complete the ledger record.
3. The billing method of block-based concurrent execution algorithm of claim 1 wherein in step four transaction verification is performed using a merck tree to increase transaction verification efficiency and verify uniqueness and authenticity of transaction source.
4. The billing method of block-based concurrent execution algorithm of claim 3 wherein the merck tree transaction verification in step four comprises the steps of: acquiring the merck tree root of the file from the trusted source, acquiring the merck tree from the trusted source after acquiring the tree root from the trusted source, checking the received merck tree through the tree root acquired from the trusted source, and acquiring another merck tree from other sources if the merck tree is damaged or false until acquiring one merck tree matched with the trusted tree root, thereby verifying the uniqueness and authenticity of the transaction source.
5. The billing method of block concurrent execution algorithm according to claim 3, wherein in the merck tree generation process of step four, data is divided into small data blocks, corresponding hashes and data blocks are corresponded, two adjacent hashes are combined into one character string, then the hashes of the character string are operated to obtain sub hashes, and repeating operation to obtain a smaller number of new-stage hashes until a root hash is obtained, so as to improve transaction verification efficiency.
6. The accounting method of claim 3, wherein in step four, after all transaction blocks complete the account book record, the former transaction block uses the merck tree to perform transaction verification and transmits to the latter transaction block to complete the transaction verification of all transaction blocks.
7. The billing method of block concurrent execution algorithm of claim 1 wherein in step one, transaction information is first generated according to a poisson distribution rule, the number of occurrences of transactions is set to be executed following poisson distribution, and the generation of transaction information on each transaction block is made to follow poisson distribution so that each transaction block processes the transaction information in parallel.
8. A billing system based on a block concurrency execution algorithm comprises a plurality of transaction blocks, and is characterized in that each transaction block is additionally provided with a concurrency execution enable, so that each transaction block can execute a transaction flow in concurrency, and the transaction record result and the set fixed total time of the previous transaction block are prevented from waiting;
a bidirectional information transfer module is arranged between each transaction block to ensure that bidirectional information transfer can be carried out between every two adjacent transaction blocks, and each transaction block is enabled to carry out transaction simultaneously based on the concurrent execution enabling module;
The transaction verification module is connected with the transaction blocks, and verifies all the transaction blocks of the parallel completion account record by utilizing the merck tree so as to improve the transaction verification efficiency and verify the uniqueness and authenticity of transaction sources.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710429813.6A CN107274159B (en) | 2017-06-09 | 2017-06-09 | Accounting system and method based on block concurrency execution algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710429813.6A CN107274159B (en) | 2017-06-09 | 2017-06-09 | Accounting system and method based on block concurrency execution algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107274159A CN107274159A (en) | 2017-10-20 |
| CN107274159B true CN107274159B (en) | 2024-07-12 |
Family
ID=60066581
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710429813.6A Active CN107274159B (en) | 2017-06-09 | 2017-06-09 | Accounting system and method based on block concurrency execution algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107274159B (en) |
Families Citing this family (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107767127A (en) * | 2017-10-23 | 2018-03-06 | 中国联合网络通信集团有限公司 | Exchange information processing method and device in block chain |
| CN108062672B (en) * | 2017-12-07 | 2022-03-18 | 北京泛融科技有限公司 | Flow scheduling method based on block chain intelligent contract |
| CN108053211B (en) * | 2017-12-27 | 2021-04-06 | 北京欧链科技有限公司 | Transaction processing method and device based on block chain |
| CN108462582B (en) * | 2018-02-09 | 2020-03-27 | 北京欧链科技有限公司 | Feedback processing method and device in block chain |
| CN108776897B (en) * | 2018-06-05 | 2020-04-21 | 腾讯科技（深圳）有限公司 | Data processing method, device, server and computer readable storage medium |
| CN108985732B (en) * | 2018-06-08 | 2020-09-04 | 中国地质大学（武汉） | Consensus and account book data organization method and system based on block-free DAG technology |
| CN109472566B (en) * | 2018-09-26 | 2023-09-29 | 平安科技（深圳）有限公司 | Block dynamic generation method, device, computer equipment and storage medium |
| CN109345222B (en) * | 2018-09-26 | 2022-04-26 | 晋商博创（北京）科技有限公司 | Method for settling accounts of digital currency, terminal and machine-readable storage medium |
| CN109409879A (en) * | 2018-10-16 | 2019-03-01 | 广东恒聚互联控股有限公司 | A method of enhancing block chain security performance |
| PL3560144T3 (en) * | 2018-12-21 | 2021-10-25 | Advanced New Technologies Co., Ltd. | Blockchain data protection based on generic account model and homomorphic encryption |
| CN109872142B (en) * | 2019-02-21 | 2023-04-11 | 派欧云计算(上海)有限公司 | Digital asset transaction method based on trusted third party and storage medium thereof |
| CN110334175B (en) * | 2019-04-29 | 2021-06-04 | 山东冰链网络信息科技有限公司 | Zero knowledge proof method, system and storage medium for medical document |
| CN110049067B (en) * | 2019-05-30 | 2021-06-01 | 全链通有限公司 | Transmission method and device of session key and computer-readable storage medium |
| US10778452B2 (en) | 2019-06-03 | 2020-09-15 | Alibaba Group Holding Limited | Blockchain ledger authentication |
| CN112487084B (en) * | 2019-06-03 | 2024-08-09 | 创新先进技术有限公司 | Time service authentication method, device and equipment for block chain type account book |
| CN113139807A (en) * | 2020-01-20 | 2021-07-20 | 国民技术股份有限公司 | Block chain accounting method, electronic equipment and storage medium |
| CN111581214B (en) * | 2020-05-07 | 2023-07-18 | 成都汉为科技有限公司 | Parallel merkle tree construction and verification method applicable to energy block chain |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106406896A (en) * | 2016-09-27 | 2017-02-15 | 北京天德科技有限公司 | Block chain block-building method based on parallel PipeLine technology |
| CN106682984A (en) * | 2016-10-27 | 2017-05-17 | 上海亿账通区块链科技有限公司 | Block chain-based transaction business processing method and system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8566504B2 (en) * | 2007-09-28 | 2013-10-22 | Sandisk Technologies Inc. | Dynamic metablocks |
-
2017
- 2017-06-09 CN CN201710429813.6A patent/CN107274159B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106406896A (en) * | 2016-09-27 | 2017-02-15 | 北京天德科技有限公司 | Block chain block-building method based on parallel PipeLine technology |
| CN106682984A (en) * | 2016-10-27 | 2017-05-17 | 上海亿账通区块链科技有限公司 | Block chain-based transaction business processing method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107274159A (en) | 2017-10-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107274159B (en) | Accounting system and method based on block concurrency execution algorithm | |
| US11799660B2 (en) | Optimizations for verification of interactions system and method | |
| US11750400B2 (en) | Blockchain post-quantum signature scheme | |
| JP7528302B2 (en) | Data transfer control method and system based on integrated block chain | |
| WO2021032138A1 (en) | Consensus method and device based on blockchain system, and system | |
| JP7211943B2 (en) | Method and Apparatus for Distributed Database Enabling Deletion of Events | |
| CN107423961B (en) | Optimization consensus method based on random correlation analysis | |
| CA3037833C (en) | System and method for information protection | |
| CN113329031A (en) | Method and device for generating state tree of block | |
| CN110689349A (en) | Transaction hash value storage and search method and device in block chain | |
| US11468044B2 (en) | Optimizations for verification of interactions system and method using probability density functions | |
| Skidanov et al. | Nightshade: Near protocol sharding design | |
| US20220278854A1 (en) | Unity Protocol Consensus | |
| JP2022551874A (en) | Method and Apparatus for Secure Symbiosis Mining | |
| CN111161078A (en) | One-to-many block chain transfer realization method | |
| Yang et al. | Ubiquitous verification in centralized ledger database | |
| KR102349014B1 (en) | Method and system for building fast synchronizable decentralized distributed database | |
| WO2020073246A1 (en) | Blockchain-based transaction data processing method and device, and storage medium | |
| CN116668135A (en) | Block chain consensus method, system and device participated in by mobile edge equipment | |
| CN113810185B (en) | Anti-trapdoor leakage on-chain data restoration system and method | |
| CN115310137A (en) | Secrecy method and related device of intelligent settlement system | |
| CN113079026B (en) | Block chain system and block chain network resource management method | |
| CN115694811A (en) | Block chain data transmission method and system based on keyless signature | |
| KR20210127231A (en) | Energized Identity based blockchain | |
| Xie et al. | Research on blockchain storage extension based on dht |
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 |