CN113469852A - Block chain donation platform - Google Patents

Block chain donation platform Download PDF

Info

Publication number
CN113469852A
CN113469852A CN202110315388.4A CN202110315388A CN113469852A CN 113469852 A CN113469852 A CN 113469852A CN 202110315388 A CN202110315388 A CN 202110315388A CN 113469852 A CN113469852 A CN 113469852A
Authority
CN
China
Prior art keywords
donation
blockchain
pow
pos
chain
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.)
Pending
Application number
CN202110315388.4A
Other languages
Chinese (zh)
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.)
Yuanguang Software Co Ltd
Original Assignee
Yuanguang Software 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 Yuanguang Software Co Ltd filed Critical Yuanguang Software Co Ltd
Priority to CN202110315388.4A priority Critical patent/CN113469852A/en
Publication of CN113469852A publication Critical patent/CN113469852A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/26—Government or public services
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures

Abstract

The application discloses a block chain donation platform. Wherein the blockchain donation platform comprises a blockchain module; the block chain module takes the alliance chain as a bottom layer framework of the block chain donation platform; the alliance chain is composed of key users and common users, wherein the key users are block chain accounting nodes; the key users comprise logistics enterprises and charitable organizations, and the common users comprise donors and recourse persons. The method and the system can disclose and transparentize the donation process and construct a more credible public utility.

Description

