CN112995300B - Block link point reward method, equipment and storage medium - Google Patents
Block link point reward method, equipment and storage medium Download PDFInfo
- Publication number
- CN112995300B CN112995300B CN202110167586.0A CN202110167586A CN112995300B CN 112995300 B CN112995300 B CN 112995300B CN 202110167586 A CN202110167586 A CN 202110167586A CN 112995300 B CN112995300 B CN 112995300B
- Authority
- CN
- China
- Prior art keywords
- node
- information
- block chain
- link point
- reward
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3297—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving time stamps, e.g. generation of time stamps
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Computing Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a block link point reward method, equipment and a storage medium, belonging to the technical field of computers, wherein the method comprises the following steps: acquiring reward request information awarded by a distribution node, wherein the reward request information is used for rewarding block link points; the reward request information comprises the number of externally connected nodes of each node in the block chain network and the total amount of awards issued in a preset time period of the block chain system; dividing the total amount of the rewards into basic rewards and extra rewards according to a proportion preset by a block chain system, wherein the basic rewards are averagely distributed to each node in a block chain network; and determining the proportion of the extra reward occupied by each node according to the connected node amount of each node. And the incentives are differentially distributed according to the node service capacity, so that the incentives are more reasonable, and the node deployment enthusiasm is effectively improved.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a block link point reward method, block link point reward equipment and a storage medium.
Background
In order to maintain the number of nodes of the blockchain network and ensure the stability of the nodes, a blockchain system generally periodically issues node rewards to enable the nodes of the blockchain network to maintain the consumption of the nodes, the existing node reward schemes are mostly issued in a mode of averagely distributing the node rewards to all online nodes at present, but because the nodes with better performance mean higher cost, the average rewards cannot cover the cost of deploying the nodes, and the deployment of high-end nodes cannot be effectively stimulated.
Disclosure of Invention
Objects of the invention
In view of the above technical problems, the present invention provides a method, device and storage medium for rewarding block link points, which provides differentiated node rewards for the block link points, increases the enthusiasm of high-performance nodes, and effectively improves the node deployment enthusiasm.
Second, technical scheme
In order to solve the technical problems, the technical scheme provided by the invention is as follows:
in a first aspect, a method of block link point reward includes:
acquiring reward request information awarded by the issuing node, wherein the reward request information is used for rewarding the block chain link points; the reward request information comprises the number of externally connected nodes of each node in the block chain network and the total amount of awards issued in a preset time period of the block chain system;
dividing the total amount of the rewards into basic rewards and extra rewards according to a proportion preset by a block chain system, wherein the basic rewards are averagely distributed to each node in a block chain network;
and determining the proportion of the extra reward occupied by each node according to the connected node amount of each node.
Preferably, the step of acquiring the connected node amount includes:
each block chain link point acquires the node ID of the node connected with the block chain link point, and constructs ID information of each externally connected node;
each block link point carries out self node signature on the ID information of the external connection node and uploads the ID information to a block chain;
and counting the connected node quantity of each node by taking the node ID as a unit, wherein the connected node quantity is the sum of the times of appearance of the node ID of the counted node in the external connection node ID information of other nodes.
Preferably, the node ID and the external connection node ID information of the node are stored in association with each other.
Preferably, the node ID and the information of the external connection node ID of the node are stored in a Key Value, and a Key Value data pair is constructed and stored with the node ID as Key and the information of the external connection node ID of the node as Value.
Preferably, the step of acquiring the connected node amount includes:
s1, each block chain link point acquires the node ID of the node connected with the block chain link point, constructs the ID information of each externally connected node and sets a timestamp;
s2, each block link point carries out self node signature on the ID information of the external connection node with the timestamp and uploads the ID information to a block chain;
s3, periodically repeating the steps S1 and S2;
s4, reading all self external connection node ID information in a set time period by block chain link points; the block chain node counts the occurrence frequency of the node ID of the connection node; taking the node ID with the frequency larger than a set threshold value as the external connection node ID information of the block chain node; the block chain link point uploads the ID information of the external connection node; each block link point uploads respective external node ID information;
and S5, counting the connected node quantity of each node by taking the node ID as a unit, wherein the connected node quantity is the sum of the times of appearance of the node ID of the counted node in the external connection node ID information of other nodes.
Preferably, the repetition period of steps S1 and S2 is set in advance by the blockchain system.
Preferably, the set time in step S4 is a time interval from the last award issued by the node.
Preferably, the repetition cycle of steps S1 and S2 coincides with the set time in step S4.
In a second aspect, a computer device, one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method of any one of the first aspect and its preferred aspects.
In a third aspect, a storage medium stores a computer program which, when executed by a processor, implements a method as set forth in any one of the first aspect and its preferred embodiments.
Third, beneficial effect
Compared with the prior art, the technical scheme provided by the invention has the following beneficial effects:
1. the reward of the block chain link points is divided into basic reward and extra reward, the stability of the whole node of the block chain is maintained by equally dividing the basic reward by all the block chain nodes, and the incentive nodes are rewarded additionally to achieve differential distribution and improve the enthusiasm of the nodes.
2. The additional rewards are positively correlated with the service capacity of the nodes, and the rewards are differentially distributed according to the service capacity of the nodes, so that the method is more reasonable and effectively improves the node deployment enthusiasm.
Drawings
FIG. 1 is a schematic view of a method according to example 1 of the present invention;
fig. 2 is a schematic diagram of a specific step of acquiring the connected node amount in embodiment 1 of the present invention;
fig. 3 is a schematic diagram of a specific step of acquiring the connected node amount in embodiment 2 of the present invention;
fig. 4 is a schematic diagram of a specific step of determining an external connection node ID of each block chain node according to embodiment 2 of the present invention;
fig. 5 is a schematic structural diagram of an apparatus provided in embodiment 2.
Detailed Description
For a further understanding of the present invention, reference will now be made in detail to the embodiments illustrated in the drawings.
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
The terms first, second, and the like in the present invention are provided for convenience of describing the technical solution of the present invention, and have no specific limiting effect, but are all generic terms, and do not limit the technical solution of the present invention.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
Example 1
As shown in fig. 1 and 2, a block link point reward method includes:
acquiring reward request information awarded by the issuing node, wherein the reward request information is used for rewarding the block chain link points; the reward request information comprises the number of externally connected nodes of each node in the block chain network and the total amount of awards issued in a preset time period of the block chain system;
dividing the total amount of the rewards into basic rewards and extra rewards according to a proportion preset by a block chain system, wherein the basic rewards are averagely distributed to each node in a block chain network;
and determining the proportion of the extra reward occupied by each node according to the connected node amount of each node.
In the scheme, the node rewards are divided into the basic rewards and the extra rewards to realize different reward purposes, the basic rewards are averagely distributed to all online nodes, the consumption of the nodes is maintained, and the stability of the overall nodes of the blockchain network is ensured; the additional rewards are differently rewarded according to the service capacity of the nodes, the enthusiasm of the nodes is stimulated, the service performance of the nodes is objectively evaluated by adopting the connected node quantity of the nodes in the scheme, more nodes are connected, the consumption is more, and more nodes are rewarded.
Further, the acquiring of the connected number includes:
each block chain link point acquires the node ID of the node connected with the block chain link point, and respective external connection node ID information is constructed;
each block link point carries out self node signature on the ID information of the external connection node and uploads the ID information to a block chain;
and counting the connected node quantity of each node by taking the node ID as a unit, wherein the connected node quantity is the sum of the times of appearance of the node ID of the counted node in the external connection node ID information of other nodes.
The connected number of the nodes is determined through the statistics of the opposite end nodes, and the statistics has the advantages that the dishonest condition of the nodes can be better eliminated, the dishonest condition is sent to the block chain after the self signature, the authenticity of data is guaranteed, the dishonest nodes are prevented from being masqueraded as other nodes to send wrong information, and therefore unfairness of reward distribution is caused.
Further, the node ID and the external connection node ID information of the node are stored correspondingly.
Further, the node ID and the external connection node ID information of the node are stored in a Key Value, and a Key Value data pair is constructed and stored with the node ID as Key and the external connection node ID information of the node as Value.
The key value pair is adopted, so that the storage efficiency is high, the occupied space is small, and the compatibility is good.
In summary, compared with the prior art, the embodiment has the following beneficial effects:
1. the reward of the block chain link points is divided into basic reward and extra reward, the stability of the whole node of the block chain is maintained by equally dividing the basic reward by all the block chain nodes, and the incentive nodes are rewarded additionally to achieve differential distribution and improve the enthusiasm of the nodes.
2. The additional rewards are positively correlated with the service capacity of the nodes, and the rewards are distributed in a differentiated mode according to the service capacity of the nodes, so that the method is more reasonable and the node deployment enthusiasm is effectively improved.
Example 2
The other parts of this embodiment are substantially the same as those of embodiment 1, except that:
as shown in fig. 3 and 4, the acquiring step of the number of connected nodes includes:
s1, each block chain link point acquires the node ID of the node connected with the block chain link point, constructs the ID information of each externally connected node and sets a timestamp;
s2, each block link point carries out self node signature on the ID information of the external connection node with the timestamp and uploads the ID information to a block chain;
s3, periodically repeating the steps S1 and S2;
s4, reading all self external connection node ID information in a set time period by block chain link points; the block chain node counts the occurrence frequency of the node ID of the connection node; taking the node ID with the frequency larger than a set threshold value as the external connection node ID information of the block chain node; the block chain link point uploads the ID information of the external connection node; each block link point uploads respective external node ID information;
and S5, counting the connected node quantity of each node by taking the node ID as a unit, wherein the connected node quantity is the sum of the times of appearance of the node ID of the counted node in the external connection node ID information of other nodes.
Further, the repetition period of steps S1 and S2 is preset by the blockchain system.
Further, the set time in step S4 is the time interval from the last award issued by the node.
Further, the repetition period of steps S1 and S2 coincides with the set time in step S4.
In this embodiment, after a node operates stably, a stable external connection is counted, the external connection represents a connection initiated by the node as a client to a certain node, node ID information of nodes connected to opposite ends is acquired, the signature of the node is added, the data is periodically written into a block chain, the data is signed by the node, the stability of the connection can be determined according to a certainty rule, if the frequency of node IDs appearing in a certain period without disconnection or multiple writing is greater than a certain threshold, the cycle time can be configured, and the configuration of this embodiment is equal to a node reward distribution period; when the reward is issued, the ID information of the external connection nodes reported by all the online nodes is pulled, and the quantity of the connected nodes is counted by taking the node ID as a unit, namely the number of records reported by other nodes in a period. Taking A, B, C nodes as an example, let a and B actively connect to C, a and B will report the ID of the external connection node C in the period, and when counting, the number of connected nodes of C is 2. After the number of connected nodes of all online nodes is obtained, the nodes with the number of connected nodes larger than 0 are screened out, extra node reward distribution is carried out on the nodes, the nodes are distributed in the same proportion by taking the number of connected nodes as a reference, if the number of connected nodes of A is 2 times that of B, the reward is also 2 times, the configuration of node hardware, a network and the like determines the upper limit capable of supporting the number of connected nodes, the higher the number of passive connected nodes is, the stronger the service providing capability is equivalent to, the larger the network composition proportion is, the larger the contribution to the network stability is, and therefore more extra reward is obtained. And the connected number is reported to the block chain by the opposite end node, and the data is real and credible.
Example 3
An apparatus, the apparatus comprising: one or more processors; memory for storing one or more programs that, when executed by the one or more processors, cause the one or more processors to perform the method of embodiment 1 or embodiment 2.
A storage medium storing a computer program which, when executed by a processor, implements the method described in the present application.
Fig. 5 is a schematic structural diagram of an apparatus provided in this embodiment.
As shown in fig. 5, as another aspect, the present application also provides an apparatus 500 including one or more Central Processing Units (CPUs) 501 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. In the RAM503, various programs and data necessary for the operation of the apparatus 500 are also stored. The CPU501, ROM502, and RAM503 are connected to each other via a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
The following components are connected to the I/O interface 505: an input portion 506 including a keyboard, a mouse, and the like; an output portion 507 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication via a network such as the internet, and the processing driver 510 is also connected to the I/O interface 505 as necessary. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as necessary, so that a computer program read out therefrom is mounted into the storage section 508 as necessary.
In particular, according to embodiments disclosed herein, the method described in embodiment 1 above may be implemented as a computer software program. For example, embodiments disclosed herein include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing the method described in any of the embodiments above. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 509, and/or installed from the removable medium 511.
As yet another aspect, the present application also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the apparatus of the above-described embodiment; or it may be a separate computer readable storage medium not incorporated into the device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the methods described herein.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units or modules described in the embodiments of the present application may be implemented by software or hardware. The described units or modules may also be provided in a processor, for example, each of the described units may be a software program provided in a computer or a mobile intelligent device, or may be a separately configured hardware device. Wherein the designation of a unit or module does not in some way constitute a limitation of the unit or module itself.
The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention herein disclosed is not limited to the particular combination of features described above, but also encompasses other arrangements formed by any combination of the above features or their equivalents without departing from the spirit of the present application. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.
Claims (10)
1. A method of block link point reward, comprising:
acquiring reward request information awarded by a distribution node, wherein the reward request information is used for rewarding block link points; the reward request information comprises the number of externally connected nodes of each node in the block chain network and the total amount of awards issued in a preset time period of the block chain system;
dividing the total amount of the rewards into basic rewards and additional rewards according to a proportion preset by a block chain system, wherein the basic rewards are averagely distributed to each node in a block chain network;
and determining the proportion of the extra reward occupied by each node according to the connected node amount of each node.
2. A block link point reward method of claim 1, wherein the step of obtaining the amount of connected nodes comprises:
each block chain link point acquires the node ID of the node connected with the block chain link point, and constructs ID information of each externally connected node;
each block link point carries out self node signature on the ID information of the external connection node and uploads the ID information to a block chain;
and counting the connected node quantity of each node by taking the node ID as a unit, wherein the connected node quantity is the sum of the times of appearance of the node ID of the counted node in the external connection node ID information of other nodes.
3. A block link point reward method as claimed in claim 2, wherein the node ID and the node's external connection node ID information are stored correspondingly.
4. A block link point reward method as claimed in claim 3, wherein the node ID and the information of the external connection node ID of the node are stored in a Key Value, and the Key Value data pair is constructed and stored with the node ID as Key and the information of the external connection node ID of the node as Value.
5. A block link point reward method as claimed in claim 1, wherein the step of obtaining the number of connected nodes comprises:
s1, each block chain link point acquires the node ID of the node connected with the block chain link point, constructs the ID information of each externally connected node and sets a timestamp;
s2, each block link point carries out self node signature on the ID information of the external connection node with the timestamp and uploads the ID information to a block chain;
s3, periodically repeating the steps S1 and S2;
s4, reading all self external connection node ID information in a set time period by the block chain link points; the block chain node counts the occurrence frequency of the node ID of the connection node; taking the node ID with the frequency larger than a set threshold value as the external connection node ID information of the block chain node; the block chain link point uploads the ID information of the external connection node; each block link point uploads respective external node ID information;
and S5, counting the connected node quantity of each node by taking the node ID as a unit, wherein the connected node quantity is the sum of the times of appearance of the node ID of the counted node in the external connection node ID information of other nodes.
6. A method as claimed in claim 5, wherein the repetition period of steps S1 and S2 is preset by the blockchain system.
7. A block link point reward method of claim 5 or 6, wherein the set time in step S4 is the time interval from the last time the node reward was issued.
8. A block link point reward method as claimed in claim 7, wherein the repetition period of steps S1 and S2 coincides with the set time in step S4.
9. A computer device, characterized by one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method recited in any of claims 1-8.
10. A storage medium storing a computer program, characterized in that the program, when executed by a processor, implements the method according to any one of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110167586.0A CN112995300B (en) | 2021-02-07 | 2021-02-07 | Block link point reward method, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110167586.0A CN112995300B (en) | 2021-02-07 | 2021-02-07 | Block link point reward method, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112995300A CN112995300A (en) | 2021-06-18 |
| CN112995300B true CN112995300B (en) | 2022-06-24 |
Family
ID=76348782
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110167586.0A Active CN112995300B (en) | 2021-02-07 | 2021-02-07 | Block link point reward method, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112995300B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106022933A (en) * | 2016-04-29 | 2016-10-12 | 颜陈煜 | System and method of information transmission based on relation chain |
| CN108768700A (en) * | 2018-05-11 | 2018-11-06 | 北京奇虎科技有限公司 | Reward distribution method, apparatus and system in a kind of block chain |
| CN110062923A (en) * | 2016-10-17 | 2019-07-26 | Arm有限公司 | Mine is dug using the block chain of trusted node |
| CN110956350A (en) * | 2018-09-27 | 2020-04-03 | 阿里巴巴集团控股有限公司 | Method, device and system for distributing rewards |
| CN111369270A (en) * | 2018-12-25 | 2020-07-03 | 阿里巴巴集团控股有限公司 | Method, device and system for distributing reward resources |
| CN111784519A (en) * | 2020-07-07 | 2020-10-16 | 中国联合网络通信集团有限公司 | Mining reward method and system based on block chain, computer equipment and medium |
| CN112258046A (en) * | 2020-10-23 | 2021-01-22 | 上海物融智能科技有限公司 | Data processing method, related node and system applied to block chain |
-
2021
- 2021-02-07 CN CN202110167586.0A patent/CN112995300B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106022933A (en) * | 2016-04-29 | 2016-10-12 | 颜陈煜 | System and method of information transmission based on relation chain |
| CN110062923A (en) * | 2016-10-17 | 2019-07-26 | Arm有限公司 | Mine is dug using the block chain of trusted node |
| CN108768700A (en) * | 2018-05-11 | 2018-11-06 | 北京奇虎科技有限公司 | Reward distribution method, apparatus and system in a kind of block chain |
| CN110956350A (en) * | 2018-09-27 | 2020-04-03 | 阿里巴巴集团控股有限公司 | Method, device and system for distributing rewards |
| CN111369270A (en) * | 2018-12-25 | 2020-07-03 | 阿里巴巴集团控股有限公司 | Method, device and system for distributing reward resources |
| CN111784519A (en) * | 2020-07-07 | 2020-10-16 | 中国联合网络通信集团有限公司 | Mining reward method and system based on block chain, computer equipment and medium |
| CN112258046A (en) * | 2020-10-23 | 2021-01-22 | 上海物融智能科技有限公司 | Data processing method, related node and system applied to block chain |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112995300A (en) | 2021-06-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104834731B (en) | A kind of recommended method and device from media information | |
| Gautreau et al. | Microdynamics in stationary complex networks | |
| Bakshy et al. | Identifying influencers on twitter | |
| Bakshy et al. | Everyone's an influencer: quantifying influence on twitter | |
| Hodas et al. | Friendship paradox redux: Your friends are more interesting than you | |
| Honey et al. | Network structure of cerebral cortex shapes functional connectivity on multiple time scales | |
| CN109063010B (en) | Opinion leader mining method based on PageRank | |
| Machado | Does destination image influence the length of stay in a tourism destination? | |
| Boxma et al. | Queue lengths and workloads in polling systems | |
| US8966071B2 (en) | Method and system for tracking a cumulative number of identifiable visitors to different objects | |
| CN109190028A (en) | Activity recommendation method, apparatus, electronic equipment and storage medium based on big data | |
| Derzsi et al. | Topology of the Erasmus student mobility network | |
| Yang et al. | The effects of attribute persistence on cooperation in evolutionary games | |
| CN110471945A (en) | Processing method, system, computer equipment and the storage medium of alive data | |
| CN110019786B (en) | Topic sending method and topic list ordering method and device for network community | |
| CN112995300B (en) | Block link point reward method, equipment and storage medium | |
| Bi et al. | Temporal gravity model for important node identification in temporal networks | |
| Cohen-Blankshtain et al. | Modelling ICT perceptions and views of urban front-liners | |
| CN114153862B (en) | Service data processing method, device, equipment and storage medium | |
| Humblet et al. | Core group evolution over time: high-risk sexual behavior in a birth cohort between sexual debut and age 26 | |
| CN109637640A (en) | A kind of time-out intelligent change the place of examination method, system, computer equipment and readable medium | |
| US20190081920A1 (en) | Dynamic Email Content Engine | |
| Yoneki et al. | Distinct types of hubs in human dynamic networks | |
| CN112907293A (en) | Reward information providing method and device, electronic equipment and storage medium | |
| Gu et al. | A local-world node deleting evolving network model |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |