CN110417917B - Method, system, computer device and medium for ticket circulation - Google Patents

Method, system, computer device and medium for ticket circulation Download PDF

Info

Publication number
CN110417917B
CN110417917B CN201910795110.4A CN201910795110A CN110417917B CN 110417917 B CN110417917 B CN 110417917B CN 201910795110 A CN201910795110 A CN 201910795110A CN 110417917 B CN110417917 B CN 110417917B
Authority
CN
China
Prior art keywords
sub
network
ticket
bill
information
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
Application number
CN201910795110.4A
Other languages
Chinese (zh)
Other versions
CN110417917A (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.)
Jingdong Technology Holding Co Ltd
Original Assignee
JD Digital Technology Holdings 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 JD Digital Technology Holdings Co Ltd filed Critical JD Digital Technology Holdings Co Ltd
Priority to CN201910795110.4A priority Critical patent/CN110417917B/en
Publication of CN110417917A publication Critical patent/CN110417917A/en
Application granted granted Critical
Publication of CN110417917B publication Critical patent/CN110417917B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06—Management of faults, events, alarms or notifications
    • H04L41/0654—Management of faults, events, alarms or notifications using network fault recovery
    • H04L41/0663—Performing the actions predefined by failover planning, e.g. switching to standby network elements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1044—Group management mechanisms 
    • H04L67/1051—Group master selection mechanisms
    • 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 present disclosure provides a method for ticket circulation, which is applied to a master node of a first sub-network including a plurality of first nodes including the master node, the plurality of first nodes corresponding to a plurality of ticket transfer platforms, and a second sub-network including a plurality of second nodes corresponding to a plurality of ticket posting banks, the method including: receiving ticket information from a ticket holder, the ticket holder being one of a plurality of clients; broadcasting the ticket information to the first sub-network; responding to the change of the ticket holder from one client to another client, acquiring a transaction record, performing first verification, and generating a block containing the transaction record after the first verification is passed; and sending the block to the second sub-network for second verification, and adding the block to a block chain after the second verification is passed. The present disclosure also provides a system for ticket circulation, a computer device and a computer readable storage medium.

Description

Method, system, computer device and medium for ticket circulation
Technical Field
The present disclosure relates to the field of computer technology, and more particularly, to a method, system, computer device, and medium for bill circulation.
Background
The bills (such as commercial acceptance draft and the like) are used as important sources for small and medium-sized micro-enterprises to obtain liquidity funds, play an important role in the multilevel capital market of China, and play an increasingly important role. The bill circulation process mainly comprises bill issuing, endorsement of a contractor, bill transfer and bill cashing or expiration acceptance.
At present, the efficiency of a bill circulation system is low, and a large amount of time and system resources are occupied by multiple execution and confirmation of an endorsement process, so that the overall development of bill services is difficult.
There is no better technique in the prior art to solve the above technical problems.
Disclosure of Invention
In view of the foregoing, the present disclosure provides an improved method and system for ticket circulation.
One aspect of the present disclosure provides a method for ticket circulation, which is applied to a master node of a first sub-network, the first sub-network and a second sub-network forming a block chain network, the first sub-network including a plurality of first nodes including the master node, the plurality of first nodes corresponding to a plurality of ticket transfer platforms, and the second sub-network including a plurality of second nodes corresponding to a plurality of ticket posting banks. The method comprises the following steps: receiving ticket information from a ticket holder, the ticket holder being one of a plurality of clients; broadcasting the ticket information to the first sub-network, and pushing the ticket information to the plurality of clients by one or more first nodes in the first sub-network; and responding to the change of the ticket holder from the client to another client in the plurality of clients, acquiring a transaction record which represents the circulation of the ticket from the client to the other client, performing first verification, and generating a block containing the transaction record after the first verification is passed; and sending the block to the second sub-network for second verification, and adding the block to a block chain after the second verification is passed.
According to an embodiment of the present disclosure, the ticket information includes: summary information, content information, and a digital signature of the one client. The summary information includes at least one of: the bill payment method comprises the steps of bill amount, bill drawer identification information and bill holder identification information, wherein the abstract information further comprises the bill holder endorsement information under the condition that the bill is endorsed by a receiver, and the abstract information further comprises the endorsement information of the previous bill holder under the condition that the previous bill holder exists. And/or the content information comprises at least one of: the method comprises the following steps of acquiring ticket encryption information, account information of a ticket issuer, account information of a ticket holder and ticket identification information, wherein the ticket encryption information comprises the discount rate information of the ticket.
According to an embodiment of the present disclosure, the broadcasting the ticket information to the first sub-network includes: verifying the authenticity of the bill information; and broadcasting the ticket information to each first node of the first subnetwork for storage if the ticket information is true.
According to an embodiment of the present disclosure, if the plurality of second nodes of the second sub-network includes a master node, the sending the block to the second sub-network for second verification, and adding the block to the block chain after the second verification is passed includes: sending the block to a main node of the second sub-network, performing second verification on the block by the main node of the second sub-network, and adding a second verification result to the block; and adding the block containing the second verification result to the block chain.
According to an embodiment of the present disclosure, the master node of the first sub-network during any time period is specified by a bearer during said any time period. And/or the primary node of the second sub-network during any time period is determined based on a RAFT consensus algorithm.
According to the embodiment of the disclosure, when the master nodes of the second sub-network in two adjacent time periods are the same node, the master node is determined from the second sub-network again based on the RAFT consensus algorithm.
According to an embodiment of the present disclosure, the first sub-network further comprises a first hot standby node, the master node of the first sub-network being replaced with the first hot standby node when the master node of the first sub-network fails. And/or the second sub-network further comprises a second hot standby node, and when the master node of the second sub-network fails, the master node of the second sub-network is replaced by the second hot standby node.
Another aspect of the present disclosure provides a system for ticket circulation, including a first sub-network including a plurality of first nodes corresponding to a plurality of ticket transfer platforms, the plurality of first nodes including a master node of the first sub-network, and a second sub-network including a plurality of second nodes corresponding to a plurality of ticket discount banks. A master node of a first sub-network receives ticket information from a ticket holder, wherein the ticket holder is one of a plurality of clients and broadcasts the ticket information to the first sub-network; one or more first nodes in a first sub-network push the ticket information to the plurality of clients; the main node of the first sub-network responds to the change of the ticket holder from the client to another client in the plurality of clients, acquires a transaction record which represents the transfer of the ticket from the client to the other client, performs first verification, generates a block containing the transaction record after the first verification is passed, and sends the block to the second sub-network; one or more second nodes in a second sub-network perform second verification on the transaction record; and the first sub-network and the second sub-network join the block to the block chain after the second authentication passes.
Another aspect of the present disclosure provides a computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the method as described above when executing the program.
Another aspect of the present disclosure provides a computer-readable storage medium storing computer-executable instructions for implementing the method as described above when executed.
Another aspect of the disclosure provides a computer program comprising computer executable instructions for implementing the method as described above when executed.
According to an embodiment of the present disclosure, a blockchain network is designed that includes a first sub-network and a second sub-network, wherein each node in the first sub-network corresponds to a ticket transfer platform and each node in the second sub-network corresponds to a bank. The transfer requirement of the bill is notified to each client through the first sub-network, and when the bill transfer process occurs, the block chain can be stored after the corresponding transaction records are subjected to double verification of the first sub-network and the second sub-network, so that the authenticity, safety and no tampering of transaction data are ensured, and each party of the block chain network and each client which can be in communication with the block chain network can timely know the latest dynamic and related information of the bill transfer, so that the efficiency of the bill transfer process is improved.
Drawings
The above and other objects, features and advantages of the present disclosure will become more apparent from the following description of embodiments of the present disclosure with reference to the accompanying drawings, in which:
FIG. 1 schematically illustrates an exemplary system architecture for applying the method and system for ticket circulation in accordance with an embodiment of the present disclosure;
FIG. 2 schematically illustrates a flow diagram of a method for ticket circulation, in accordance with an embodiment of the present disclosure;
FIG. 3A schematically illustrates an architecture diagram for a note flow process in accordance with an embodiment of the disclosure;
FIG. 3B schematically illustrates a schematic diagram of a ticket diversion process according to an embodiment of the present disclosure;
FIG. 4 schematically illustrates a block diagram of an apparatus for ticket circulation, in accordance with an embodiment of the present disclosure;
FIG. 5 schematically illustrates a block diagram of an apparatus for ticket circulation, according to another embodiment of the present disclosure; and
FIG. 6 schematically shows a block diagram of a computer device according to an embodiment of the disclosure.
Detailed Description
Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the description is illustrative only and is not intended to limit the scope of the present disclosure. In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present disclosure.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The terms "comprises," "comprising," and the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components.
All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.
Where a convention analogous to "at least one of A, B and C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B and C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.). Where a convention analogous to "A, B or at least one of C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B or C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.).
Embodiments of the present disclosure provide a method and system for ticket circulation. The method comprises a bill information receiving stage, a bill information disclosing stage, a first verification stage, a block generating stage, a second verification stage and a chain linking stage. In the stage of receiving the bill information, the bill information from one client currently used as a bill holder is received, the stage of disclosing the bill information is entered, the bill information is broadcasted in the range of the first sub-network, so that each client which can communicate with the first sub-network can obtain the bill information, and thus the bill circulation activities such as bill purchasing under the line can be carried out. When bill circulation occurs, namely, a bill holder is changed from one client to another client, a first verification stage is entered, a transaction record representing the bill circulation process is obtained, and first verification is carried out on the transaction record. And entering a block generation stage after the first verification is passed, and generating a block containing the transaction record. And then entering a second verification stage, and sending the block to a second sub-network for second verification. And entering a final uplink stage after the second verification is passed, and adding the blocks containing the transaction records into the block chain.
Fig. 1 schematically illustrates an exemplary system architecture 100 to which the methods and systems for ticket circulation may be applied, according to embodiments of the present disclosure. It should be noted that fig. 1 is only an example of a system architecture to which the embodiments of the present disclosure may be applied to help those skilled in the art understand the technical content of the present disclosure, and does not mean that the embodiments of the present disclosure may not be applied to other devices, systems, environments or scenarios.
As shown in fig. 1, the system architecture 100 is specifically a block chain Network (Blockchain Network)100, where the Blockchain Network 100 may include nodes 101 to 106, and the nodes 101 to 106 commonly maintain a Blockchain (Blockchain) 110.
The nodes 101 to 106 may be various computing nodes with the same or different computing capabilities, such as a personal computer, a network server, a database server, a smart phone, and the like, which are not limited herein. Any two nodes in the nodes 101-106 can perform point-to-point communication.
Block chain 110 is a distributed database of blocks (blocks) linked in chronological order by hash pointers. Blocks of the block chain are added according to the time sequence, when a preset condition is met, each node in the block chain network allows a current node to create the block and add the block into the block chain, and the added block is used as the current latest block on the block chain. At a particular time, the current latest block obtained from the block chain by the node maintaining the same block chain is the same.
It should be understood that the size and type of blockchain network, the number of nodes, the length of blockchain, the number of blocks, etc. in fig. 1 are merely illustrative. According to actual needs, there may be any size and type of blockchain network, any number of nodes, any length of blockchain, any number of blocks, etc., and this is not a limitation here.
FIG. 2 schematically shows a flow diagram of a method for ticket circulation, in accordance with an embodiment of the present disclosure. The method is applied to a blockchain network which comprises a first sub-network and a second sub-network, wherein the first sub-network comprises a plurality of first nodes corresponding to a plurality of bill transfer platforms, the plurality of first nodes comprise a master (Leader) node of the first sub-network, and the second sub-network comprises a plurality of second nodes corresponding to a plurality of bill presentment banks.
As shown in fig. 2, the method includes receiving ticket information from a ticket holder in operation S201.
The ticket holder refers to a client currently serving as a ticket holder, the current ticket holder is one of the clients, and a user of the client currently serving as the ticket holder is a user currently holding a ticket. For example, the plurality of clients include a client a, a client B, and a client C, the client a acts as a ticket holder when a ticket is held by a user of the client a, and the ticket holder is changed from the client a to the client B when the ticket is transferred from the user of the client a to the user of the client B. The present operation S201 receives ticket information from a client currently acting as a ticket holder, and when a client acting as a ticket holder issues ticket information describing information on a ticket generated until the current time to a master node of a first sub-network, it indicates that a user of the client acting as a ticket holder desires to transfer the corresponding ticket.
In operation S202, the ticket information is broadcasted to the first sub-network, and the ticket information is pushed to the plurality of clients by one or more first nodes in the first sub-network.
The master node of the first sub-network broadcasts the bill information from the current bill holder to one or more first nodes in the first sub-network, any first node can store the bill information locally after receiving the bill information and pushes the bill information to a client corresponding to the first node, and then a user of the corresponding client can know that the bill corresponding to the bill information is in a state to be transferred, the bill holder, a historical state and other related information. So that users of other clients than the ticket holder can request ticket transfer from the user currently holding the ticket, if necessary.
In operation S203, in response to the change from the client to another client in the plurality of clients by the ticket holder, acquiring a transaction record representing a ticket flowing from the client to the other client, performing a first verification, and generating a block containing the transaction record after the first verification is passed; and sending the block to the second sub-network for second verification, and adding the block to a block chain after the second verification is passed.
When the ticket is transferred from the user of the client A to the user of the client B, the ticket holder is changed from the client A to the client B, namely, an event that the ticket holder is changed from one client to another client occurs. At this time, according to the present operation S203, the master node of the first sub-network obtains the transaction record representing the ticket flow from the client a to the client B, performs the first verification on the transaction record, and generates a block containing the transaction record if the first verification indicates that the ticket flow process is preliminarily determined to be true. And sending the block to a second sub-network formed by the bank nodes for second verification, and adding the block into a block chain maintained by the block chain network if the second verification shows that the bill circulation process is finally determined to be true. Further, after operation S203 is finished, the client B is used as the current ticket holder, and if the user of the client B wishes to transfer the ticket continuously, the above operations S201 to S203 are repeatedly performed until the ticket circulation process is terminated.
It can be seen that the method shown in fig. 2 contemplates a blockchain network comprising a first sub-network and a second sub-network, wherein each node in the first sub-network corresponds to a ticket transfer platform and each node in the second sub-network corresponds to a bank. The transfer requirement of the bill is notified to each client through the first sub-network, and when the bill transfer process occurs, the block chain can be stored after the corresponding transaction records are subjected to double verification of the first sub-network and the second sub-network, so that the authenticity, safety and no tampering of transaction data are ensured, and each party of the block chain network and each client which can be in communication with the block chain network can timely know the latest dynamic and related information of the bill transfer, so that the efficiency of the bill transfer process is improved.
In an embodiment of the present disclosure, the ticket information may include: summary information, content information, and a digital signature of the one client as the current ticketing party. Wherein, the summary information of the bill information comprises at least one of the following items: the bill amount, the ticket issuer identification information, and the ticket holder identification information. Specifically, in the case that the current bill is endorsed by the accepting party, the corresponding summary information also comprises the endorsement information of the accepting party. In the case where there is a previous ticket holder, the summary information also includes endorsement information of the previous ticket holder. And/or the content information of the ticket information comprises at least one of the following items: the method comprises the steps of acquiring ticket encryption information, account information of a ticket issuer, account information of a ticket holder and ticket identification information, wherein the ticket encryption information comprises discount rate information of a ticket and the like.
For example, client B generates ticket 1, which is the drawer of ticket 1, and client a is the current ticket holder if client a currently holds ticket 1 by its user. The process of the client A generating the current bill information of the bill 1 comprises the following steps: the client a generates a triplet (ticket encryption information, account information of the drawer, account information of the ticket holder) about the ticket 1. The bill 1 is an electronic bill, the bill source link is a circulation object, and the bill encryption information refers to interest rate information of bill discount and needs to be encrypted; the method for editing the abstract information of the plaintext of the triple by the ticket holder comprises the following steps: the method comprises the steps that the bill amount, the name of a ticket issuer and the name of a ticket holder are obtained, meanwhile, the bill information is signed by the ticket holder through a private key of the ticket holder, the bill information containing the digital signature of the ticket holder is obtained, and a message containing the bill information is broadcasted to a first sub-network.
In an embodiment of the present disclosure, the broadcasting the ticket information to the first sub-network may include: verifying the authenticity of the bill information; and broadcasting the ticket information to each first node of the first subnetwork for storage if the ticket information is true.
For example, a ticket transfer platform, currently being the master node of the first sub-network, may perform authentication of tickets held by the current ticket holder by interacting with an existing common Electronic Commercial Draft System (ECDS) under the chain, namely, the verification of the corresponding bill information is completed, if the verification result shows that the bill information is true, the verification result is written into the bill information issued by the current ticket holder to generate quadruplets (bill encryption information, verification result, account information of the ticket issuer, account information of the ticket holder), the ticket transfer platform signs the message with its own private key ((ticket encryption information, verification result, account information of the issuing party, account information of the holding party), digital signature of the ticket transfer platform), and broadcasts the message to other first nodes of the first sub-network, so that the message can be pushed to each client.
In one embodiment of the disclosure, the plurality of first nodes of the first subnetwork includes a master node, referred to as a platform Leader node. The plurality of second nodes of the second sub-network also comprises a master node, called a bank Leader node. Optionally, the platform Leader node in any time period is specified by the ticket holder in the any time period. And/or the bank Leader node in any time period is determined based on a RAFT consensus algorithm.
It can be seen that the manner in which the first sub-network determines the primary node is different from the conventional RAFT consensus algorithm, in that the platform Leader node is specified by the ticket holder, rather than electing from Candidate (Candidate) nodes. Namely, at which bill transfer platform the bill transaction occurs, the first node corresponding to the bill transfer platform is used as the current platform Leader node for carrying out billing, and the other first nodes in the first sub-network are used as slave (Follower) nodes corresponding to the bill transfer platform in a non-transaction state.
The mode of determining the main node by the second sub-network is largely consistent with the traditional RAFT consensus algorithm, such as the selection of the Leader node of the bank, the state conversion and the like, which are all generated by election. However, in order to improve the security of the scheme for bill circulation according to the embodiment of the present disclosure, it is necessary to avoid a situation that a second node corresponding to a certain bank is always a bank Leader node, and further avoid too much concentration of the accounting right, as an optional embodiment, the scheme designs the following parts different from the conventional RAFT consensus algorithm: and when the master nodes of the second sub-network in two adjacent time periods are the same node, determining the master node from the second sub-network again based on the RAFT consensus algorithm. This process can be referred to as: leader lifecycle management. For example, the bank Leader node selection mechanism is started once every T period, so that when the platform Leader nodes account for each time, the bank Leader nodes that account for synchronously are different, and if the selected bank Leader node goes down, the selected bank Leader node is reselected until a qualified bank Leader node is generated. In order to avoid cheating, if the corresponding node of the same bank is continuously selected as a bank Leader node twice in two adjacent T, the election is considered invalid, and the RAFT consensus algorithm is restarted until a legal bank Leader node is selected.
On this basis, in an embodiment of the present disclosure, the sending, by the master node of the first sub-network, the generated block containing the transaction record to the second sub-network for second verification, and adding the block to the block chain after the second verification is passed may include: sending the block to a main node of a current second sub-network, performing second verification on the block by the main node of the second sub-network, and adding a second verification result in the block; and adding the block containing the second verification result to the block chain.
The above process relates to communication between a platform Leader node and a bank Leader node, for example, the communication may be sent from the platform Leader node to the bank Leader node, the communication content is "synchronous ledger", and after the bank Leader node receives the request, the bank Leader node starts a block chain distributed ledger synchronization mechanism, and adds the synchronous content sent by the platform Leader node to the existing ledger. Since in the first sub-network, it is possible to process the circulation process of multiple bills at the same time, there are multiple clients as bill holders in the same time period, multiple bill transfer platforms are assigned as platform Leader nodes for different bill circulation processes, and the platform Leader nodes for keeping heartbeat are all trading and accounting. Therefore, the situation that a plurality of platform Leader nodes and bank Leader nodes synchronize accounts at the same time exists, the bank Leader nodes need to process any received request, and if the bank Leader nodes are down, the hot standby server is started immediately to complete the work of the link.
Specifically, in one embodiment of the present disclosure, the first sub-network further comprises a first hot standby node, and the master node of the first sub-network is replaced with the first hot standby node when the master node of the first sub-network fails. And/or the second sub-network further comprises a second hot standby node, and when the master node of the second sub-network fails, the master node of the second sub-network is replaced by the second hot standby node.
For example, in the first sub-network, a backup server (hot standby server, which ensures that platform transaction and accounting can be normally performed) of the bill transfer platform is used as a Candidate (Candidate) node in the first sub-network, which is different from a Candidate node in a conventional RAFT consensus algorithm, and is used for replacing a current platform Leader node to operate when the current platform Leader node fails, and other first nodes are kept in a slave node state, so that the bill transfer process is normally operated. For the platform Leader node, the accounting state needs to be kept all the time, otherwise, the platform Leader node is regarded as down. In the second sub-network, the hot standby server can be used to prevent the master node from failing, and the details are not described here.
The following further describes a method for bill circulation according to an embodiment of the present disclosure with reference to specific embodiments:
first, a blockchain network is constructed, specifically, a federation chain system in this example, and includes a first sub-network and a second sub-network, where the first sub-network is composed of first nodes corresponding to a plurality of bill transfer platforms, and the second sub-network is composed of second nodes corresponding to a plurality of banks. In addition, the system also comprises a plurality of clients serving as light nodes, and the clients can serve as a ticket issuing party, an accepting party, a ticket holding party, a ticket mediating party and the like according to the ticket related business of the user of the clients, and build the whole process from signing to circulation of the business ticket by relying on the block chain service provided by the block chain network. In the block chain network, the bill transfer platform is responsible for smoothly realizing the interaction process, users of all clients develop bill business, corresponding bill total information is read in each link, and a bank is responsible for final bill posting.
Fig. 3A schematically illustrates an architecture diagram for a ticket circulation process in accordance with an embodiment of the disclosure.
As shown in FIG. 3A, P1～Pn1Representing the first node corresponding to the ticket transfer platform constituting the first sub-network, n1 represents the number of ticket transfer platforms. E1～En2Representing clients that may be ticketing parties and/or holders, n2 represents the number of clients that may be ticketing parties and/or holders. I is1～In3Representing the clients that can act as a ticket broker, n3 represents the number of clients that can act as a ticket broker. B is1～Bn4Representing the number of clients that can act as an acquirer, n4 represents the number of clients that can act as an acquirer. A. the1～An5Representing the second nodes corresponding to the banks constituting the second sub-network, n5 represents the number of banks. It can be seen that a first node may communicate with clients in various roles, and the first node may also communicate with a second node. In the system architecture, a first node P1～Pn1The number of the accounting nodes in the alliance chain system can be multiple, which is consistent with the actual situation, and in the actual business, multiple websites supporting the ticket transfer business can be provided, and correspond to multiple different organization bodies. The ticket issuing party, the ticket holding party, the ticket agency and the accepting party can select different ticket transfer platforms to carry out the business according to the preference and the business rule (for example, according to the limitation of the issuing bank and the like of the ticket business).
After the real trade background occurs, the invoicing party (the invoicing party in the actual business may be a purchasing enterprise or a selling enterprise, in the scheme, the invoicing party is defined in the purchasing enterprise for simplifying the description) pays the bill to the payee as the earliest bill holding party, and the transfer process of the bill can be started from the bill holding party until the bill is paid after the bank is posted or the holding period is expired. A method for the ticket circulation process will now be described with reference to fig. 3B.
Figure 3B schematically illustrates a schematic diagram of a ticket flow process according to an embodiment of the present disclosure.
As shown in fig. 3B, the note diversion process includes two distinct parts, the off-chain part and the in-chain part, which may include: the issuing process of the bill by the bill issuing party, the acceptance and endorsement process of the bill by the acceptance party (showing that the acceptance party agrees to pay the money responded by the bill holding party after a period of time, if the acceptance party and the bill holding party are the same party, the acceptance and endorsement process can be avoided), the bill holding party receives the issued bill, and the bill holding party verifies the authenticity of the bill through interaction with the ECDS and the like, so that various processes in the actual service can be included without limitation.
The intra-chain part can carry out services such as bill flow transfer and final cash posting through a first sub-network and a second sub-network after receiving bills from a bill holder, and the services comprise: when the ticket holder has a ticket transfer requirement, the ticket holder may broadcast the current ticket information to the first sub-network, and the ticket information may be generated according to the above embodiments. The ticket transfer platform as the current master node of the first sub-network may initiate a ticket validation mechanism, for example, by interacting with the ECDS, complete validation of the ticket held by the ticket holder, write the validation result into the ticket information issued by the ticket holder, and broadcast the message containing the ticket information to the whole network, so as to push the message to the ticket broker.
Then, each bill intermediary browses the push records and starts the intelligent contract to complete endorsement and transfer processes. Specifically, the ticket broker receives the push message, browses the message, and generates a transaction record by transacting with the current ticket holder (details are not described in the above). Specifically, the bill intermediary and the bill holder complete the transaction to be carried out by an intelligent contract, all terms in the endorsement are required to be set through the intelligent contract, only one object can be endorsed, only all rights can be provided, and no conditions are provided, so that the occurrence of invalid endorsement conditions is avoided, the endorsement success rate is improved, and the improvement of the efficiency of the whole bill circulation process is promoted. For the blockchain network, due to the uniqueness of the public and private keys of each node, each participating node can be regarded as a signature by using the private key signature, so that the private key signature of the bill broker can be regarded as equivalent signature, and the system efficiency is improved.
Due to high frequency and a large amount of transactions during bill transactions, billing of each bill transfer platform can be set to a billing time period, for example, T, if 500 transactions are completed in the time period, after T, the 500 transactions are packed into a block, a Merkle Root (Merkle Root) of the transaction packet is obtained through Hash operation, and block assembly is completed by the current platform Leader node. And the current platform Leader node completes accounting and synchronizes an account book with other first nodes.
The platform Leader node is communicated with the bank Leader node, the communication is sent to the bank Leader node by the platform Leader node, the communication content is 'synchronous account book', and after the bank Leader node receives the request, a block chain distributed account book synchronization mechanism is started, and the synchronous content sent by the platform is added into the existing account book.
And the endorsement transfer of the bills on different bill transfer platforms or the same bill platform is completed according to the process. The last transfer of the bill is completed, the last bill holder shows the bill to the bank, the endorsement process in the middle of the bill transfer process can be used as a history record to be left in the block chain, all records can not be tampered, any bank in the second sub-network can acquire all information related to the bill from the block chain, such as the account of the current bill holder and the like, and the showing link is completed. Preferably, the bank only needs to approve the last endorser, and for the bank, the bill after being endorsed for many times can be treated as a bill for twice endorsements (endorsement information of the accepting party and endorsement information of the last endorsement party).
Fig. 4 schematically shows a block diagram of an apparatus for ticket circulation according to an embodiment of the present disclosure, the apparatus being configured in a blockchain network including a first sub-network including a plurality of first nodes corresponding to a plurality of ticket transfer platforms, the plurality of first nodes including a master node of the first sub-network, and a second sub-network including a plurality of second nodes corresponding to a plurality of ticket posting banks, and more particularly, the apparatus being configured in the master node of the first sub-network.
As shown in fig. 4, the apparatus 400 for ticket circulation includes a receiving module 410, a broadcasting module 420, and a verifying module 430.
A receiving module 410, configured to receive ticket information from a ticket holder, where the ticket holder is one of the plurality of clients.
A broadcasting module 420, configured to broadcast the ticket information to the first sub-network, and push, by one or more first nodes in the first sub-network, the ticket information to the plurality of clients.
The verification module 430 is configured to, in response to the change from the client to another client in the plurality of clients by the ticket holder, obtain a transaction record that represents a ticket that flows from the client to the other client, perform a first verification, and generate a block that includes the transaction record after the first verification is passed; and sending the block to the second sub-network for second verification, and adding the block to a block chain after the second verification is passed.
Fig. 5 schematically illustrates a block diagram of an apparatus for ticket circulation according to another embodiment of the present disclosure.
As shown in fig. 5, the apparatus 500 for ticket circulation includes a receiving module 510, a broadcasting module 520, and a verifying module 530. The receiving module 510, the broadcasting module 520, and the verifying module 530 respectively have the same corresponding functions as the receiving module 410, the broadcasting module 420, and the verifying module 430, and repeated descriptions thereof are omitted.
In an embodiment of the present disclosure, the ticket information includes: summary information, content information, and a digital signature of the one client. The summary information includes at least one of: the bill payment system comprises bill amount, bill drawer identification information and bill holder identification information, wherein the abstract information further comprises bill holder endorsement information under the condition that a bill is endorsed by a receiver, and the abstract information further comprises the endorsement information of a previous bill holder under the condition that the previous bill holder exists; and/or the content information comprises at least one of: the method comprises the following steps of acquiring ticket encryption information, account information of a ticket issuer, account information of a ticket holder and ticket identification information, wherein the ticket encryption information comprises the discount rate information of the ticket.
In one embodiment of the present disclosure, the broadcasting module 520 includes: a verification sub-module 521 and a broadcast sub-module 522. The verification submodule 521 is used for verifying the authenticity of the bill information; and a broadcast sub-module 522 for broadcasting the ticket information to each first node of the first sub-network for storage if the ticket information is true.
In one embodiment of the present disclosure, if the plurality of second nodes of the second sub-network includes a master node, the verification module 530 includes: a transmit submodule 531 and an uplink submodule 532.
The sending submodule 531 is configured to send the block to the master node of the second sub-network, perform second verification on the block by the master node of the second sub-network, and add a second verification result to the block; and the uplink module 532 is configured to add the block containing the second verification result to the block chain.
Wherein, as an optional embodiment, the master node of the first sub-network in any time period is specified by the ticket holder in any time period. And/or the primary node of the second sub-network during any time period is determined based on a RAFT consensus algorithm.
Preferably, when the primary nodes of the second sub-network in two adjacent time periods are the same node, the primary node is determined from the second sub-network again based on the RAFT consensus algorithm.
Further, in one embodiment of the present disclosure, the first sub-network further includes a first hot standby node, and when the master node of the first sub-network fails, the master node of the first sub-network is replaced by the first hot standby node; and/or the second sub-network further comprises a second hot standby node, and when the master node of the second sub-network fails, the master node of the second sub-network is replaced by the second hot standby node.
There is also provided, in accordance with an embodiment of the present disclosure, a system for ticket circulation, including a first sub-network including a plurality of first nodes corresponding to a plurality of ticket transfer platforms, the plurality of first nodes including a master node of the first sub-network, and a second sub-network including a plurality of second nodes corresponding to a plurality of ticket-posting banks. The master node of the first sub-network receives ticket information from a ticket holder, which is one of the plurality of clients, and broadcasts the ticket information to the first sub-network. One or more first nodes in a first sub-network push the ticket information to the plurality of clients. And the main node of the first sub-network responds to the change of the ticket holder from the client to another client in the plurality of clients, acquires the transaction record which represents the ticket flowing from the client to the other client, performs first verification, generates a block containing the transaction record after the first verification is passed, and sends the block to the second sub-network. One or more second nodes in a second subnetwork perform a second validation of the transaction record. And the first sub-network and the second sub-network join the block to the block chain after the second authentication passes.
It should be noted that the implementation, solved technical problems, implemented functions, and achieved technical effects of each module/unit/subunit and the like in the apparatus part embodiment are respectively the same as or similar to the implementation, solved technical problems, implemented functions, and achieved technical effects of each corresponding step in the method part embodiment, and are not described herein again.
Any number of modules, sub-modules, units, sub-units, or at least part of the functionality of any number thereof according to embodiments of the present disclosure may be implemented in one module. Any one or more of the modules, sub-modules, units, and sub-units according to the embodiments of the present disclosure may be implemented by being split into a plurality of modules. Any one or more of the modules, sub-modules, units, sub-units according to embodiments of the present disclosure may be implemented at least in part as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented in any other reasonable manner of hardware or firmware by integrating or packaging a circuit, or in any one of or a suitable combination of software, hardware, and firmware implementations. Alternatively, one or more of the modules, sub-modules, units, sub-units according to embodiments of the disclosure may be at least partially implemented as a computer program module, which when executed may perform the corresponding functions.
For example, any plurality of the receiving module 510, the broadcasting module 520, and the verifying module 530 may be combined in one module to be implemented, or any one of them may be split into a plurality of modules. Alternatively, at least part of the functionality of one or more of these modules may be combined with at least part of the functionality of the other modules and implemented in one module. According to an embodiment of the present disclosure, at least one of the receiving module 510, the broadcasting module 520, and the verifying module 530 may be implemented at least partially as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented in hardware or firmware by any other reasonable manner of integrating or packaging a circuit, or in any one of three implementations of software, hardware, and firmware, or in a suitable combination of any of them. Alternatively, at least one of the receiving module 510, the broadcasting module 520 and the verifying module 530 may be at least partially implemented as a computer program module, which, when executed, may perform a corresponding function.
Fig. 6 schematically shows a block diagram of a computer device adapted to implement the above described method according to an embodiment of the present disclosure. The computer device shown in fig. 6 is only an example and should not bring any limitation to the function and scope of use of the embodiments of the present disclosure.
As shown in fig. 6, a computer apparatus 600 according to an embodiment of the present disclosure includes a processor 601 which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage section 608 into a Random Access Memory (RAM) 603. Processor 601 may include, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or associated chipset, and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), among others. The processor 601 may also include onboard memory for caching purposes. Processor 601 may include a single processing unit or multiple processing units for performing different actions of a method flow according to embodiments of the disclosure.
In the RAM 603, various programs and data necessary for the operation of the apparatus 600 are stored. The processor 601, the ROM 602, and the RAM 603 are connected to each other via a bus 604. The processor 601 performs various operations of the method flows according to the embodiments of the present disclosure by executing programs in the ROM 602 and/or RAM 603. It is to be noted that the programs may also be stored in one or more memories other than the ROM 602 and RAM 603. The processor 601 may also perform various operations of the method flows according to embodiments of the present disclosure by executing programs stored in the one or more memories.
According to an embodiment of the present disclosure, device 600 may also include an input/output (I/O) interface 605, input/output (I/O) interface 605 also being connected to bus 604. The device 600 may also include one or more of the following components connected to the I/O interface 605: an input portion 606 including a keyboard, a mouse, and the like; an output portion 607 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 608 including a hard disk and the like; and a communication section 609 including a network interface card such as a LAN card, a modem, or the like. The communication section 609 performs communication processing via a network such as the internet. The driver 610 is also connected to the I/O interface 605 as needed. A removable medium 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 610 as necessary, so that a computer program read out therefrom is mounted in the storage section 608 as necessary.
According to embodiments of the present disclosure, method flows according to embodiments of the present disclosure may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable storage medium, the computer program containing program code for performing the method illustrated by the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 609, and/or installed from the removable medium 611. The computer program, when executed by the processor 601, performs the above-described functions defined in the system of the embodiments of the present disclosure. The systems, devices, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.
The present disclosure also provides a computer-readable storage medium, which may be contained in the apparatus/device/system described in the above embodiments; or may exist separately and not be assembled into the device/apparatus/system. The computer-readable storage medium carries one or more programs which, when executed, implement the method according to an embodiment of the disclosure.
According to embodiments of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium, which may include, for example but is not limited to: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. For example, according to embodiments of the present disclosure, a computer-readable storage medium may include the ROM 602 and/or RAM 603 described above and/or one or more memories other than the ROM 602 and RAM 603.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Those skilled in the art will appreciate that various combinations and/or combinations of features recited in the various embodiments and/or claims of the present disclosure can be made, even if such combinations or combinations are not expressly recited in the present disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments and/or claims of the present disclosure may be made without departing from the spirit or teaching of the present disclosure. All such combinations and/or associations are within the scope of the present disclosure.
The embodiments of the present disclosure have been described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although the embodiments are described separately above, this does not mean that the measures in the embodiments cannot be used in advantageous combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be devised by those skilled in the art without departing from the scope of the present disclosure, and such alternatives and modifications are intended to be within the scope of the present disclosure.