Block chain donation platform
Technical Field
The application relates to the technical field of block chains, in particular to a block chain donation platform.
Background
People in all circles of the society pay more attention to the logistics tracking, distribution and use conditions of the donation materials, and higher requirements are provided for the timeliness and data accuracy of information publication of charitable organizations.
The biggest pain point of the society in the society is trust, the donation sources of some charities and audits to independent third parties lack of supervision frequently hide the problems of donation number, exceeding standard acquisition and purchase and the like, and the public trust of the charities is gradually reduced.
Disclosure of Invention
The application provides a block chain donation platform, which can publicize and transparentize donation processes and construct a more credible public utility.
In order to solve the above problems, the present application provides a block chain donation platform, which includes a block chain module;
the block chain module takes the alliance chain as a bottom layer framework of the block chain donation platform;
the alliance chain consists of key users and common users, wherein the key users are block chain accounting nodes;
the key users comprise logistics enterprises and charitable organizations, and the common users comprise donors and recourse persons.
Wherein, common users are organized together to form a node to participate in accounting.
The block chain donation platform comprises an information recording module;
the information recording module is used for writing the circulation information of the donated materials into the block chain, and correlating the circulation information of the whole circulation process of the donated materials so as to provide source tracing query of the donated materials.
The block chain donation platform comprises a project management module, wherein the project management module is used for providing issuing service of the assistance projects, donation service aiming at the assistance projects and help seeking service aiming at the assistance projects.
The project management module is used for providing targeted donation services and non-targeted donation services aiming at the assistance projects for the donors;
the targeted donation has a designated recourse.
The block chain donation platform comprises an information publishing module 15, wherein the information publishing module 15 is used for publishing assistance projects issued by charities, help requests issued by help requesters for the assistance projects, donation requests issued by the donors for the assistance projects, and circulation information of each circulation process of donations of the donation requests.
The block chain module is used for alternately performing POW and POS certification by utilizing a POW and POS mixed consensus protocol to generate a POW and POS block chain pair.
The block chain module is used for responding to the POS accounting node to obtain a plurality of block chain pairs in the n +1 round, so that the POS accounting node screens the POW blocks in the n +1 round of the block chain pairs and the block chain pairs with the same POW accounting nodes corresponding to the POW blocks in the n round, and a block chain pair set is obtained; and enabling the POS accounting node to screen out the optimal chain pair from the block chain pair set.
The block chain module is used for responding to the POS accounting node to determine an optimal chain pair, so that the POS accounting node performs equity election by using the equity amount of the POS accounting node to determine a POS out-block node; new blocks assembled by POS egress node are added to the optimal chain pair to generate new POW and POS block chain pairs.
The block chain module is used for responding to the POW accounting node to acquire a plurality of block chain pairs, so that the POW accounting node screens out the optimal chain pair from all the block chain pairs; enabling the POW accounting node to calculate the optimal block head so as to determine a random number meeting the target requirement and further determine a POW block outlet node; new blocks assembled from POW egress nodes are added to the optimal chain pair to generate new POW and POS block chain pairs.
The blockchain donation platform of the present application includes blockchain modules. The block chain module takes the alliance chain as a bottom layer framework of the block chain donation platform, so that the block chain donation platform is jointly maintained by distributed computer network nodes, and a block chain material flow + information flow public indication system is established by utilizing the characteristics of decentration, openness, transparency and tamper resistance of a block chain technology, so that the whole process of service core data is guaranteed to be open and transparent, the possibility of information asymmetry and information counterfeiting in the material operation process in social donation can be solved, the system paralysis caused by network attack can be avoided, and a highly trusted social logistics environment is established.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application in a non-limiting sense. In the drawings:
FIG. 1 is a schematic block chain donation platform according to an embodiment of the present application;
FIG. 2 is a schematic diagram of the business process of the blockchain donation platform according to the present application;
FIG. 3 is a schematic view of a traceability page of donated materials in the blockchain donation platform according to the present application;
FIG. 4 is a schematic view of a block chain donation platform assistance item display page according to the present application;
FIG. 5 is a schematic flow chart of the information flow of donation material tracing in the blockchain donation platform according to the present application;
FIG. 6 is a system architecture diagram of another embodiment of a blockchain donation platform according to the present application;
FIG. 7 is a schematic interface diagram of a donation application corresponding to the blockchain donation platform according to the present application;
FIG. 8 is a schematic flow chart diagram illustrating one embodiment of a hybrid consensus process of the present application;
FIG. 9 is a block chain structure diagram generated by a block chain module in the block chain donation platform of the present application;
FIG. 10 is a schematic view of the consensus process for blockchain modules in the blockchain donation platform of the present application;
FIG. 11 is a schematic diagram of an embodiment of the hybrid consensus system of the present application;
FIG. 12 is a schematic structural diagram of an embodiment of a computer storage medium according to the present application.
Detailed Description
The description and drawings illustrate the principles of the application. It will thus be appreciated that those skilled in the art will be able to devise various arrangements that, although not explicitly described or shown herein, embody the principles of the application and are included within its scope. Moreover, all examples herein are principally intended expressly to be only for pedagogical purposes to aid the reader in understanding the principles of the application and the concepts provided by the inventors and as a prelude to the more detailed description that is presented below, and are to be construed as being limited to such specifically recited examples and conditions. Additionally, the term "or" as used herein refers to a non-exclusive "or" (i.e., "and/or") unless otherwise indicated (e.g., "or otherwise" or in the alternative). Moreover, the various embodiments described herein are not necessarily mutually exclusive, as some embodiments may be combined with one or more other embodiments to form new embodiments.
In order to solve the problem that the public utility is not trusted due to the fact that the donation flow of the existing donation platform is not open and opaque, the block chain donation platform 10 is provided. As shown in fig. 1, the blockchain donation platform 10 of the present application includes a blockchain module 11. The block chain module 11 uses the alliance chain as a bottom layer framework of the block chain donation platform 10, so that the block chain donation platform 10 is jointly maintained by distributed computer network nodes, and a block chain material flow + information flow public indication system is established by using the characteristics of decentration, openness, transparency and tamper resistance of a block chain technology, so that the whole process of service core data is guaranteed to be open and transparent, the possibility of information asymmetry and information counterfeiting in the material operation process in social donation can be solved, system paralysis caused by network attack can be avoided, and a highly trusted social logistics environment is established.
The alliance chain is composed of key users and common users, each key user and each common user are service nodes, data are shared in real time, the users can be jointly supervised and cannot be tampered, the reliability of the data on the chain is guaranteed, and each service link is under supervision.
Wherein the key users include charities and logistics enterprises. Each key user can be used as a block chain accounting node to upload data in the donation process to a block chain, the reliability of the key users is high, and the key users are used as the block chain accounting nodes to ensure the credibility of data sources, so that the reliability of the block chain donation platform 10 can be improved. In addition, key users may also include project auditors, financial institutions (e.g., banks), regulatory bodies, and the like.
Common users include donors and recourse. In some implementations, the common users can be organized together into nodes to participate in billing, so that the participation sense of the common users can be improved, and the enthusiasm of the common users for issuing help and/or donations can be improved, so that the block chain donation platform 10 of the present application can form a virtuous cycle. In addition, the general user may further include an authentication center, etc.
Optionally, the blockchain donation platform 10 may also include a user management module 12. The user management module 12 may be used to provide account registration services to users so that help seekers or donors in hospitals, communities, etc. may register themselves to apply for joining the blockchain donation platform 10.
The user management module 12 may also be used to provide an electronic (CA) authentication service to the user to authenticate the user's identity, so as to authorize the corresponding service to the user based on the user's identity, such as issuing service and project management service for charitable organization authorized projects, and for example authorizing application service for help on a help seeker, so as to construct a trusted identity authentication system and service system through the user management module 12 of the blockchain donation platform 10.
Of course, the user management module 12 may also be used to provide login services to the user to log the user into the blockchain donation platform 10 based on the user's account number.
The user management module 12 may also be used to provide unit management services. For example, a management service of a help unit is provided to a charity organization so that when the charity organization confirms that part of the help units are untrustworthy units, the untrustworthy help units are pulled into a blacklist and a help application of the untrustworthy help units is not accepted.
The user management module 12 may also be used to provide user information management services. For example, warehouse information management services may be provided to charities.
Optionally, the blockchain donation platform 10 may also include a project management module 13.
The project management module 13 is used for providing a release service of the assistance project so as to add the assistance project to a charity organization and other units. The project management module 13 of the present application can also be used for collecting information of the assistance project when providing a publishing service of the assistance project, for example, collecting information of a required material range list and a project logo publicity picture of the assistance project.
Alternatively, the item management module 13 may be configured to provide a help service for the help item, so that the help seeker requests for help, and the help seeker issues the help request simply and quickly by the help request for the help item, thereby improving the help efficiency.
The project management module 13 of the present application may also be configured to collect information such as a help material list, a receiving address, a contact person, and a contact method of a help application when a help seeker makes a help application for a help project. When collecting the information of the help application, the project management module 13 may display an input interface so as to obtain information of the help material list, the receiving address, the contact person, the contact way and the like of the help application through the input interface. The item management module 13 may directly present information such as a contact address, a receiving address, and a contact person in the help seeker registration information on the displayed input interface to reduce content filled by the help seeker, and the content such as the contact address, the receiving address, and the contact person presented on the input interface may be modified. In addition, before collecting the detail list of the help seeking materials, the item management module 13 may display the required material range list of the help seeking item to the help seeker, so that the user can select from the required material range list of the help seeking item, the help seeker can issue the help seeking application, and even if the help seeking material of the help seeker is not in the range of the item material list, the help seeker can manually input the detail of the help seeking material.
The project management module 13 may also be configured to provide an audit service for the help application so that an approval authority such as a charity may audit the help application. After the help application review passes, the blockchain donation platform 10 may display the help items and the help applications in association, so that the donors, charities and the like can know information of at least one help application issued for the help items. In addition, after the help application is approved, the block chain donation platform 10 can respectively summarize and display the help application of the help seeker according to the two latitudes of the help seeker + the material and the material.
Wherein the project management module 13 is operable to provide donation services for assistance projects to donors. Alternatively, the donor may select the materials to donate from the list of the range of materials required for the assistance project and/or the list of materials requested for assistance, and may fill in the amount of donations.
Further, the project management module 13 may be configured to provide targeted donation services and non-targeted donation services for assistance projects to donors, so that the blockchain donation platform 10 of the present application supports targeted donation or non-targeted donation, and is more flexible.
The targeted donation service has a designated recourse. Specifically, the donor can select the list of the helpers listed in the assistance project and the information such as the lacking material types, specifications, quantity and the like, the helpers are appointed to initiate directional donation according to the information, and the charitable warehouse directly distributes the materials according to the appointed helpers after receiving the materials, so that point-to-point directional donation can be realized, intermediate links can be reduced, and the donation efficiency can be improved.
The non-directed donation service does not set a designated recourse. Specifically, the donator can initiate donation business according to the assistance project issued by the charity organization, and the materials are directly sent to the charity organization for collection and then distributed by the charity organization.
The project management module 13 may also be configured to provide auditing services for the donation applications so that an auditing organization, such as a charity, may audit the donation applications submitted by the donors. The project management module 13 is specifically configured to obtain an audit opinion of the donation application; if the review opinions are approved, the project management module 13 will print the approved standard on the donation application; if the review opinions are not approved, the project management module 13 will also obtain the reason for the disapproval from the auditing agency so that the donor who made the donation request can know the reason.
The project management module 13 can also be used for providing an entry service of transfer information of donated materials, so that the block chain donation platform 10 of the present application goes deep into a multiparty delivery link business in the donation process, and authenticity of charitable public information is ensured.
Wherein, in the donation material circulation process, the information input flow is as follows:
(a) after the donation application is approved, the donator can click the delivery confirmation on the donation application document according to the donation application after the approval is passed, fill in the logistic bill number, and also can input the invoice on the donation application document. The whole donation application form comprises information such as a reply mark, a delivery confirmation mark, a logistics list number and the like.
(b) The donator gives the donated materials to the logistics party based on the logistics list number, so that the logistics enterprise distributes the donated materials to the charity. In the process of distributing and supplying donated materials, the logistics enterprise records all transfer information of the donated materials into the block chain donation platform 10.
(c) The logistics enterprise distributes donation materials to a charitable warehouse of a charity organization based on the logistics list number, the charitable organization and the logistics enterprise confirm the donation materials, the material specification and quantity, the storage warehouse and other information corresponding to the confirmed logistics list number are input into the block chain donation platform 10.
(d) If the donation request is a directed donation request, the charity may generate a delivery slip for the recipient with the designated recourse of the directed donation request, and the charity may record the delivery slip and the delivery information thereof into the blockchain donation platform 10.
(e) If the donation request is a non-directed donation request, the charitable organization can determine which recourse persons to allocate the donation materials of the non-directed donation request. After the charitable organization distributes the donation materials, the distribution list is recorded into the block chain donation platform 10, the distribution list includes information of the help seeker, the material eyesight, the material specification, the distribution quantity, the material warehouse and the like, and when the distribution list is recorded, confirmation of both the decision main body and the charitable organization is required. The charity may generate the delivery order manually or automatically with the help seeker granularity based on the distribution list.
(f) The charitable organization gives the donation materials to the logistics party based on the distribution list, so that the logistics enterprise distributes the donation materials to the help seeker, the donation materials are delivered and confirmed by the warehouse and the logistics party, and confirmation information such as the distribution list and distribution information thereof is input into the block chain donation platform 10. In the process of distributing donated materials, the logistics enterprise records all transfer information of the donated materials into the blockchain donation platform 10.
(h) The logistics enterprise distributes the donated materials to the help seeker based on the distribution list. After the help seeker receives the donated materials, whether the donated materials are consistent with the distribution list is confirmed; if the confirmation is consistent, the confirmation is carried out on the basis of the distribution single line; if the materials are inconsistent, the materials are negotiated with the logistics party, rejection or sign-in can be selected, and specific materials are noted on the distribution list.
Further, as shown in fig. 2, in the process of transferring donated materials, location data of donated materials can be collected in real time based on technologies of internet of things such as RFID, two-dimensional code, GPS and the like to track a transportation path of the donated materials, one-material-one-code is realized, information of all links from the donators, charitable organizations, logistics to the contributors and the like, and certificates and paper files generated in the process are recorded into the block chain donation platform 10, and all flow data of contribution, donation application, material delivery, charitable organization signing, contribution signing and the like are recorded into the block chain donation platform 10, so that trusted traceability of the donated materials is realized, uniqueness and authenticity of each donated material is guaranteed, and the monitoring department and public users can conveniently monitor on line, and the problem of incredibility in the traditional public welfare activity is solved.
In addition, the blockchain donation platform 10 of the present application may further include an information recording module 14.
The information recording module 14 may be in communication connection with the project management module 13, and after the project management module 13 acquires the assistance project related information, the help application related information, the donation application related information, and/or the donated material transfer information, the project management module 13 sends the acquired information to the information recording module 14, so that the information recording module 14 can uplink and store the information. And the information recording module 14 uses the block chain encryption technology to uplink store the information, so as to protect the privacy of the donor and the recourse person.
The information recording module 14 can associate the circulation information of the whole circulation process of the donated materials with the corresponding assistance item information and the like, so as to provide the traceability query of the donated materials, so that the user can query the traceability schematic diagram of the donated materials shown in fig. 3.
The information recording module 14 may be configured to directly associate the donors with the assistance items, wherein the circulation process of each donated material is stored in the blockchain, and the flow direction of each donated material can be traced.
In addition, the blockchain donation platform 10 of the present application may also include an information publication module 15. The information publishing module 15 is used for publishing the assistance items issued by charitable organizations, the help-seeking requests issued by the help-seeking persons for the assistance items, the donation requests issued by the donators for the assistance items and the circulation information of each circulation process of donated materials of the donation requests, so that the users can check the precision of the assistance items in real time, and the assistance items are immediately disclosed and shared to all social parties through a block chain to perform transparent tracing and common supervision of the whole process; the loving donors can check the circulation of donated materials at any time, the donation is more relieved, and the donors can know the feedback of the help seeker, so that the participation sense is stronger; the help seeker can monitor the condition of the assisted materials in a real-time link, and the demand management is more convenient; the method is beneficial to realizing that effective resultant force is formed by participation in each part in the public welfare charitable network, and the vigorous development of the public welfare charitable cause is assisted.
The information publishing module 15 may display the help application and the assistance item for which the help application is directed in a project detail information center in a related manner, so that when a user such as a donor views the project details, the user can know the actual help information of the assistance item. And when at least one help application associated with the help project is displayed, the at least one help application can be respectively displayed in a summary mode according to the two latitudes of the recourse person, the goods and the materials.
Specifically, the information publishing module 15 may display two sub-pages of a leaderboard and an assistance project.
The love leaderboard is used for displaying the information of the donation date, the assisted items, the name of the donation, whether the donation is directed, the sign-in state of the materials and the like of the love donator, and the detail of the materials signed and confirmed by the charity mechanism can be checked.
As shown in fig. 4, the assistance item is used to display a list of items issued by charity organization, and the donor and the recourse person can respectively initiate a recourse application and a contribution application for a certain assistance item. The assistance items may also display donation details for the respective assistance item in response to an instruction to view certain assistance item details.
The information publication module 15 may also be used to provide a source view service for donation transactions. Specifically, the information publishing module 15 may also be configured to display a full-chain tracing page of the donation service, as shown in fig. 5, including the following tracing nodes: the method comprises the steps of issuing projects (charitable institutions), issuing demands (recourse persons), donating materials (donation persons), transporting materials (logistics), signing for materials (charitable institutions), warehousing materials (charitable institutions), ex-warehousing materials (charitable institutions), transporting materials (logistics) and signing for materials (recourse persons), clicking a detail page capable of viewing related nodes, so that public confidence is provided for the whole loving donation process based on the anti-tampering and traceability characteristics of the block chain technology, the final flow direction of the materials can be traced to the donated information by public and donators, the donated materials are guaranteed to be legally and regularly used, the public and transparent effects are achieved, full-flow evidence of information and behaviors in the public and welfare charitable process and stage tracing and auditing of the public and welfare charitable full cycle are achieved, and the donation flow is made public and transparent. And the information publishing module 15 may be used to display all material details received by the assistance project and material flow details.
The block chain donation platform 10 is built by taking a block chain as a bottom layer technology, information flow and material flow are integrated, and chain deposit notarization is carried out on the core data in the whole process; the functions of loving heart for help, donation, assisted business processing and information publicity and data traceability are provided for individuals and enterprise users; providing donation full-service flow management services such as user information, project basic data, disaster relief materials and the like for charitable organizations, establishing a credible love donation path based on a block chain, improving the management level, using the block chain to remove trust characteristics and improving the self public trust; for a platform construction party, the social service business field is further cut in by a 'block chain + public welfare', and the social image and the social public credibility are improved; for a supervision unit, each donated material of an assistance project can be monitored in real time, the public transparency and data chaining of beneficiaries, such as information and actual conditions, can be monitored, each money can be tracked, the authenticity of public welfare can be increased, and the trust relationship among all parties can be established; the users of the alliance chain can be jointly supervised and cannot be falsified, each donor, the help seeker and the supervision mechanism are service nodes, data are shared in real time, credibility of data on the chain is guaranteed, and each service link is under supervision; compared with other related platforms based on the block chain, such as the market interest chain, the Teng-West charity and the like, the block chain donation platform 10 supports the chain certificate storage and the public representation of charity donation results, and further goes deep into the multi-party delivery link business in the donation process, so that the authenticity of charity public representation information is ensured.
Further, as shown in fig. 6, the block chain donation platform 10 of the present application includes a platform layer and an application layer, wherein the platform layer includes the above-mentioned alliance chain, the user management module 12, the project management module 13, and the like. The application layer provides an interface for interaction with a user, and particularly, the application layer can be embodied as donation application of a PC (personal computer) end or an applet end and the like, and key users (charitable institutions, logistics enterprises, financial institutions and the like) and common users can interact with the platform layer through the application layer so as to write business activity information such as users, materials, logistics, stocks, funds, help seeking and donation formed on the donation management platform into a alliance chain, check help project information, help seeking information, donation information and the like, and perform operations such as donation material source tracing and checking.
Specifically, the donation application has the following pages:
1. logging on a page: the login page can be carried out through a login button at the upper right corner of the home page, and the correct account password is input for login.
2. A registration page: the functions of account registration, password forgetting and the like can be executed on the registration page.
3. The personal center: the head portrait can be modified, the mobile phone number can be changed, the password can be modified, the ' my donations ' and ' my help can be viewed at the personal center, and the donation information and help information of all histories of the user can be viewed.
4. Homepage: the first level menu includes charitable items, information publicity, leaderboard, and operation management (the function menu is not available to donate and help users).
A schematic diagram of a home interface of the donation application is shown in fig. 7, where the home interface includes: the banner graph rolls, public areas (donation projects), information publicity, leaderboard, donation data statistics, available logistics information, friendship links.
The user can check partial charitable projects in the public square on the first page of the donation application, the shortcut operation is carried out, and the complete project can click the functional button of the charitable project to jump to the page; the information publicity module can check and screen donation data and used material data in the corresponding time interval, and click more pages capable of opening the information publicity; the career board can view the donation information (the donation condition on the same day is displayed in a rolling mode), and click more pages capable of being penetrated and opened; the donation data statistics can check the demand issue and donation times recorded in the screening time period; the available logistics information can check which logistics are available and which logistics are unavailable currently; the friendship link shows the other party platforms that are relevant to this blockchain donation platform 10.
Furthermore, business activity information written into users, materials, logistics, inventory, funds, help seeking and donations and the like of the alliance chain is formed by multi-party consensus so as to achieve the purpose of sharing credible data by multiple parties. Therefore, the consensus mechanism in the blockchain donation platform 10 is important, and if the consensus mechanism is not safe, the public data can be forged, and the public trust of the whole public service system is lost. In a POW (workload certification) mechanism used by a bitcoin system, if most of nodes participating in calculation are honest, the safety of the nodes can be ensured; however, if a 51% attack is encountered, a system such as bitcoin cannot resist. The application provides a hybrid consensus method, which combines a second consensus mechanism and a first consensus mechanism, namely a POW mechanism, to make a blockchain module 11 of a blockchain donation platform 10 alternately perform POW certification and second consensus certification to generate a chain pair of a first block and a second block, so that an alliance chain system of the blockchain donation platform 10 can defend against 51% attacks: even if the malicious node controls over 50% of the computing power, the security of the blockchain donation platform 10 can be still ensured.
As shown in fig. 8, the hybrid consensus method of the present application comprises the following steps. It is to be understood that the hybrid consensus method of the present application is not limited to be applied in a blockchain donation platform, and may also be used in a logistics system, for example.
S101: the first accounting node selects the first best chain pair from the candidate chain pair set of the previous round.
After the first accounting node acquires the plurality of first candidate chain pairs, a best chain pair may be selected from the plurality of first candidate chain pairs as a first best chain pair, so as to expand the block chain pair on the first best chain pair.
Optionally, each first candidate chain pair comprises a first block and a second block of a previous round.
Specifically, the search process for the best chain pair may be as follows:
for each chain pair
Figure BDA00029913267400001215
Executing:
1. checking whether the chain lengths of the POW chain and the POS chain are satisfied
Figure BDA0002991326740000121
And Type POS-holder, initially set l: len (c). The new POW block C [ l ] is then verified]As follows:
(1) verification of C [ l ]]The pointer in (1): analysis of C [ l]To obtain<hl，wl>Is prepared from (COMPUTE, C [ l-1 ]]，
Figure BDA00029913267400001216
) Is sent to
Figure BDA00029913267400001217
And then receives (coordinated, h). If h ≠ hlThen the chain pair is deleted from phi';
(2) verification of C [ l ]]POW solution in (2): message (RO-VERIFY, C [ l ]]) Send to function
Figure BDA0002991326740000123
Then receives (RO-verify, h'). If h ═ t, then the chain pair is deleted from ═ t'.
2. Checking whether the chain lengths of the POW chain and the POS chain are satisfied
Figure BDA0002991326740000125
And Type is POS-holder, or
Figure BDA0002991326740000126
And Type ═ POW-miner. If so, for each
Figure BDA0002991326740000127
The following operations are carried out:
(1) verify POW block C [ i ]:
verification of Ci]The pointer in (1): resolution of C [ i ]]To obtain<hi，wi>Is prepared from (COMPUTE, Ci-1)]，
Figure BDA0002991326740000128
) Is sent to
Figure BDA0002991326740000129
Then receiving (coordinated, h);
verification of Ci]POW solution in (2): message (RO-VERIFY, Cj [ i ])]) Send to function
Figure BDA00029913267400001210
Then receives (RO-verify, h').
If h isiB is not equal to h or h ═ t1: 0. Otherwise, set b1：＝1。
(2) Verifying POS block
Figure BDA00029913267400001211
Parse
Figure BDA00029913267400001212
To obtain<S，B，X，σ>. Then the message (STAKE-VERIFY, (B, X, S)j) σ) to a function
Figure BDA00029913267400001213
From
Figure BDA00029913267400001214
Receive message (STAKE-VERIFIED, (B, X, S)j) After f), if f is 0 or B ≠ C [ i ≠ C]Then set up b2: 0. Otherwise, set b2＝1。
(3) If b is10 or b2If either verification fails, then the chain pair is deleted from ` 0'.
3. Otherwise, please delete this chain pair from phi'.
Finding valid chain pairs with the longest POW chain
Figure BDA0002991326740000131
Then will be
Figure BDA0002991326740000132
Figure BDA0002991326740000133
The output is the optimal chain pair.
S102: the first accounting node generates a first block of the current round using a first consensus mechanism on the basis of the first best chain pair.
After the first billing node determines the first best chain pair, a first consensus mechanism may be used to generate the first block of the current round based on the first best chain pair.
Optionally, the first consensus mechanism is a POW mechanism. Wherein the first accounting node extends the best-effort chain pair by workload attestation (i.e., solving the hash inequality), i.e., the first accounting node has the capability to generate a workload attestation chunk in proportion to its computing capability.
Specifically, step 102 includes: the first accounting node calculates the optimal block head to determine a random number meeting the target requirement, and then determines a first block outlet node; the first block assembled by the first out-of-block node is added to the first optimal chain pair.
More specifically, the first consensus mechanism ΠwThe implementation of (a) can be as follows:
for each with a local stateiPOW accounting node Wi(1 ≦ i ≦ n), assuming that the function has been registered
Figure BDA0002991326740000134
For each POW round, a message (INPUT-WORK, W) is received from the Environment Zi) Then, WiThe method comprises the following steps:
1. selecting the best local chain pair: at the position of slave FNETReceive any one of
Figure BDA0002991326740000135
Is in the form of (MESSAGE, P,
Figure BDA0002991326740000136
) After the message set of (wherein C is slave F)NETCollection of all pairs of chains collected), computing
Figure BDA0002991326740000137
(
Figure BDA0002991326740000138
POW-mini), then C is seti：＝CbestAnd is
Figure BDA0002991326740000139
2. Attempts to extend the POW chain:
(1) using an ideal function
Figure BDA00029913267400001310
Calculating an optimal block head: will (COMPUTE, head (C)i)，
Figure BDA00029913267400001311
) Sent to the ideal function
Figure BDA00029913267400001312
And from
Figure BDA00029913267400001313
Receiving (coordinated, h);
(2) search for POW solution: if h ≠ T, then (SEARCH, W)iH) send to the Ideal function
Figure BDA00029913267400001314
Then from
Figure BDA00029913267400001315
Receive (SEARCHED, W)i，w)。
(3) Generating a new POW block: if w ≠ T, update B: is ═ i<h，w>I.e. indicate WiIs a participant in the round of solution, update Ci：＝CiI B, updating the state of the local statei：＝statei
Figure BDA0002991326740000141
Then the (BROADCAST,
Figure BDA0002991326740000142
) Is sent to FNET。
(4) RETURN (RETURN-WORK, Wi) to the environment Z.
Preferably, the first block of the current round generated by the first accounting node is directed to the first block of the previous round and the second block of the previous round. Of course, not limited thereto, for example, the first block of the current wheel may also be directed only to the first block of the previous wheel.
S103: the second accounting node selects a second best chain pair after screening out a second candidate chain pair in the candidate chain pair set of the previous round.
For the second accounting node, the second accounting node may screen out, from the candidate chain pair set of the previous round, a chain pair in which the block output node of the first block of the previous round is the same as the block output node of the first block of the current round, so that the block output nodes of two adjacent first blocks in the block chain system formed by the hybrid consensus mechanism of the present application are different, thereby avoiding the situation of data falsification due to continuous accounting of the accounting node with high computation power to a great extent, and improving the security of the consensus mechanism.
The second candidate chain pairs belong to the first candidate chain pair, and the deblocking node of the first block of the previous round in each second candidate chain pair is the same as the deblocking node of the first block of the current round.
After the second accounting node screens out the second candidate chain pair from the candidate chain pair set of the previous round to obtain a second candidate chain pair set, it needs to select a best chain pair from the second candidate chain pair set as a second best chain pair. The method for selecting the second optimal chain pair can be described with reference to step S101, and is not described herein again.
S104: the second accounting node generates a second block of the current round using a second consensus mechanism on the basis of the second best chain pair.
After the second accounting node determines the second best chain pair, a second block of the current round may be generated by using a second consensus mechanism on the basis of the second best chain pair.
Optionally, the second consensus mechanism is different from the first consensus mechanism.
Wherein the second common mechanism may be a rights attestation POS mechanism or a capacity attestation POC mechanism.
Taking the POS mechanism as an example, step 104 may include: the second accounting node performs right choice by using the own right quantity to determine a second block output node; a second block assembled by a second out-block node is added to the second optimal chain pair.
In the POS block generation process, a second out-block node is first selected based on the workload proof chain and the new POW block (i.e., the verification key of each equity accounting node is tested by another hash inequality), and then privileged to extend the most efficient chain pair on its ledger (i.e., by signing and approving the new transaction). In each round of POS, a second accounting node with an identity derived from a new first block generated from a previous POW round can generate a new second block, which is then appended to the second optimal chain pair. For each second accounting node, whether it can be selected depends on the amount of rights it has.
Specifically, POS consensus mechanism ΠwThe implementation of (a) can be as follows:
for each with a local statejPOS account node
Figure BDA0002991326740000151
Assume that a function has been registered
Figure BDA0002991326740000152
At each POS round, a message (INPUT STATE, S) is received from Environment ZjX), where X represents the payload of the block, SjThe method comprises the following steps:
1. selecting the best local chain pair: at the position of slave FNETReceive any one of
Figure BDA0002991326740000153
Is in the form of (MESSAGE, P,
Figure BDA0002991326740000154
) After the message set (where C is slave F)NETCollection of all pairs of chains collected), computing
Figure BDA0002991326740000155
(
Figure BDA0002991326740000156
POS-holder), then set Ci：＝CbestAnd is
Figure BDA0002991326740000157
2. Attempting to extend the POS chain: is provided with CbestThere is a new POW block B.
(1) And (3) right and interest election: will (ELECT, S)jAnd B) to the ideal function
Figure BDA0002991326740000158
And from
Figure BDA0002991326740000159
Receiving (ELECTED, S)j，f)。
(2) And (3) generating a signature: if f is 1, (SIGN, S)jB, X) to the ideal function
Figure BDA00029913267400001510
And from
Figure BDA00029913267400001511
Receiving (SIGNED, (S)j，B，X)，σ)。
(3) Generating a new POS block: updating
Figure BDA00029913267400001512
I.e. indicate SjFor participants elected in the round, update
Figure BDA00029913267400001513
Updating local state
Figure BDA00029913267400001514
Figure BDA00029913267400001515
Then the (BROADCAST,
Figure BDA00029913267400001516
) Is sent to FNET。
(4) Return (RETURN-Stake, S)j) To environment Z.
Preferably, the second sector of the current wheel points towards the first sector of the current wheel.
Further, when the second consensus mechanism is a POS mechanism, the POW accounting node (i.e., the first accounting node) and the POS accounting node (i.e., the second accounting node) jointly use the new block co-extension block chain. As shown in FIG. 9, the square blocks are workload certificates generated by the POW accounting node at POW consensusA bright block (i.e., a first block), a plurality of square blocks B1，B2，B3,.. the sequence of POW chain; the circular blocks are rights and interests proving blocks (i.e. second blocks) generated by POS accounting nodes in POS consensus, and the plurality of circular blocks
Figure BDA0002991326740000161
.., constituting a POS chain; the oval blocks are the chain of blocks that have been commonly recognized and synchronized by the multi-party POW + POS hybrid, i.e., the oval blocks are from the synchronized chain of blocks, denoted as B-N...，B-1，B0(N is an integer). Wherein the dotted arrows indicate the POW consensus for the first step and the solid arrows indicate the POS consensus for the second step.
In the hybrid consensus protocol, the POW chain and the POS chain are tightly coupled together at each time point, and these POW/POS chains extend alternately. As shown in fig. 9, each workload certification block (POW block) may map to no more than one equity certification block (POS block); each POW block is linked to a previous POW block and a POS block. The POW chain and the POS chain are mutually wound together and grow at the same speed, namely, the POW chain and the POS chain correspondingly have two member chains with the same length, if the POW chain or the POS chain in a certain chain pair grows too fast, the chain pair becomes invalid, namely all valid POS chains are almost the same as the corresponding POW chain in length, and the valid chain pair is composed of the valid POS chain and the corresponding POW chain.
And the POW/POS chain in the POW + POS hybrid consensus protocol is alternately expanded. Each turn includes a POW turn for generating POW blocks and a POS turn for generating POS blocks, i.e., a total of two blocks are generated for each turn. When generating a block, each participant (POW accounting node or POS accounting node) first determines the active chain pair with the longest POW chain and then attempts to extend the chain pair.
According to the protocol description above, although the consensus scheme of the present application does not directly link the POS chain, the adversary cannot operate the existing POS block because it is locked by the next POW block in the chain (i.e., each POW block is linked to its previous POW block and POS block). In addition, to extend the POW/POS chain pair, the adversary needs to control two steps simultaneously: 1. the adversary first needs to find a valid POW solution (define a valid POW block), which specifies a valid equity accounting node; 2. adversaries also need to control such equity accounting nodes to accomplish the extension of chain pairs, and the identity of a given equity accounting node is difficult to predict. Even if the adversary can find the POW solution, if the adversary has control of very few equity accounting nodes, the adversary still cannot generate more POS blocks than honest participants. Based on this, if the honest participants control most resources (including power and rights), the blockchain formed by the mixed consensus protocol of the application is credible, and the POW and POS mixed consensus protocol of the application essentially improves the safety of the blockchain, namely, even if the adversary controls more than 50% power, the honest participants can still ensure that the blockchain data is not tampered through the rights. In addition, the workload certification block chain is regarded as a biased random beacon (random number with unequal probability and unpredictable), and is used for electing the equity accounting node in the corresponding POS turn so as to elect the interest stakeholder to maintain the equity certification block chain; that is, the consensus scheme of the present application can be viewed as a rights attestation scheme that uses a chain of workload attestations as biased random beacons.
In order to better illustrate the hybrid consensus protocol of the present application, the following specific embodiments of the hybrid consensus protocol are provided for illustrative purposes:
bottom layer communication function F of mixed consensus protocolNET
Function FNETIs the underlying communication function of the blockchain protocol. The function is set by the upper limit delta of the network delay, is used for capturing the atomic whole network broadcast which is not verified by other nodes in the block chain node asynchronous communication, and interacts with other participants under the relay of an opponent. Function FNETThe execution process of (2) is as follows: each time a message is received from a participant, it is first required to indicate the delivery time of the message. If the specified delivery time exceeds the upper delay limit, the function will not follow the message sender's instructions, but will only delay the message to the maximum round number Δ (i.e., no message delay exceeds the Δ round). All honest references can be obtained by the opponentAll messages sent by the opposite; adversaries may also tamper with the source of the message they send and masquerade as the (honest) sender of the message.
FNETThe execution process of the function is as follows:
the function is parameterized by Δ and is associated with an adversary S and a set of POW accounting nodes { W }1,...WnAnd a set of POS accounting nodes
Figure BDA0002991326740000171
And (6) interacting.
Received from a party P in round r (BROADCAST, m), where
Figure BDA0002991326740000172
(BROADCAST, m) is sent to S and (P, m, b, r) is recorded, where b is 0 and r is the number of rounds.
Received from S (DELAY, m, P', t), where
Figure BDA0002991326740000173
(where S can tamper with the source of the message), then
-if there is a record (P, m, b, r) such that b ≦ 0 and t ≦ Δ, then in round r + t, (MESSAGE, P', m) is sent to all other POW accounting nodes and POS accounting nodes and b is reset to 1.
Otherwise, if t > Δ, (MESSAGE, P', m) is sent to all other POW accounting nodes and POS accounting nodes at r + Δ round and b is reset to 1.
-else, please ignore the message.
POW + POS hybrid consensus protocol
Utilizing workload proofs and equity proofs
Figure BDA0002991326740000181
A hybrid consensus protocol (Π ═ is proposedw,Πs) Wherein
Figure BDA0002991326740000182
Is an ideal function of POW for finding the optimumThe POW block of (1);
Figure BDA0002991326740000183
is an ideal function of POS and is used for selecting the best POS block; fNETIs the bottom layer communication protocol of the block chain; II typewAnd pisRepresenting code executed by the POW accounting node and the POS accounting node, respectively. Assume an execution environment of Z (1)k) (where k is a security parameter) comprising n POW accounting nodes and
Figure BDA0002991326740000184
and the POS accounting nodes execute the protocol in turn. Each turn comprises a POW turn corresponding to a POW accounting node and a POS turn corresponding to a POS accounting node. Adversary a may manage agreement participants in environment Z, or may dynamically destroy honest nodes, but requires 2 Δ rounds to be effective.
In particular, the present invention relates to a method for producing,
Figure BDA0002991326740000185
this is performed as follows. Each participant is in an initial stateoInitialization is performed and this state includes all initial information such as the founder block of the protocol. Environment Z first activates opponent a and provides instructions to the opponent. The protocol is executed round by round, and in each round, the environment may activate the protocol participants.
(1) In each POW round, accounting node W for each POWi(1 ≦ i ≦ n) and its local state is statei(initial state)i＝stateoI.e., the initial value is 0). WiActivated by environment Z, forwarding messages received from environment Z to functions
Figure BDA0002991326740000186
Then the slave function
Figure BDA0002991326740000187
The received message is forwarded to the environment. The specific treatment process is as follows:
environment Z-use (INPUT-WORK, W)iX) message activation POW accounting node WiWhere x is an input from Z, then POW accounting node WiPossibly via an underlying communication protocol FNETReceiving a MESSAGE (MESSAGE, P, m), wherein
Figure BDA00029913267400001810
Then, WiAnd function
Figure BDA0002991326740000188
Interact and get
Figure BDA0002991326740000189
Output y (carrying the best POW block and accounting node information);
POW accounting node WiBy the existing local stateiSlave function F1Received y value, input x from environment Z, and pass FNETReceived message m, execution of POW code ΠwThen updates the local stateiAnd outgoing message m', i.e. { statei,m'}←Πw(stateiX, y, m). Then, send (BROADCAST, m') to FNETAnd will (RETURN-WORK, W)i) And sending to the environment Z.
(2) In each POS round, accounting node for each POS
Figure BDA0002991326740000191
Its local state is statej(initial state)i＝stateoI.e., the initial value is 0). SjActivated by environment Z, forwarding messages received from environment Z to functions
Figure BDA0002991326740000192
Then the slave function
Figure BDA0002991326740000193
The received message is forwarded to the environment. The treatment process is as follows:
when environment Z is used (INPUT-STAKE, S)j，
Figure BDA0002991326740000194
) Message activated POS accounting node SjWherein
Figure BDA0002991326740000195
Is an input from Z, POS accounting node SjPossibly via an underlying communication protocol FNETReceiving a MESSAGE (MESSAGE, P, m), wherein
Figure BDA0002991326740000196
Then, SjAnd function
Figure BDA0002991326740000197
Interact and get
Figure BDA0002991326740000198
Output of (2)
Figure BDA0002991326740000199
(carries the best POS block and accounting node information);
POS accounting node SjBy the existing local statejSlave function F2Received
Figure BDA00029913267400001910
Value, input from the environment Z
Figure BDA00029913267400001911
And by FNETReceived message m, execution of POS code ΠsThen, the local state is updatedjAnd outgoing messages m', i.e
Figure BDA00029913267400001912
Figure BDA00029913267400001913
Then (BROADCAST, m') is sent to FNETAnd (RETURN-STATKE, S)j) And sending to the environment Z.
(3) In any round r, ZA message (CORRUPT, P) can be sent to the adversary A, wherein
Figure BDA00029913267400001914
Letting adversary a access P's local state and control P, starting from round r +2 Δ.
In a hybrid consensus protocol, Π ═ Π (Π)w,Πs) In the POW, the POW accounting node passes through the POW round
Figure BDA00029913267400001915
Searching the best POW block; the POS accounting node grows along with the POW chain in the POS turn and passes through
Figure BDA00029913267400001916
To elect the best POS block and extend the POS chain. Slave network communication protocol F of POW accounting node and POS accounting nodeNETCollecting blockchain information, performing verification and block generation, and then passing through FNETSharing its local state with the network. Protocol pi ═ pi (pi)w,Πs) As shown in fig. 10, specifically, the participant has completed two tasks in the POS round or POW round: determining the best effective chain pair, (2) trying to extend the POS chain or POW chain with the best chain pair.
Referring to fig. 11, fig. 11 is a schematic structural diagram of an embodiment of the hybrid consensus system of the present application. The hybrid consensus system 20 comprises a processor 22, the processor 22 being configured to execute instructions to implement the hybrid consensus method described above. For a specific implementation process, please refer to the description of the foregoing embodiment, which is not repeated herein.
The processor 22 may also be referred to as a CPU (Central Processing Unit). The processor 22 may be an integrated circuit chip having signal processing capabilities. The processor 22 may also be a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components. A general purpose processor may be a microprocessor or the processor 22 may be any conventional processor or the like.
The hybrid consensus system 20 may further include a memory 21 for storing instructions and data required for the operation of a processor 22.
Referring to fig. 12, fig. 12 is a schematic structural diagram of a computer-readable storage medium according to an embodiment of the present disclosure. The computer readable storage medium 30 of an embodiment of the present application stores instructions/program data 31 that when executed enable the method provided by any embodiment of the hybrid consensus method of the present application and any non-conflicting combination. The instructions/program data 31 may form a program file stored in the storage medium 30 in the form of a software product, so as to enable a computer device (which may be a personal computer, a server, or a network device) or a processor (processor) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium 30 includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, or terminal devices, such as a computer, a server, a mobile phone, and a tablet.
In the embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, a division of a unit is merely a logical division, and an actual implementation may have another division, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The above embodiments are merely examples and are not intended to limit the scope of the present disclosure, and all modifications and equivalents that may be made by using the contents of the present disclosure and drawings, or applied directly or indirectly to other related technical fields are intended to be included within the scope of the present disclosure.

Claims (10)

1. A blockchain donation platform, wherein the blockchain donation platform comprises a blockchain module;
the block chain module takes a alliance chain as a bottom layer framework of the block chain donation platform;
the alliance chain is composed of key users and common users, wherein the key users are block chain accounting nodes;
wherein the key users comprise logistics enterprises and charitable institutions, and the common users comprise donors and recourse persons.
2. The blockchain donation platform according to claim 1, wherein the common users are collectively organized into nodes for accounting participation.
3. The blockchain donation platform according to claim 1, wherein the blockchain donation platform includes an information recording module;
the information recording module is used for writing the circulation information of the donated materials into the block chain, and correlating the circulation information of the whole circulation process of the donated materials so as to provide the traceability query of the donated materials.
4. The blockchain donation platform according to claim 1, wherein the blockchain donation platform includes a project management module for providing a publication service for assistance projects, a donation service for the assistance projects, and a help-seeking service for the assistance projects.
5. The blockchain donation platform according to claim 3, wherein the project management module is configured to provide targeted donation services and non-targeted donation services for the assistance projects to donors;
the directed donation has a designated recourse.
6. The blockchain donation platform according to claim 1, wherein the blockchain donation platform includes an information publishing module for publishing assistance items issued by charities, help requests issued by the help seeker for the assistance items, donation requests issued by the donators for the assistance items, and circulation information of each circulation process of donation materials of the donation requests.
7. The blockchain donation platform according to claim 1,
and the block chain module is used for alternately performing POW and POS certification by utilizing a POW and POS mixed consensus protocol to generate a POW and POS block chain pair.
8. The blockchain donation platform according to claim 7, wherein the blockchain module is configured to, in response to the POS accounting node obtaining a plurality of blockchain pairs in the n +1 th round, enable the POS accounting node to screen out a blockchain pair having the same POW accounting node as the POW accounting node corresponding to the POW block in the n +1 th round of the plurality of blockchain pairs, so as to obtain a set of blockchain pairs; and enabling the POS accounting node to screen out the optimal chain pair from the block chain pair set.
9. The blockchain donation platform according to claim 8, wherein the blockchain module is configured to determine the POS out-of-block node by allowing the POS accounting node to perform a equity election using its own equity amount in response to the POS accounting node determining an optimal chain pair; adding new blocks assembled by the POS egress node to the optimal chain pair to generate a new POW and POS block chain pair.
10. The blockchain donation platform according to claim 8, wherein the blockchain module is configured to, in response to the POW accounting node acquiring a plurality of blockchain pairs, enable the POW accounting node to filter out an optimal chain pair from all blockchain pairs; enabling the POW accounting node to calculate the optimal block head so as to determine a random number meeting the target requirement and further determine a POW block outlet node; adding new blocks assembled by the POW out-block nodes to the optimal chain pair to generate new POW and POS block chain pairs.
CN202110315388.4A 2021-03-24 2021-03-24 Block chain donation platform Pending CN113469852A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110315388.4A CN113469852A (en) 2021-03-24 2021-03-24 Block chain donation platform

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110315388.4A CN113469852A (en) 2021-03-24 2021-03-24 Block chain donation platform

Publications (1)

Publication Number Publication Date
CN113469852A true CN113469852A (en) 2021-10-01

Family

ID=77868348

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110315388.4A Pending CN113469852A (en) 2021-03-24 2021-03-24 Block chain donation platform

Country Status (1)

Country Link
CN (1) CN113469852A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114048985A (en) * 2021-11-04 2022-02-15 陕西师范大学 Crowd sensing rescue material collection method based on block chain
CN116781278A (en) * 2023-07-04 2023-09-19 徐州医科大学 RFID protocol method based on blockchain in charity rescue and disaster relief background

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109242477A (en) * 2018-06-28 2019-01-18 平安科技（深圳）有限公司 Charitable donation method, system and storage medium based on block chain
CN110443580A (en) * 2019-08-02 2019-11-12 上海天地汇供应链科技有限公司 A kind of public good management method and system based on block chain
CN111831747A (en) * 2020-06-24 2020-10-27 西安纸贵互联网科技有限公司 Charitable donation service system and charitable donation service platform

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109242477A (en) * 2018-06-28 2019-01-18 平安科技（深圳）有限公司 Charitable donation method, system and storage medium based on block chain
CN110443580A (en) * 2019-08-02 2019-11-12 上海天地汇供应链科技有限公司 A kind of public good management method and system based on block chain
CN111831747A (en) * 2020-06-24 2020-10-27 西安纸贵互联网科技有限公司 Charitable donation service system and charitable donation service platform

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
PEIFANG NI等: "UniqueChain:A Fast，Provably Secure Proof-of-Stake Based Blockchain Protocol in the Open Setting", 《CRYPTOLOGY EPRINT ARCHIVE》 *
TUYET DUONG等: "2-hop Blockchain: Combining Proof-of-Work and Proof-of-Stake Securely", 《COMPUTER SECURITY – ESORICS 2020》 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114048985A (en) * 2021-11-04 2022-02-15 陕西师范大学 Crowd sensing rescue material collection method based on block chain
CN114048985B (en) * 2021-11-04 2022-11-04 陕西师范大学 Crowd sensing rescue material collection method based on block chain
CN116781278A (en) * 2023-07-04 2023-09-19 徐州医科大学 RFID protocol method based on blockchain in charity rescue and disaster relief background

Similar Documents

Publication Publication Date Title
Bhushan et al. Blockchain for smart cities: A review of architectures, integration trends and future research directions
Saxena et al. Blockchain based solutions to secure IoT: Background, integration trends and a way forward
Majeed et al. Blockchain for IoT-based smart cities: Recent advances, requirements, and future challenges
Zheng et al. Blockchain challenges and opportunities: A survey
Garriga et al. Blockchain and cryptocurrencies: A classification and comparison of architecture drivers
Alam et al. Blockchain-based Initiatives: Current state and challenges
CN110599181B (en) Data processing method, device and equipment based on block chain and storage medium
Zheng et al. Blockchain challenges and opportunities: A survey
CN110599213B (en) Article management method and device based on blockchain network and electronic equipment
Ali et al. Blockchain and the future of the internet: A comprehensive review
Mathur et al. A survey on role of blockchain for IoT: Applications and technical aspects
ul Hassan et al. Blockchain and the future of the internet: a comprehensive review
Yadav et al. Digitization of land record through blockchain-based consensus algorithm
US20220036323A1 (en) Electronic wallet allowing virtual currency expiration date
Sharma et al. Internet of things and blockchain: integration, need, challenges, applications, and future scope
Gupta et al. TrailChain: Traceability of data ownership across blockchain-enabled multiple marketplaces
CN113469852A (en) Block chain donation platform
Jain et al. Blockchain for the common good: A digital currency for citizen philanthropy and social entrepreneurship
Dash et al. Artificial intelligence models for blockchain-based intelligent networks systems: Concepts, methodologies, tools, and applications
Teeluck et al. Blockchain technology and emerging communications applications
Feng et al. Blockchain-based secure crowdsourcing in wireless IoT
Vyas et al. Blockchain Technology: Exploring Opportunities, Challenges, and Applications
Anitha et al. The integration of blockchain with IoT in smart appliances: a systematic review
Zainal et al. A decentralized autonomous personal data management system in banking sector
CN110727735A (en) Method, device and equipment for cooperatively completing task event based on block chain technology

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