CN111882745B - Object selection method and device and electronic equipment - Google Patents
Object selection method and device and electronic equipment Download PDFInfo
- Publication number
- CN111882745B CN111882745B CN202010753642.4A CN202010753642A CN111882745B CN 111882745 B CN111882745 B CN 111882745B CN 202010753642 A CN202010753642 A CN 202010753642A CN 111882745 B CN111882745 B CN 111882745B
- Authority
- CN
- China
- Prior art keywords
- block
- application
- candidate
- block chain
- intelligent contract
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
- G07C15/00—Generating random numbers; Lottery apparatus
- G07C15/006—Generating random numbers; Lottery apparatus electronically
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
One or more embodiments of the present specification provide an object selection method and apparatus, and an electronic device, which are applied to a block chain node; the method comprises the following steps: acquiring a candidate application submitted by a candidate object; invoking an intelligent contract, wherein the intelligent contract is used for issuing an application record related to the selected application to a first block of a block chain, generating a random seed according to the block content of a second block in the block chain, and generating a pseudo random number based on the random seed through a pseudo random number generator, so that an alternative object matched with the pseudo random number is selected as a target object; wherein the block height of the second block is greater than the block height of the first block.
Description
Technical Field
One or more embodiments of the present disclosure relate to the field of block chain technologies, and in particular, to an object selection method and apparatus, and an electronic device.
Background
When an event is set to be carried out by a preset number of objects, if the number of candidates exceeds the preset number, a selection needs to be made from among the candidates. When the candidates do not have a significant difference with respect to the implementation of the event, the preset number of objects may be randomly selected from the candidates. For example, when 10 devices are included in the system, if it is desired to configure an architecture of 2 master devices and 8 slave devices, 2 master devices can be randomly selected from the 10 devices, and the remaining 8 devices are slave devices.
Disclosure of Invention
In view of this, one or more embodiments of the present disclosure provide an object selection method and apparatus, and an electronic device.
To achieve the above object, one or more embodiments of the present disclosure provide the following technical solutions:
according to a first aspect of one or more embodiments of the present disclosure, an object selection method is provided, which is applied to a blockchain node; the method comprises the following steps:
acquiring a candidate application submitted by a candidate object;
invoking an intelligent contract, wherein the intelligent contract is used for issuing an application record related to the selected application to a first block of a block chain, generating a random seed according to the block content of a second block in the block chain, and generating a pseudo random number based on the random seed through a pseudo random number generator, so that an alternative object matched with the pseudo random number is selected as a target object; wherein the block height of the second block is greater than the block height of the first block.
According to a second aspect of one or more embodiments of the present specification, an object selection apparatus is provided, which is applied to a blockchain node; the device comprises:
the acquisition unit is used for acquiring the candidate application submitted by the candidate object;
a calling unit, which calls an intelligent contract, wherein the intelligent contract is used for issuing an application record related to the selected application to a first block of a block chain, generating a random seed according to the block content of a second block in the block chain, and generating a pseudo random number based on the random seed through a pseudo random number generator so as to select a candidate object matched with the pseudo random number as a target object; wherein the block height of the second block is greater than the block height of the first block.
According to a third aspect of one or more embodiments of the present specification, there is provided an electronic device comprising:
a processor;
a memory for storing processor-executable instructions;
wherein the processor implements the method as in any of the above embodiments by executing the executable instructions.
Drawings
Fig. 1 is a flowchart of an object selection method according to an exemplary embodiment.
FIG. 2 is a schematic illustration of a rock number for purchasing real estate provided by an exemplary embodiment.
Fig. 3 is a schematic diagram of a number shaking process based on a smart contract according to an exemplary embodiment.
Fig. 4 is a schematic structural diagram of an apparatus provided in an exemplary embodiment.
Fig. 5 is a block diagram of an object selecting apparatus according to an exemplary embodiment.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with one or more embodiments of the present specification. Rather, they are merely examples of apparatus and methods consistent with certain aspects of one or more embodiments of the specification, as detailed in the claims which follow.
It should be noted that: in other embodiments, the steps of the corresponding methods are not necessarily performed in the order shown and described herein. In some other embodiments, the method may include more or fewer steps than those described herein. Moreover, a single step described in this specification may be broken down into multiple steps in other embodiments; multiple steps described in this specification may be combined into a single step in other embodiments.
Fig. 1 is a flowchart of an object selection method according to an exemplary embodiment. As shown in fig. 1, the method applied to the blockchain node may include the following steps:
and 102, acquiring a candidate application submitted by the candidate object.
In one embodiment, the candidate object submits a participation application, so that the intelligent contract can issue a corresponding application record to the blockchain, thereby ensuring that the corresponding candidate object can participate in the object selection process.
In an embodiment, the candidate application may contain identity information of the candidate object, such as a signature generated by the candidate object through a private key, and the identity information may be added to the application record to indicate an association relationship between the application record and the candidate object.
In an embodiment, a transaction (transfer) may be created on the client side of the blockchain, so that the application record corresponding to the candidate is issued to the blockchain through the transaction, and becomes a piece of data in the distributed database of the blockchain. It should be noted that: the transactions in the blockchain have narrow and broad transaction scores. A narrowly defined transaction refers to a transfer of value issued by a user to a blockchain; for example, in a conventional bitcoin blockchain network, the transaction may be a transfer initiated by the user in the blockchain. The generalized transaction refers to a piece of business data with business intention, which is issued to the blockchain by a user; for example, an operator may build a federation chain based on actual business requirements, and rely on the federation chain to deploy some other types of online businesses unrelated to value transfer (e.g., an object selection business, a rental room business, a vehicle dispatching business, an insurance claim settlement business, a credit service, a medical service, etc.), and in such federation chain, a transaction may be a business message or a business request issued by a user in the federation chain with a business intention. The term transaction in this specification should be understood to be a broad term transaction.
In an embodiment, the blockchain adopts a distributed database, so that the application records issued to the blockchain cannot be tampered, and authenticity and reliability can be ensured.
In an embodiment, when the application record is issued to a first block in the block chain and the random seed is associated with a second block having a block height greater than that of the first block, based on the chain relationship between the blocks in the block chain, the addition of the application record can increase the uncertainty of the random seed, which cannot be predicted and set by the lawbreaker, so that the pseudo random number generated based on the random seed also has high randomness, and the possibility of fraud and cheating by the lawbreaker can be greatly reduced.
Meanwhile, the generation process of the random seed and the generation process of the pseudo random number are both realized by the intelligent contract, and the intelligent contract is stored in the block chain, so that the content of the intelligent contract is disclosed and cannot be tampered, the selection process of the target object is fair, disclosed and verifiable, and the possibility of counterfeit and cheating by lawbreakers is further reduced.
In one embodiment, the smart contract may determine a match with the pseudo-random number based on the identification information in digital form that each candidate already has. For example, the identification information may be a user ID of each candidate object, a value of a public key, and the like, which is not limited in this specification.
In one embodiment, the intelligent contract is further for: respectively generating an application number for each alternative object, wherein each application number corresponds to a unique alternative object; wherein, when the pseudo random number is the same as any application number, the candidate corresponding to the any application number is determined to match the pseudo random number.
In an embodiment, the application number may be generated for the candidate object according to a preset manner, for example, an order in which each candidate object submits the participating application, a value and a size of a public key of each candidate object, and the description does not limit this. For example, the application number is related to a value of a unique identifier corresponding to the candidate object, and the value of the unique identifier is obtained by performing hash calculation on a hash value related to a history block in a block chain and a public key of the candidate user, so that the randomness of the value of the unique identifier can be increased, and the possibility of being controlled by a lawbreaker is reduced.
In an embodiment, when the endorsement rate of the candidate object is x times of the standard endorsement rate, the candidate object has x application numbers; wherein x is a positive integer. For example, when x =1, the candidate has 1 application number, and when x =2, the candidate has 2 application numbers; when the number of the application numbers is larger, the probability that the candidate object is selected is also larger, namely the chance of being checked is higher.
In an embodiment, after receiving the application for participating in the selection of any object, the intelligent contract may determine whether the object meets the requirement according to a predefined condition for participating in the selection, and when the object meets the requirement, the intelligent contract may be set as the above-mentioned alternative user so that the intelligent contract can participate in the object selection process. Meanwhile, the intelligent contract can determine the signing rate based on the information of the alternative user; for example, the intelligent contract may query the blockchain account book for the number of times that the candidate historically participates in the object selection, and determine the mid-billing rate according to a set calculation formula, where the mid-billing rate may be positively correlated with the number of times.
In an embodiment, the intelligent contract is configured to perform hash calculation on a hash value related to a history chunk in a chunk chain and a public key of the candidate object to obtain a corresponding unique identifier; when the value of x comprises x 1-xn from small to large, the intelligent contract is used for sequentially selecting x 1-xn; when xi is selected, the intelligent contract arranges the unique identifiers corresponding to the alternative objects with the intermediate signing rate not less than xi times of the standard intermediate signing rate in sequence from small to large, and generates corresponding application numbers continuously according to the arrangement sequence after the application numbers exist, wherein i is more than or equal to 1 and less than or equal to n.
Assume that the number of candidates is m. When x 1-xn are selected in sequence: firstly, selecting x1 and assuming that x1=1, then the 'candidate objects with the intermediate signing rate not less than xi times of the standard intermediate signing rate' are all m candidate objects, and at the moment, application numbers do not exist, so that corresponding m application numbers 1-m can be directly generated; then, x2 is selected and x2=2 is assumed, then "the candidate with the median signature rate not less than xi times of the standard median signature rate" is the candidate with the median signature rate of x 2-xn times, and does not include the candidate with the median signature rate of x1 times, for example, the number of the candidates with the median signature rate of x 2-xn times is a, and since the application numbers 1-m already exist, a application numbers, that is, m + 1-m + a, can be generated continuously after m, at this time, the candidate with the median signature rate of x1 times has 1 application number, and the candidate with the median signature rate of x 2-xn times has 2 application numbers; then, x3 is selected and it is assumed that x3=3, then "the candidate having the median probability not less than xi times of the standard median probability" is the candidate having the median probability from x3 to xn times, and does not include the candidate having the median probability from x1 to x2 times, for example, the number of the candidates having the median probability from x3 to xn times is b, and since the above-mentioned application numbers 1 to m + a exist, b application numbers, that is, m + a +1 to m + a + b, can be generated successively after m + a, and at this time, the candidate having the median probability from x1 times has 1 application number, the candidate having the median probability from x2 times has 2 application numbers, and the candidate having the median probability from x3 to xn times has 3 application numbers. Similarly, after the candidate is sequentially selected to xn in the above manner, the number of application numbers of the candidate is ensured to be the same as the corresponding multiple of the mid-label rate.
In one embodiment, the total number of target objects is w; and the intelligent contract is used for generating 1 pseudo random number through the pseudo random number generator by taking the random seed and the sampling interval [ M, N ] as input when the number of the selected target objects does not reach w, wherein M is the minimum value of the application number, and N is the maximum value of the application number. In other words, when the pseudo random number is generated each time, the adopted sampling interval covers all the application numbers, the application numbers corresponding to the selected target objects cannot be eliminated, the actual endorsement probability of each candidate object is ensured to be unchanged when the pseudo random number is generated each time, the increase of the actual endorsement probability of other candidate users caused by eliminating the application numbers corresponding to the target objects is avoided, and therefore fairness is ensured.
In an embodiment, the intelligent contract is used for storing the application number corresponding to each candidate object in the block chain, so that a candidate user or a supervisor can check the application number from the block chain at any time, and counterfeit cheating is avoided.
In one embodiment, the random seed is further associated with the block content of one or more other blocks in the block chain, so that even if a lawbreaker has the block attack capability, the lawbreaker must attack the second block and the other blocks respectively to achieve the goal, resulting in a very high attack cost, which can greatly reduce the possibility of the lawbreaker manipulating the random seed.
In one embodiment, the one or more other blocks include: the block comprises at least one application record, so that all the application records can influence the random seed, the uncertainty of the random seed can be increased, and the possibility of guessing or manipulating by lawless persons is reduced.
In one embodiment, the one or more other blocks include: one or more blocks adjacent to the second block. For example, when the number of the one or more other blocks is r, r blocks before the second block may be selected; alternatively, after generating the second block, it may wait for the r blocks to continue to be generated in the block chain, and generate a random seed based on the second block and the r blocks.
In one embodiment, the intelligent contract is used to process the contents of the second block and r other blocks (such as the one or more blocks containing the application record, or one or more blocks located after the second block) to determine the actual result by the following formula:
H’1＝H(Hp,Hr)，
h 'i = H (H' (i-1), H (r-i + 1)), where 1 < i ≦ r;
h is a preset hash function, hp is a hash value related to the block content of the second block, hi is a hash value related to the block content of the ith other block, and Hf = H (H' r, hp) is the random seed.
In an embodiment, in the process of calculating through the above formula, the r other blocks may be sequentially arranged according to a preset order to form 1 st other block, \8230;, and the r other blocks, for example, the preset order may include an order of block heights from small to large, an order of hash values of block contents from small to large, and the like, which is not limited in this specification.
In one embodiment, the intelligent contract is used for generating the random seed after a third block is generated in the block chain; the block height of the third block is larger than that of the second block, and the height difference is a preset value. In other words, the intelligent contract determines the random seed based on the content of the second block, but does not determine the random seed immediately after the second block is generated, but determines the random seed after a preset number of blocks are waited, so that the security of the second block is ensured, an attacker must continuously attack all blocks between the second block and the third block, the attack cost is extremely high, and the possibility that a lawbreaker manipulates the random seed can be greatly reduced.
For ease of understanding, the object selection scheme in this specification will be described below by taking the number shaking process in the case of purchasing no-motion products as an example. FIG. 2 is a schematic illustration of a swing number for purchasing real estate provided by an exemplary embodiment; as shown in fig. 2, assuming that a user a wishes to participate in a number shake for a certain floor, the user a can submit a number shake application required for applying a number shake qualification, such as identification material, deposit identification material, a public key corresponding to a digital identity, personal details, and the like, through a mobile phone 21 in which a client is installed, depending on the requirements of a floor developer or related laws and regulations.
The device 22 is configured as a server of a numbering system, the device 22 interacting on the one hand with the handset 21 used by the user a to assist him in applying for a numbering qualification and on the other hand with the device 23. The device 23 is configured as a blockchain node in the blockchain, and based on the information provided by the device 22, can configure and issue an intelligent contract, and implement number shaking and qualification application, number shaking operation, and the like by calling the intelligent contract. The intelligent contract can be configured by a building developer or a notary department of shaking numbers to set application conditions of qualification of shaking numbers, various stages contained in the process of shaking numbers (for example, various stages are divided based on time or various stages are divided based on block heights on a block chain), processing logic adopted in each stage and the like, so that the intelligent contract can be used for realizing an object selection scheme of the specification to complete corresponding shaking number operation.
Assuming that the configuration process for an intelligent contract has been completed and the intelligent contract has been published into a blockchain, a shake process as shown in fig. 3 may be implemented based on the intelligent contract, which may include the following steps:
in step 301, a user applies for a shake qualification.
In one embodiment, user a may submit a shake request to device 22 via cell phone 21 and submit a transaction containing the shake request to the blockchain via device 23, where the type of transaction may be configured or tagged as the type of shake qualification to be applied. Similarly, other users may also apply for a pan qualification in the manner described above to participate in a pan with user a.
In addition to submitting transactions containing requests for shake to the blockchain through the device 23, the user a may also submit transactions containing requests for shake to the blockchain through other blockchain nodes, for example, the mobile phone 21 may be configured as a blockchain node, and then the user a may submit transactions containing requests for shake to the blockchain based on the mobile phone 21.
The above-mentioned transactions containing the shaking number applications can be recorded into the blockchain ledger, and the intelligent contracts can be inquired and accessed from the blockchain ledger to obtain the shaking number applications contained in the transactions, so as to verify whether the corresponding users can obtain the shaking number qualification.
In an embodiment, taking the device 23 as an example, the device 23 may acquire information such as a name or a location of the smart contract, so that the device 23 may directly send the shake number application to the smart contract, and the smart contract may perform verification on the received shake number application to determine whether a corresponding user may obtain shake number qualification.
In step 302, the smart contract verifies the user information.
In one embodiment, after the intelligent contract obtains a shaking number application of a certain user, the shaking number application can be verified according to a predefined application condition to determine whether the shaking number application meets the application condition; if yes, judging that the corresponding user has the shaking number qualification, otherwise, judging that the corresponding user does not have the shaking number qualification.
In one embodiment, the shake application contains the public key and other personal information of the corresponding user, and the shake application should be signed by the private key of the user to ensure that the content is authentic, valid and not tampered.
And step 303, storing the verification result in the block chain account book by the intelligent contract.
In one embodiment, the verification result is stored in the block chain account book, which is equivalent to disclosing the verification result, so that the verification result is transparent and traceable, and the verification result cannot be tampered randomly, thereby ensuring that the verification of the shaking number application meets the requirement and avoiding the operation of a dark box.
In step 304, the intelligent contract generates a qualification number for the verified user, and the qualification number is deposited in the block chain ledger.
In an embodiment, assuming that the stages are divided by block heights, the intelligent contract may define a block height range corresponding to each stage, such as an application stage, a numbering stage, and a number shaking stage, for example, the block heights corresponding to the application stage are T0-T1, the block heights corresponding to the numbering stage are T2-T3, and the block heights corresponding to the number shaking stage are T4-T5. Then, for the application stage, the intelligent contract may read, from the block chain ledger, the shaking applications recorded in the blocks at the height from T0 to T1, and only these shaking applications may participate in the current shaking process, while the shaking applications in other blocks cannot participate in the current shaking process.
In one embodiment, the intelligent contract may generate the qualification number for the authenticated user in a preset manner, which is not limited in this specification. By way of example, the eligibility number may be generated as follows:
first, the mid-rate of each user is determined. The intelligent contract can read and count the number shaking activities historically participated in by each user from the block chain account book, and determines the mid-signing rate based on the statistical data; for example, when the number of shaking numbers historically participated in is not greater than a first numerical value, the medium-grade-rate may be a standard medium-grade-rate, when the number of shaking numbers is greater than the first numerical value and not greater than a second numerical value, the medium-grade-rate may be 2 times of the standard medium-grade-rate, when the number of shaking numbers is greater than the second numerical value and not greater than a third numerical value, the medium-grade-rate may be 3 times of the standard medium-grade-rate, and so on. Of course, the mid-billing rate of each user can also be calculated by other methods and recorded into the blockchain ledger, and the intelligent contract only needs to read the mid-billing rate corresponding to each verified user from the blockchain ledger.
Secondly, the intelligent contract may respectively calculate the transition ID corresponding to each user based on the verified public key pk of each user and the hash value PreH of the designated history block. For example, a hash function H () may be set in the intelligent contract, and the transition ID corresponding to each user may be H (PreH, pk), that is, the hash value PreH and the public key pk are calculated through the hash function H (), so as to obtain a corresponding hash value, so that the transition ID has extremely high randomness and cannot be controlled by a lawless person.
The intelligent contracts may then be assigned corresponding qualification numbers to the respective users based on the generated transitional IDs. Assuming that the verified users are U1-Um, and the mid-sign rates of the users are 1, 2, 3 times of the standard mid-sign rate (8230) \8230Oz; n times of the standard mid-sign rate, the intelligent contract can implement the following operations:
selecting all users with the medium subscription rate not less than 1 time of the standard medium subscription rate from the users U1-Um, namely selecting the users U1-Um; and sequentially arranging the selected m users according to the sequence of the transition IDs from small to large, and then generating corresponding qualification numbers based on the arrangement sequence. Since there is no generated eligibility number, the eligibility number generated at this time may be started from the beginning, for example, generating eligibility number 1 for the user with the smallest transition ID and generating eligibility number 2 for the user with the second smallest transition ID until generating eligibility number m for the user with the largest transition ID. Therefore, for all users whose mid-subscription rate is not less than 1 time of the standard mid-subscription rate, corresponding m qualification numbers, which are 1 to m above, can be generated at this time; in other words, each user has 1 corresponding qualification number at this time.
Further, all users with the medium-signed rate not less than 2 times of the standard medium-signed rate are selected from the users U1-Um, namely the users with the medium-signed rate 2-n times of the standard medium-signed rate, and the number of the users is assumed to be a; and sequentially arranging the selected a users according to the transition IDs from small to large, and then generating corresponding qualification numbers based on the arrangement sequence. Since there are generated eligibility numbers 1 to m, the eligibility numbers are generated successively at this time, for example, the eligibility number m +1 is generated for the user with the smallest transition ID, and the eligibility number m +2 is generated for the user with the second smallest transition ID until the eligibility number m + a is generated for the user with the largest transition ID. Therefore, for all users whose mid-subscription rate is not less than 2 times of the standard mid-subscription rate, corresponding a qualification numbers, which are m +1 to m + a respectively, can be generated at this time. At this time, for the users with the intermediate signing rate 1 time of the standard intermediate signing rate, each user has 1 qualification number; and for users with the middle signing rate not less than 2 times of the standard middle signing rate, each user has 2 qualification numbers.
Further, all users with the medium subscription rate not less than 3 times of the standard medium subscription rate are selected from the users U1-Um, namely the users with the medium subscription rate 3-n times of the standard medium subscription rate, and the number of the users is assumed to be b; and sequentially arranging the selected b users according to the transition IDs from small to large, and then generating corresponding qualification numbers based on the arrangement sequence. Since there are the generated qualification numbers 1 to m + a, the qualification numbers are generated successively at this time, for example, the qualification number m + a +1 is generated for the user with the smallest transition ID, and the qualification number m + a +2 is generated for the user with the second smallest transition ID, until the qualification number m + a + b is generated for the user with the largest transition ID. Therefore, for all users whose endorsement rate is not less than 3 times of the standard endorsement rate, b qualification numbers can be generated, which are m + a +1 to m + a + b. At this time, for the users with the intermediate signing rate 1 time of the standard intermediate signing rate, each user has 1 qualification number; for users whose mid-signing rate is not less than 2 times of the standard mid-signing rate, each user has 2 qualification numbers; and for users with the middle-signed rate not less than 3 times of the standard middle-signed rate, each user has 3 qualification numbers.
By analogy, the intelligent contract can allocate corresponding qualification numbers to corresponding users respectively by the above mode aiming at each intermediate signing rate, and finally, i qualification numbers can be allocated to the users with the intermediate signing rate being i times of the standard intermediate signing rate, wherein i is more than or equal to 1 and less than or equal to n.
In an embodiment, the qualification numbers corresponding to all the users participating in the number shaking are stored in the block chain account book, so that the qualification numbers of the users are public, transparent, queriable and not falsifiable, and therefore, in the subsequent number shaking process, whether the users shake can be accurately determined based on the qualification numbers, and the method has extremely high fairness, openness and reliability.
In step 305, the intelligent contract monitors the generated blocks in the block chain ledger, and when the block height of the nearest block reaches P, the intelligent contract waits for the Q blocks to be continuously generated in the block chain ledger and then goes to step 306.
In one embodiment, P and Q are both predefined arbitrary values. When the block height range corresponding to the number shaking stage is T4-T5, P is more than T4 and less than or equal to P + Q is less than T5; in other words, the value of Q may be 0, i.e. the block height P is reached before proceeding to step 306, rather than waiting. When Q is more than 0, the value of Q is related to the speed of generating the blocks in the block chain, and the block with the height of P is not changed after Q blocks; and by waiting for Q blocks, the safety of the block with the height of P can be ensured, an attacker must continuously attack all the blocks with the heights of P and P + Q, so that the attack cost is extremely high, and the possibility of manipulating the shaking number by a lawless person can be greatly reduced.
Step 306, the intelligent contract generates a random seed.
In an embodiment, the intelligent contract may respectively determine a block with a height P and r blocks in a block chain that include a shake application associated with the shake, and respectively obtain hash values of the blocks (the hash values are associated with the block contents of the corresponding blocks), such as: the blocks with height P correspond to hash values Hp, and the hash values corresponding to r blocks are H1-Hr respectively (e.g., the blocks may be arranged in order of block height from small to large). Further, the intelligent contract may be calculated according to the following formula:
H’1＝H(Hp,Hr)，
h 'i = H (H' (i-1), H (r-i + 1)), where 1 < i ≦ r;
h (Hp, hr) represents that the corresponding hash value H'1 is obtained by performing hash operation on Hp and Hr through the hash function H; similarly, H (H ' (i-1), H (r-i + 1)) represents that the hash function H performs hash operation on H ' (i-1) and H (r-i + 1) to obtain a corresponding hash value H ' i. Finally, the calculation result can be calculated to be H 'r, and the random seed is Hf = H (H' r, hp), so that the shaking applications provided by all users can influence the value of the random seed, and lawless persons cannot control the shaking applications submitted by all users, so that the value of the random seed cannot be controlled.
Of course, besides r blocks including the shaking applications, other types of blocks may be selected, and this specification does not limit this. For example, after waiting for the block with height P to be generated, continuing to wait for the Q blocks, and generating a random seed based on the Q blocks and the block with height P; wherein:
H’1＝H(Hp,HQ)，
h 'i = H (H' (i-1), H (Q-i + 1)), where 1 < i ≦ Q;
h (Hp, HQ) represents that the H and HQ (the Hash value of a block with the height of P is assumed to be Hp, and the Hash values of the Q blocks are H1 and H2 \8230; HQ) are subjected to Hash operation through the Hash function H to obtain a corresponding Hash value H'1; similarly, H (H ' (i-1), H (Q-i + 1)) represents that the hash function H is used to hash H ' (i-1) and H (Q-i + 1) to obtain a corresponding hash value H ' i. Finally, the calculation result can be calculated as H 'Q, while the random seed is Hf = H (H' Q, hp).
And 307, generating a Chinese signing number by the intelligent contract, and storing the Chinese signing number in a block chain account book.
In one embodiment, the smart contract may invoke a set pseudo-random number generator for generating the mid-signature number. The input data for being a pseudo random number generator may include: random seeds and sampling intervals; wherein: the random seed is Hf generated in the above process, and the sampling interval may be generated according to a value range of the qualification number of each user, for example, when the minimum value of the qualification number is 1 and the maximum value is Y, the sampling interval may be set to [1, Y ] so that the hash number generated by the pseudo random number generator is in the range [1, Y ].
Assuming that the number of the medium signs is w, when the number of the signed users is smaller than w, the intelligent contract can generate a medium sign number matched with the random seed Hf and the sampling interval [1, Y ] through the pseudo-random number generator, and after the qualification number matched with the medium sign number is determined, whether the user corresponding to the qualification number has been previously signed is determined, if the user has not been signed, the user is determined to be drawn, otherwise, the medium sign number is invalid, and the user needs to continue to be drawn. Although the signed users are continuously generated in the process, the qualification numbers corresponding to the signed users are ensured to be constant in the sampling interval and not to be removed, so that the actual signing probability corresponding to each user is ensured not to be changed in the whole process, the actual signing probability is not increased due to the removal of the signed users, and the fairness of number shaking can be ensured.
In one embodiment, the Chinese signed number is stored in the block chain account book, so that a user or a supervisor can check and verify at any time, and a lawbreaker is prevented from tampering. Taking the user a as an example, the user a may initiate an inquiry request to the device 22 through the mobile phone 21, the device 22 may inquire the blockchain account book through the device 23, and return the inquired number shaking result to the mobile phone 21 for the user a to check, so as to ensure whether the user a has a purchase right of real estate; similarly, when the user a disagrees with the number shaking process, the related data in the blockchain ledger can be retroactively queried through the above process, and the whole process and the data generated by the process are transparent.
FIG. 4 is a schematic block diagram of an apparatus provided in an exemplary embodiment. Referring to fig. 4, at the hardware level, the apparatus includes a processor 402, an internal bus 404, a network interface 406, a memory 408, and a non-volatile memory 410, but may also include hardware required for other services. The processor 402 reads the corresponding computer program from the non-volatile memory 410 into the memory 408 and runs the computer program to form the object selection device on a logical level. Of course, besides the software implementation, the one or more embodiments in this specification do not exclude other implementations, such as logic devices or combination of software and hardware, and so on, that is, the execution subject of the following processing flow is not limited to each logic unit, and may also be hardware or logic devices.
Referring to fig. 5, in a software implementation, the object selection apparatus is applied to a blockchain node; the apparatus may include:
an obtaining unit 51, which obtains a candidate application submitted by a candidate object;
a calling unit 52, which calls an intelligent contract, the intelligent contract is used for issuing an application record related to the selected application to a first block of the block chain, generating a random seed according to the block content of a second block in the block chain, and generating a pseudo random number based on the random seed through a pseudo random number generator, so that a candidate object matched with the pseudo random number is selected as a target object; wherein the block height of the second block is greater than the block height of the first block.
Optionally, the intelligent contract is further configured to: respectively generating an application number for each alternative object, wherein each application number corresponds to a unique alternative object; wherein, when the pseudo random number is the same as any application number, the candidate corresponding to the application number is determined to match the pseudo random number.
Optionally, the application number is related to a value of a unique identifier corresponding to the candidate object, and the value of the unique identifier is obtained by performing hash calculation on a hash value related to a history block in a block chain and a public key of the candidate user.
Optionally, when the rate of the candidate object is x times of the standard rate, the candidate object has x application numbers; wherein x is a positive integer.
Optionally, the intelligent contract is configured to perform hash calculation on a hash value related to a historical block in a block chain and a public key of the candidate object to obtain a corresponding unique identifier;
when the value of x comprises x 1-xn from small to large, the intelligent contract is used for sequentially selecting x 1-xn; when xi is selected, the intelligent contract arranges the unique identifiers corresponding to the alternative objects with the intermediate signing rate not less than xi times of the standard intermediate signing rate in sequence from small to large, and generates corresponding application numbers continuously according to the arrangement sequence after the application numbers exist, wherein i is more than or equal to 1 and less than or equal to n.
Optionally, the total number of the target objects is w; and the intelligent contract is used for generating 1 pseudo random number by the pseudo random number generator by taking the random seed and the sampling interval [ M, N ] as input when the number of the selected target objects does not reach w, wherein M is the minimum value of the application number, and N is the maximum value of the application number.
Optionally, the intelligent contract is used for storing the application number corresponding to each candidate in the blockchain.
Optionally, the random seed is further related to the block content of one or more other blocks in the block chain.
Optionally, the one or more other blocks include: comprises at least one block applying for recording.
Optionally, the one or more other blocks include: one or more blocks adjacent to the second block.
Optionally, the intelligent contract is used to process the contents of the second block and the r other blocks by the following formula to determine the actual result:
H’1＝H(Hp,Hr)，
h 'i = H (H' (i-1), H (r-i + 1)), where 1 < i ≦ r;
h is a predetermined hash function, hp is a hash value related to the contents of the second block, hi is a hash value related to the contents of the ith other block, and the random seed is Hf = H (H' r, hp).
Optionally, the intelligent contract is used for generating the random seed after a third block is generated in the block chain; the block height of the third block is greater than that of the second block, and the height difference is a preset value.
The systems, devices, modules or units illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. A typical implementation device is a computer, which may be in the form of a personal computer, laptop, cellular telephone, camera phone, smart phone, personal digital assistant, media player, navigation device, email messaging device, game console, tablet computer, wearable device, or a combination of any of these devices.
In a typical configuration, a computer includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both permanent and non-permanent, removable and non-removable media, may implement the information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic disk storage, quantum memory, graphene-based storage media or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
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 phrases "comprising a," "8230," "8230," or "comprising" does not exclude the presence of other like elements in a process, method, article, or apparatus comprising the element.
The foregoing description has been directed to specific embodiments of this disclosure. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims can be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing may also be possible or may be advantageous.
The terminology used in the description of the one or more embodiments is for the purpose of describing the particular embodiments only and is not intended to be limiting of the description of the one or more embodiments. As used in this specification and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.
It should be understood that although the terms first, second, third, etc. may be used in one or more embodiments of the present description to describe various information, such information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, first information may also be referred to as second information, and similarly, second information may also be referred to as first information, without departing from the scope of one or more embodiments herein. The word "if," as used herein, may be interpreted as "at \8230; \8230when" or "when 8230; \823030when" or "in response to a determination," depending on the context.
The above description is intended only to be exemplary of the one or more embodiments of the present disclosure, and should not be taken as limiting the one or more embodiments of the present disclosure, as any modifications, equivalents, improvements, etc. that come within the spirit and scope of the one or more embodiments of the present disclosure are intended to be included within the scope of the one or more embodiments of the present disclosure.
Claims (18)
1. An object selection method is applied to a block chain node; the method comprises the following steps:
acquiring a candidate application submitted by a candidate object;
issuing an application record related to the participating application to a first block of a block chain by calling an intelligent contract deployed in the block chain;
generating a random seed according to the block content of a second block in the block chain by calling an intelligent contract deployed in the block chain, and generating a pseudo random number based on the random seed through a pseudo random number generator so that a candidate object matched with the pseudo random number is selected as a target object, wherein the block height of the second block is larger than that of the first block.
2. The method of claim 1, further comprising:
respectively generating application numbers for each alternative object by calling an intelligent contract deployed in a block chain, wherein each application number corresponds to a unique alternative object;
when the pseudo random number is the same as any application number, the candidate corresponding to the any application number is determined to match the pseudo random number.
3. The method of claim 2, wherein the application number is related to a value of a unique identifier corresponding to the candidate object.
4. The method according to claim 3, wherein the value of the unique identifier corresponding to the candidate object includes at least one of:
and the candidate object submits a value of a candidate request sequence, a value of a public key of the candidate object, and a calculated value obtained by performing hash calculation on a hash value related to a history block in the block chain and the public key of the candidate object.
5. The method according to claim 2, wherein when the candidate object has a median rate x times of a standard median rate, the candidate object has x application numbers; wherein x is a positive integer.
6. The method of claim 5, further comprising:
and inquiring the historical times of the candidate object participating object selection from a block chain account book by calling an intelligent contract deployed in the block chain, and determining the mid-signing rate of the candidate object according to a preset calculation formula, wherein the mid-signing rate of the candidate object is related to the historical times.
7. The method of claim 5, further comprising:
carrying out hash calculation on a hash value related to a historical block in a block chain and a public key of the candidate object by calling an intelligent contract deployed in the block chain to obtain a unique identifier corresponding to the candidate object;
when the values of x from small to large respectively comprise x 1-xn, sequentially selecting x 1-xn by calling an intelligent contract; when xi is selected, unique identifications corresponding to the alternative objects with the middle signing rate not less than xi times of the standard middle signing rate are sequentially arranged from small to large by calling an intelligent contract, corresponding application numbers are generated continuously according to the arrangement sequence after the application numbers exist, and i is more than or equal to 1 and less than or equal to n.
8. The method of claim 2, the total number of target objects being w; the method further comprises the following steps:
and by calling an intelligent contract deployed in a block chain, under the condition that the number of the selected target objects does not reach w, the random seed and the sampling interval [ M, N ] are used as input to generate 1 pseudo random number through the pseudo random number generator, wherein M is the minimum value of the application number, and N is the maximum value of the application number.
9. The method of claim 2, further comprising:
and storing the application number corresponding to each alternative object into the block chain by calling an intelligent contract deployed in the block chain.
10. The method of claim 1, the random seed further relating to tile content of one or more other tiles in a tile chain.
11. The method of claim 10, the one or more other tiles comprising: comprises at least one block applying for recording.
12. The method of claim 10, the one or more other tiles comprising: one or more blocks adjacent to the second block.
13. The method of claim 10, the smart contract for processing the block contents of the second block and r other blocks to determine the random seed by:
H’1＝H(Hp,Hr)，
h 'i = H (H' (i-1), H (r-i + 1)), where 1 < i ≦ r;
h is a preset hash function, hp is a hash value related to the block content of the second block, hi is a hash value related to the block content of the ith other block, and Hf = H (H' r, hp) is the random seed.
14. The method of claim 1, the generating a random seed from block content of a second block in a block chain, comprising:
and generating the random seed after a third block is generated in the block chain, wherein the block height of the third block is greater than that of the second block, and the height difference is a preset value.
15. The method according to claim 1, wherein the candidate application further comprises identity information of the candidate object; the method further comprises the following steps:
and in the case that the identity information of the candidate object comprises a signature generated by the candidate object for the candidate application, verifying the signature by calling an intelligent contract deployed in a blockchain.
16. An object selection device is applied to a block chain node; the device comprises:
the acquisition unit is used for acquiring a candidate application submitted by an alternative object;
the issuing unit is used for issuing application records related to the selected applications to a first block of the block chain by calling intelligent contracts deployed in the block chain;
the generating unit is used for generating a random seed according to the block content of a second block in the block chain by calling an intelligent contract deployed in the block chain, and generating a pseudo random number based on the random seed through a pseudo random number generator so as to select a candidate object matched with the pseudo random number as a target object, wherein the block height of the second block is greater than the block height of the first block.
17. An electronic device, comprising:
a processor;
a memory for storing processor-executable instructions;
wherein the processor implements the method of any one of claims 1-15 by executing the executable instructions.
18. A computer readable storage medium having stored thereon computer instructions which, when executed by a processor, carry out the steps of the method according to any one of claims 1-15.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010753642.4A CN111882745B (en) | 2018-10-26 | 2018-10-26 | Object selection method and device and electronic equipment |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010753642.4A CN111882745B (en) | 2018-10-26 | 2018-10-26 | Object selection method and device and electronic equipment |
| CN201811258150.7A CN109584432B (en) | 2018-10-26 | 2018-10-26 | Object selection method and device and electronic equipment |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811258150.7A Division CN109584432B (en) | 2018-10-26 | 2018-10-26 | Object selection method and device and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111882745A CN111882745A (en) | 2020-11-03 |
| CN111882745B true CN111882745B (en) | 2022-12-20 |
Family
ID=65920850
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811258150.7A Active CN109584432B (en) | 2018-10-26 | 2018-10-26 | Object selection method and device and electronic equipment |
| CN202010753642.4A Active CN111882745B (en) | 2018-10-26 | 2018-10-26 | Object selection method and device and electronic equipment |
Family Applications Before (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811258150.7A Active CN109584432B (en) | 2018-10-26 | 2018-10-26 | Object selection method and device and electronic equipment |
Country Status (3)
| Country | Link |
|---|---|
| CN (2) | CN109584432B (en) |
| TW (1) | TW202016813A (en) |
| WO (1) | WO2020082883A1 (en) |
Families Citing this family (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109584432B (en) * | 2018-10-26 | 2020-06-30 | 阿里巴巴集团控股有限公司 | Object selection method and device and electronic equipment |
| CN110163753A (en) * | 2019-04-23 | 2019-08-23 | 阿里巴巴集团控股有限公司 | Houseclearing based on block chain deposits card, application method and device |
| CN110780847B (en) * | 2019-10-15 | 2022-02-25 | 腾讯科技（深圳）有限公司 | Random number generation method, random number generation device and electronic equipment |
| CN110990808B (en) * | 2019-11-21 | 2022-04-01 | 杭州趣链科技有限公司 | Notarization number shaking method based on block chain |
| CN110910559B (en) * | 2019-11-25 | 2021-06-25 | 杭州趣链科技有限公司 | Lottery drawing method based on block chain |
| CN111429643B (en) * | 2020-03-18 | 2022-07-08 | 南京巨公科技有限公司 | Method and device for shaking numbers and storage medium |
| CN111626850B (en) * | 2020-06-05 | 2023-04-18 | 中国银行股份有限公司 | Deposit information processing method and device, readable medium and equipment |
| CN111884807B (en) * | 2020-07-13 | 2021-10-26 | 腾讯科技（深圳）有限公司 | Article reservation method, apparatus, device and medium based on block chain |
| CN111562969B (en) * | 2020-07-15 | 2020-10-20 | 百度在线网络技术（北京）有限公司 | Intelligent contract implementation method, device, equipment and medium for block chain |
| CN112163237A (en) * | 2020-09-01 | 2021-01-01 | 北京字节跳动网络技术有限公司 | Data processing method and device and electronic equipment |
| CN112562168B (en) * | 2020-11-27 | 2022-08-02 | 中国联合网络通信集团有限公司 | Block chain-based online shaking method, system, equipment and storage medium |
| CN112954039A (en) * | 2021-02-04 | 2021-06-11 | 上海百姓装潢有限公司 | Block chain evidence storage method |
| CN113672763B (en) * | 2021-07-30 | 2023-10-10 | 北京奇艺世纪科技有限公司 | Video data extraction method and device, electronic equipment and storage medium |
| CN115083062B (en) * | 2022-07-22 | 2022-12-09 | 阿里健康科技(杭州)有限公司 | Information processing method, information transmitting method, computer device, and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101364928A (en) * | 2007-08-06 | 2009-02-11 | 曹炜斌 | Method and system enhancing network information resource distribution |
| CN105069561A (en) * | 2015-07-30 | 2015-11-18 | 四川建设网有限责任公司 | Bidding evaluation expert extraction method and device |
| CN107341695A (en) * | 2017-07-12 | 2017-11-10 | 重庆浩品峰电子商务有限公司 | Lottery drawing method and device |
| CN107820690A (en) * | 2017-08-21 | 2018-03-20 | 达闼科技成都有限公司 | Information choosing method, device, electronic equipment and computer-readable recording medium |
| CN108648323A (en) * | 2018-05-10 | 2018-10-12 | 广州市申迪计算机系统有限公司 | Choosing method, device, computer equipment and the storage medium of target information |
Family Cites Families (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2009169489A (en) * | 2008-01-11 | 2009-07-30 | Oki Electric Ind Co Ltd | Encryption method, decryption method, encryption device, and decryption device |
| CN105162760B (en) * | 2015-07-28 | 2018-08-14 | 郝孟一 | Randomly select method, apparatus and system |
| US20170109955A1 (en) * | 2015-10-20 | 2017-04-20 | Follow My Vote, Inc. | Blockchain electronic voting system and method |
| CN105871855B (en) * | 2016-04-11 | 2019-09-13 | 杨鹏 | The method and system that a kind of electronic equipment identification code is generated, stores and identified |
| CN106157142A (en) * | 2016-06-30 | 2016-11-23 | 惠众商务顾问（北京）有限公司 | A kind of block chain common recognition and synchronous method, system and device |
| CN106296200A (en) * | 2016-08-13 | 2017-01-04 | 深圳市樊溪电子有限公司 | Distributed photovoltaic electric power transaction platform based on block chain technology |
| CN106980488A (en) * | 2017-03-14 | 2017-07-25 | 腾讯科技（深圳）有限公司 | Random digit generation method and device |
| CN107294727B (en) * | 2017-05-22 | 2020-06-19 | 联动优势科技有限公司 | Electronic voting method, terminal equipment and block chain network |
| CN107103097A (en) * | 2017-05-22 | 2017-08-29 | 中链科技有限公司 | Drawing method and terminal device based on block chain technology |
| CN107146318A (en) * | 2017-06-05 | 2017-09-08 | 上海交通大学 | Ballot system based on ideal money |
| CN108109257A (en) * | 2018-01-05 | 2018-06-01 | 杭州电子科技大学 | A kind of Anonymous Electronic Voting method based on block chain |
| CN108269090B (en) * | 2018-01-19 | 2021-04-20 | 中国科学院软件研究所 | Consensus method and device for block chain system based on non-negotiation random drawing |
| CN108665272A (en) * | 2018-05-02 | 2018-10-16 | 百度在线网络技术（北京）有限公司 | Block chain data processing method, device, equipment and storage medium |
| CN108665274A (en) * | 2018-05-14 | 2018-10-16 | 北京链享未来科技有限公司 | A kind of accounting nodes intelligent selecting method |
| CN109242677A (en) * | 2018-07-27 | 2019-01-18 | 阿里巴巴集团控股有限公司 | Object select method and device, electronic equipment |
| CN109615370A (en) * | 2018-10-25 | 2019-04-12 | 阿里巴巴集团控股有限公司 | Object select method and device, electronic equipment |
| CN109584432B (en) * | 2018-10-26 | 2020-06-30 | 阿里巴巴集团控股有限公司 | Object selection method and device and electronic equipment |
-
2018
- 2018-10-26 CN CN201811258150.7A patent/CN109584432B/en active Active
- 2018-10-26 CN CN202010753642.4A patent/CN111882745B/en active Active
-
2019
- 2019-03-21 TW TW108109778A patent/TW202016813A/en unknown
- 2019-08-27 WO PCT/CN2019/102777 patent/WO2020082883A1/en active Application Filing
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101364928A (en) * | 2007-08-06 | 2009-02-11 | 曹炜斌 | Method and system enhancing network information resource distribution |
| CN105069561A (en) * | 2015-07-30 | 2015-11-18 | 四川建设网有限责任公司 | Bidding evaluation expert extraction method and device |
| CN107341695A (en) * | 2017-07-12 | 2017-11-10 | 重庆浩品峰电子商务有限公司 | Lottery drawing method and device |
| CN107820690A (en) * | 2017-08-21 | 2018-03-20 | 达闼科技成都有限公司 | Information choosing method, device, electronic equipment and computer-readable recording medium |
| CN108648323A (en) * | 2018-05-10 | 2018-10-12 | 广州市申迪计算机系统有限公司 | Choosing method, device, computer equipment and the storage medium of target information |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111882745A (en) | 2020-11-03 |
| WO2020082883A1 (en) | 2020-04-30 |
| CN109584432B (en) | 2020-06-30 |
| TW202016813A (en) | 2020-05-01 |
| CN109584432A (en) | 2019-04-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111882745B (en) | Object selection method and device and electronic equipment | |
| CN108985644B (en) | Rights and interests distribution method and device and electronic equipment | |
| CN108492180B (en) | Asset management method and device and electronic equipment | |
| WO2020082873A1 (en) | Object selection method and device and electronic device | |
| CN109325747B (en) | Remittance method and device based on block chain | |
| KR20200091882A (en) | Incremental digital asset collateral wallet | |
| JP2020522927A (en) | Blockchain for general calculation | |
| CN111461691B (en) | Flow statistical system, method and device based on block chain | |
| CN110008716B (en) | Block chain transaction method and device, electronic equipment and storage medium | |
| CN109598504A (en) | Transaction processing method and device, electronic equipment based on block chain | |
| CN110189122B (en) | Method and device for anchoring time for data on block chain and electronic equipment | |
| CN108831001B (en) | Block chain-based node random selection method, system, node and electronic equipment | |
| CN111383114A (en) | Asset information management method and device based on block chain | |
| CN110458561B (en) | Method and device for realizing confidential transaction in block chain network | |
| CN111402033A (en) | Asset information management method and device based on block chain | |
| CN111784341A (en) | Block chain transaction method and device, electronic equipment and storage medium | |
| CN113221191B (en) | Block chain-based data evidence storage method, device, equipment and storage medium | |
| CN112561407B (en) | Asset management method, system and device based on block chain | |
| CN114817888A (en) | Certificate registering and issuing method, device and storage medium | |
| 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 | |
| TW202016807A (en) | Event prediction method and device and electronic equipment | |
| CN109146147A (en) | Event prediction method and device, electronic equipment | |
| CN113095913A (en) | Block chain-based shopping method | |
| CN111931219A (en) | Data storage method and device and data query method and device |
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 | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 40039793 Country of ref document: HK |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |