CN112950381A

CN112950381A - Block chain matching exchange

Info

Publication number: CN112950381A
Application number: CN202110342162.3A
Authority: CN
Inventors: 吴思进
Original assignee: Hangzhou Fuzamei Technology Co Ltd
Current assignee: Hangzhou Fuzamei Technology Co Ltd
Priority date: 2016-01-24
Filing date: 2016-01-24
Publication date: 2021-06-11
Also published as: CN105761146B; CN113159948A; CN105761146A

Abstract

When the signed price meets the transaction requirement, the transaction amount accumulation is not larger than the signature amount, and the matching sequence on the same price on the same server is sorted according to the time sequence entering the server. If the users to be matched are respectively located in a plurality of areas with certain network delay, a plurality of area matching centers can be added besides a single full-network matching center, the users can only assign (need to sign) the matching on one server in a certain area to match, and if the matching servers need to be replaced, the matching needs to be realized by hanging the order again after removing the order. The transaction records of the regional matching center deals are sent to the full-network matching center, and the new blocks of the block chain can be directly written in without matching of the full-network matching center.

Description

Block chain matching exchange

Technical Field

The invention relates to the technical field of internet, in particular to technologies such as a block chain, a trading exchange and the like.

Background

1. At present, most exchanges store data in a master-slave backup mode, an effective encryption and verification mechanism is not available, a database is easy to tamper, a plurality of safety monitoring schemes are needed to prevent data tampering, the cost of manpower and material resources is increased, and the data is more harmful if data of internal personnel are counterfeited.

2. Funds generally need to be cleared before being collected on the day, and the funds cannot be traded for 24 hours due to safety problems.

3. Data transmission is generally not encrypted and verified, and transaction instructions are easy to tamper.

4. At present, no mature blockchain exchange case exists, the function is incomplete, and the performance needs to be improved.

Disclosure of Invention

The invention aims to replace a centralized exchange with a blockchain exchange, each transaction instruction is signed by a user with a private key of the user, the transaction instruction cannot be tampered in the transmission process, a blockchain distributed storage mode is adopted in a historical database, a synchronous verification mechanism is adopted, and even internal personnel cannot modify historical transaction data.

The scheme better solves the matching transaction mode of one-to-many and many-to-many on the block chain, optimizes the data comparison technology, reduces data omission, accelerates the data synchronization speed, increases the regional matching center server and reduces the influence of network delay of different regions on the transaction.

The technical scheme adopted by the invention is as follows: the block chain exchange orders are signed by the user, the quantities can not be completely matched, the requirements are stipulated, when the signed prices meet the transaction requirements, the accumulated quantity of the transactions is not larger than the quantity of the signatures, and the matching sequence on the same price on the same server is sorted according to the time sequence entering the server.

Each server receives a transaction request, because of time difference, the same order price and uncertain sequencing positions of different servers, in order to ensure the transaction efficiency, one server can be selected as a unique full-network matching center according to a certain rule or randomly, after the matching of each new block is finished, the matching result is packaged and broadcasted to other servers, and after the verification of other servers is passed, the new block is added locally.

In order to improve the efficiency of data synchronization, a user can change a hash value by converting a random number, the user can select certain preposed numbering machines, can stipulate certain bits of a transaction hash value to distribute number segments in a segmented mode, the certain bits of the hash value are used as non-repeated numbers in the same block, the numbers of the hash value are recorded by bitmaps, the transaction data are transmitted to another server and then are sequenced by the bitmap method, new bitmaps are generated, and after the bitmaps of the two servers are compared, bitmaps formed by the missed transaction numbers of the data can be immediately known to request for downloading and supplementing.

If the users to be matched are respectively in a plurality of areas with time delay in the network, a plurality of area matching centers can be added besides one full-network matching center, the users can assign a certain area matching center to be matched, each user can only assign (need to sign) one server in a certain area to match a deal, and if the matching servers need to be replaced, the matching is realized by withdrawing the order and then hanging the order again. The transaction records of the regional matching center are sent to the full-network matching center, the new blocks of the block chain can be directly written in without matching of the full-network matching center, and if the matching center specified by a certain order changes, the matching center specified by the certain order is defaulted and transferred to a new matching center server.

Each server scores surrounding servers according to communication conditions (considering bandwidth and network delay) with the surrounding servers, for example, 5, 4, 3, 2 and 1 points, the server with the highest score (one of the servers is randomly selected if the server with the highest score is the same) is selected as a full-network matching center server, the server with the highest score statistics (such as the first 30% of the servers in proportion) is selected as a regional matching center server, and the server with the highest average value is selected as a regional matching center server.

The block chain matching exchange can not only carry out matching transaction in a multi-area center, but also place different transaction varieties on different servers to carry out matching transaction, but because the fund balance cannot be checked on a plurality of servers at the same time, a user still needs to designate one (or default) server to carry out fund balance check, and then the fund balance check can be sent to the matching centers of corresponding different varieties.

Compared with the prior art, the invention has the beneficial effects that:

the scheme better solves the matching transaction mode of one-to-many and many-to-many on the block chain, optimizes the data comparison technology, reduces data omission, accelerates the data synchronization speed, increases the election of regional matching center servers and reduces the influence of network delay of different regions on the transaction.

Drawings

FIG. 1 is a block chain showing how a match transaction of multiple signed orders is implemented;

FIG. 2 is a flow diagram illustrating the use of bitmaps versus synchronized transaction data;

FIG. 3 is a diagram illustrating how a network matching center server is selected;

fig. 4 shows that each server scores surrounding servers according to the communication conditions with the surrounding servers (considering bandwidth and network delay).

Example 1. referring to the accompanying figure 1 of the specification,

this embodiment illustrates how to implement a match transaction of signed orders on the blockchain:

Step S1: user a purchases 300 shares of stock, price 15 dollars,

user B sells 200 shares of stock, price 15 yuan,

c user orders to buy 500 shares of stock, price 15 yuan,

user order sells 200 shares of stock, price 15 yuan,

e user orders to sell 300 shares of stock, 15 dollars in price,

the server receives a signature (user private key signature) attached to the user in each transaction, and agrees that the number of future pairs cannot be accumulated more than the preset number in the signature, wherein each transaction does not specify a transaction opponent.

A. B, C, D, E the order of the user's order on a server is sorted by chronological order of entry into the server for the same price.

Each order will check that the amount accumulated by each user must not exceed its own available fund balance or available stock balance before entering the match queue.

Step S2: the order A appears earliest, the order B appears 2 nd, the prices of the two orders are the same, the buying and selling directions are opposite, and all 200 shares of the order B and 200 shares of 300 shares of the order A are paired to form a deal.

The record of the deal is:

paying 200 shares of B to A

3000 yuan (200 x 15) of A is paid to B

Step S3: after the last step, the order A has 100 shares left and has not been traded, then the turn is to the D user for pairing, the D user sells 100 shares in 15 yuan, the deal with the order A has 100 shares left, the D user sells 100 shares in 15 yuan, and the deal with the order C has 100 shares.

The transaction records are:

d100 shares paid to A

1500 yuan (100 x 15) of A to D

D100 shares payment to C

1500 yuan (100 x 15) of C to D

Step S4: after the last step, the C order has 400 shares left without bargaining, and then the E user is paired, and the E user sells 300 shares in 15 Yuan to bargain with the C order.

The record of the deal is:

e300 shares payment to C

4500-ary (300 × 15) of C pays to E

Step S5: if the C user wants to cancel 100 deals which have not been committed, a deleting instruction (needing signature) is sent, the server withdraws the C orders which have not been committed out from the matching queue after receiving the instruction, and the committed part cannot be cancelled.

Example 2. referring to figure 2 of the drawings,

the flow of using bitmaps versus synchronized transaction data is illustrated. Scene, the front-end node A selects 10 ten thousand transactions (1e5) with non-repeated numbers, and the node server B synchronizes the transaction orders of the front-end server node A. Step S1 node A uses 18 bits (2^18>2^17>1e5, but 18 bits of bitmap is more time efficient) bitmap A, which can be computed with https:// github.

bitNum:＝uint(18)

A:＝bitset.New(2^bitNum)

And taking the first 18-bit integer (binary system) of each transaction hash value (32 bytes and 256 bits), putting the integer into the bitmap A, ensuring that the position of the bitmap corresponding to each transaction is unique, and if the position is set, transforming the transaction random number and regenerating the hash value.

Step S2, node a sends 10 ten thousand transactions to node B, and finally sends bitmap a to node B.

And step S3, the node B generates the bitmap B according to the step S1 from the received transaction, compares the bitmap A with the bitmap B, and if the bitmap A is equal to the bitmap B, the process is finished. Otherwise, marking the missing transaction, generating a bitmap C, and sending the bitmap C to the node a. C: difference (B).

And step S4, the node A finds out the transaction of the position corresponding to the bitmap C and sends the transaction to the node B. Step S5, repeat step S3, step S4.

Example 3. referring to the description of fig. 3, fig. 4,

each server scores surrounding servers according to communication conditions (considering bandwidth and network delay) with the surrounding servers, for example, 5, 4, 3, 2 and 1 points, and a certain server with the highest score is selected as a full-network matching center server, wherein the total score of the number 8 server is 46 points, the server with the highest total score is the server with the highest total score in all servers, and the server is easily selected as the full-network matching center server.

The server with the highest score statistics (e.g., the first 30%) is selected as the regional match center server. Here, if the top 3 servers with the highest scores are obtained, 4, 6, and 8 are all selected as the regional matching center servers, and since 8 is already the full-network matching center server, 4 and 6 are selected as the regional matching center servers.

Since neither the network-wide nor the regional match server is fixed, once the user-specified center has changed, the right to pair the transaction can be transferred by default to the next selected match center, and the only route on the blockchain that needs to be indicated for the transfer is agreed upon.

And the regional matching center server is added, so that the influence of network delay of different regions on the transaction can be reduced.

Claims

1. A block chain matching exchange is characterized in that in order to improve the efficiency of data synchronization, a user can change a hash value by converting random numbers, can select some preposed queuing machines and can stipulate some bit segmentation distribution number segments of the transaction hash value, some bits of the hash value are used as non-repeated numbers of a uniform block, the numbers of the batch of hash values are recorded by a bitmap, the transaction data are transmitted to another server and then are sequenced by the bitmap method to generate a new bitmap, and after the bitmaps of the two servers are compared, a bitmap formed by the missed transaction numbers of the data can be immediately obtained to request for downloading and supplementing.