Claims (10)

1. A method for ticket circulation, the method being applied to a master node of a first sub-network, the first sub-network and a second sub-network forming a blockchain network, the first sub-network including a plurality of first nodes including the master node, the plurality of first nodes corresponding to a plurality of ticket transfer platforms, the first sub-network including one or more master nodes corresponding to one or more ticket circulation processes during a same time period, the second sub-network including a plurality of second nodes corresponding to a plurality of ticket discount banks, any one of the first nodes in the first sub-network being configured to communicate with a plurality of clients, one or more master nodes in the first sub-network being configured to communicate with the second sub-network, the method comprising:
aiming at any bill circulation process, the main node corresponding to the bill circulation process in the first sub-network executes:
receiving ticket information from a ticket holder for the any ticket flow process, the ticket holder being one of the plurality of clients;
broadcasting the ticket information to the first sub-network, and pushing the ticket information to the plurality of clients by one or more first nodes in the first sub-network; and
responding to the change of the ticket holder from the client to another client in the plurality of clients, acquiring a transaction record representing the ticket transferred from the client to the other client in any ticket transfer process, and performing first verification;
packing transaction records which pass through first verification in the previous accounting time period into a block every accounting time period;
and sending the block to the second sub-network for second verification, and sending the communication content of the synchronous account book to the second sub-network after the second verification is passed, so that the blocks are added to a block chain by the plurality of second nodes and the plurality of first nodes respectively.
2. The method of claim 1, wherein the ticket information comprises: summary information, content information, and a digital signature of the one client;
the summary information includes at least one of: the bill payment system comprises bill amount, bill drawer identification information and bill holder identification information, wherein the abstract information further comprises bill holder endorsement information under the condition that a bill is endorsed by a receiver, and the abstract information further comprises the endorsement information of a previous bill holder under the condition that the previous bill holder exists; and/or
The content information includes at least one of: the method comprises the following steps of acquiring ticket encryption information, account information of a ticket issuer, account information of a ticket holder and ticket identification information, wherein the ticket encryption information comprises the discount rate information of the ticket.
3. The method of claim 1, wherein broadcasting the ticket information to the first sub-network comprises:
verifying the authenticity of the bill information; and
broadcasting the ticket information to each first node of the first subnetwork for storage if the ticket information is true.
4. The method of claim 1, wherein the plurality of second nodes of the second sub-network includes a master node, the sending the block to the second sub-network for a second validation, and after the second validation is passed, sending the communication of the synchronized ledger to the second sub-network such that the plurality of second nodes and the plurality of first nodes each join the block to the chain of blocks comprises:
sending the block to a main node of the second sub-network, performing second verification on the block by the main node of the second sub-network, and adding a second verification result to the block; and
adding, by each of the plurality of first nodes and the plurality of second nodes, the block containing a second verification result to the block chain.
5. The method of claim 4, wherein,
the master node of the first sub-network during any time period is specified by a ticket holder during the any time period; and/or
The primary node of the second sub-network during any time period is determined based on a RAFT consensus algorithm.
6. The method of claim 5, wherein when the master nodes of the second sub-network in two adjacent time periods are the same node, re-determining the master node from the second sub-network based on a RAFT consensus algorithm.
7. The method of claim 4, wherein,
the first sub-network also comprises a first hot standby node, and when the main node of the first sub-network fails, the main node of the first sub-network is replaced by the first hot standby node; and/or
The second sub-network further comprises a second hot standby node, and when the master node of the second sub-network fails, the master node of the second sub-network is replaced by the second hot standby node.
8. A system for ticket circulation, comprising a first sub-network and a second sub-network, the first sub-network comprising a plurality of first nodes corresponding to a plurality of ticket transfer platforms, the plurality of first nodes comprising a master node of the first sub-network, the first sub-network comprising one or more master nodes corresponding to one or more ticket circulation processes during a same time period, the second sub-network comprising a plurality of second nodes corresponding to a plurality of ticket posting banks, any one of the first sub-networks being configured to communicate with a plurality of clients, the one or more master nodes of the first sub-network being configured to communicate with the second sub-network;
for any bill circulation process, a main node corresponding to the bill circulation process in a first sub-network receives bill information from a bill holder for the bill circulation process, wherein the bill holder is one of a plurality of clients, and broadcasts the bill information to the first sub-network;
one or more first nodes in a first sub-network push the ticket information to the plurality of clients;
a main node corresponding to any bill circulation process in a first sub-network responds to the change of the bill holder from the client to another client in the plurality of clients, acquires a transaction record representing the circulation of the bills from the client to the other client in any bill circulation process and carries out first verification, packs the transaction record passing the first verification in the previous accounting time period into a block every accounting time period, and sends the block to a second sub-network;
one or more second nodes in a second sub-network perform second verification on the transaction record; and
and after the second verification is passed, the master node corresponding to any bill circulation process in the first sub-network sends the communication content of the synchronous account book to the second sub-network, so that the plurality of first nodes in the first sub-network and the plurality of second nodes in the second sub-network respectively add the block to the block chain.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor when executing the program implementing:
the method of any one of claims 1 to 7.
10. A computer-readable storage medium having stored thereon executable instructions that, when executed by a processor, cause the processor to perform:
the method of any one of claims 1 to 7.
CN201910795110.4A 2019-08-26 2019-08-26 Method, system, computer device and medium for ticket circulation Active CN110417917B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910795110.4A CN110417917B (en) 2019-08-26 2019-08-26 Method, system, computer device and medium for ticket circulation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910795110.4A CN110417917B (en) 2019-08-26 2019-08-26 Method, system, computer device and medium for ticket circulation

