Block link matching exchange
A blockchain and exchange technology, applied in the Internet field, can solve problems such as databases are easy to be tampered with, data fraud hazards, and functions are not perfect, and achieve the effects of speeding up data synchronization, optimizing data comparison technology, and reducing data omissions
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0020] Embodiment 1, with reference to specification sheet figure 1 ,
[0021] This example illustrates how to realize the matching transaction of signed multiple orders on the blockchain:
[0022] When each server receives a transaction request, due to time differences, the order price is the same, and the ordering position of different servers is uncertain. In order to ensure transaction efficiency, one of the servers can be selected according to certain rules or randomly as the only one of the entire network Matching center, after this server completes the matching of each new block, it packs the matching result and broadcasts it to other servers. After the other servers pass the verification, they add new blocks locally.
[0023] Step S1: User A orders to buy 300 shares at a price of 15 yuan,
[0024] User B orders to sell 200 shares at a price of 15 yuan,
[0025] User C orders to buy 500 shares at a price of 15 yuan,
[0026] User D orders to sell 200 shares at a pri...
Embodiment 2
[0044] Embodiment 2, with reference to specification sheet figure 2 ,
[0045] Describe the process of using bitmaps to compare and synchronize transaction data. Scenario: 100,000 (1e5) transactions with non-repeated numbers are selected by the front node A, and the node server B synchronizes the transaction orders of the front server node A. Step S1: Node A uses 18-bit (2^18>2^17>1e5, but 18-bit bitmap is more time-efficient) bitmap A, and can use https: / / github.com / willf / bitset to calculate the bitmap .
[0046] bitNum:=uint(18)
[0047] A:=bitset.New(2^bitNum)
[0048] Take the first 18 integers (binary) of each transaction hash value (32 bytes, 256 bits) and put it into bitmap A to ensure that the position of the bitmap corresponding to each transaction is unique. If the position has been set, the transaction will be changed randomly number to regenerate the hash value. Step S2: Node A sends 100,000 transactions to Node B one after another, and finally sends bitmap ...
Embodiment 3
[0050] Embodiment 3, with reference to specification sheet image 3 , with Figure 4 ,
[0051]Each server scores the surrounding servers according to the communication status with the surrounding servers (considering bandwidth and network delay), such as 5, 4, 3, 2, 1 points, and the server with the highest score will be selected as the network matching center server , here server No. 8 has a total score of 46 points, which is the server with the highest total score among all servers, and can easily be selected as the matchmaking center server of the entire network.
[0052] The server with the highest score statistics (such as the top 30%) and the server with the highest average value will be selected as the regional matching center server. Here, if the top 3 servers with the highest scores are obtained, 4, 6, and 8 will be selected as the regional matching center server, because 8 is already the whole network matching center server, so 4 and 6 will be selected as the regi...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com