Publications (2)

Publication Number Publication Date
CN110417917A CN110417917A (en) 2019-11-05
CN110417917B true CN110417917B (en) 2020-09-29

Family

ID=68368839

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910795110.4A Active CN110417917B (en) 2019-08-26 2019-08-26 Method, system, computer device and medium for ticket circulation

Country Status (1)

Country Link
CN (1) CN110417917B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111292191A (en) * 2020-02-18 2020-06-16 杭州复杂美科技有限公司 Acceptance service alliance method, apparatus and storage medium
CN112487491A (en) * 2020-10-31 2021-03-12 远光软件股份有限公司 Control method and related device for block chain system

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106780033A (en) * 2016-12-16 2017-05-31 杭州云象网络技术有限公司 A kind of digital ticket transaction system construction method based on alliance's chain
CN106952094A (en) * 2017-03-10 2017-07-14 腾讯科技（深圳）有限公司 Electronic bill management method and device
CN109447811A (en) * 2018-12-07 2019-03-08 深圳市智税链科技有限公司 Method, accounting nodes and the medium of Transaction Information are inquired in block chain network

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10346814B2 (en) * 2014-06-04 2019-07-09 MONI Limited System and method for executing financial transactions
CN107786339A (en) * 2016-08-31 2018-03-09 陈新 It is layered controllable alliance's block catenary system
CN107369008A (en) * 2017-07-17 2017-11-21 北京京东金融科技控股有限公司 For improving management method, the apparatus and system of bill business security
CN109191219B (en) * 2018-08-13 2023-09-26 深圳市智税链科技有限公司 Data processing method, device, storage medium and equipment for electronic bill
CN109345194A (en) * 2018-09-12 2019-02-15 北京东港瑞宏科技有限公司 A kind of electronic bill flow system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106780033A (en) * 2016-12-16 2017-05-31 杭州云象网络技术有限公司 A kind of digital ticket transaction system construction method based on alliance's chain
CN106952094A (en) * 2017-03-10 2017-07-14 腾讯科技（深圳）有限公司 Electronic bill management method and device
CN109447811A (en) * 2018-12-07 2019-03-08 深圳市智税链科技有限公司 Method, accounting nodes and the medium of Transaction Information are inquired in block chain network

Also Published As

Publication number Publication date
CN110417917A (en) 2019-11-05

Similar Documents

Publication Publication Date Title
US11895246B2 (en) Devices, systems, and methods for facilitating low trust and zero trust value transfers
US11037164B2 (en) Event processing method, apparatus and electronic device based on blockchain technology
US11182787B2 (en) System and method for scaling blockchain networks with secure off-chain payment hubs
KR102180991B1 (en) Regulation of confidential blockchain transactions
US11030681B2 (en) Intermediate blockchain system for managing transactions
JP2022547130A (en) Systems and methods for providing a blockchain-based process of record
US10755276B2 (en) Event processing method, apparatus and electronic device based on blockchain technology
US20190164150A1 (en) Using Blockchain Ledger for Selectively Allocating Transactions to User Accounts
WO2020170177A1 (en) Trusted tokenized transactions in a blockchain system
US11494766B2 (en) Managing transactions on blockchain networks
US9773237B2 (en) Synchronous split payment transaction management
CN110008716B (en) Block chain transaction method and device, electronic equipment and storage medium
US11379866B2 (en) Retrieving values of digital tickets using smart contracts in blockchain networks
CN110033370B (en) Account creation method and device, electronic equipment and storage medium
CN110221919A (en) Virtual resource allocation method and apparatus based on block chain
CA3061810A1 (en) Method and device for avoiding double-spending problem in read-write set-model-based blockchain technology
CN110417917B (en) Method, system, computer device and medium for ticket circulation
CN110009492B (en) Block chain transaction method and device, electronic equipment and storage medium
CN110009323B (en) Block chain transaction method and device, electronic equipment and storage medium
CN114008654A (en) Managing a block chain based trusted transaction service
CN114008657A (en) Managing a block chain based trusted transaction service
US20210374843A1 (en) Debt Resource Management in a Distributed Ledger System
CN115398463A (en) Managing a block chain based trusted transaction service
CN111881166A (en) Operation data processing method, device and system based on block chain
Wandhöfer Technology innovation in financial markets: implications for money, payments and settlement finality

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
CP01 Change in the name or title of a patent holder

Address after: Room 221, 2 / F, block C, 18 Kechuang 11th Street, Daxing District, Beijing, 100176

Patentee after: Jingdong Technology Holding Co.,Ltd.

Address before: Room 221, 2 / F, block C, 18 Kechuang 11th Street, Daxing District, Beijing, 100176

Patentee before: JINGDONG DIGITAL TECHNOLOGY HOLDINGS Co.,Ltd.

CP01 Change in the name or title of a patent holder