CN112232954A - Dynamic adjustment method and device for proposal timeout threshold value and electronic equipment - Google Patents
Dynamic adjustment method and device for proposal timeout threshold value and electronic equipment Download PDFInfo
- Publication number
- CN112232954A CN112232954A CN202011100701.4A CN202011100701A CN112232954A CN 112232954 A CN112232954 A CN 112232954A CN 202011100701 A CN202011100701 A CN 202011100701A CN 112232954 A CN112232954 A CN 112232954A
- Authority
- CN
- China
- Prior art keywords
- proposal
- consensus
- blank
- node
- nil
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 43
- 230000002596 correlated effect Effects 0.000 claims abstract description 14
- 238000004590 computer program Methods 0.000 claims description 8
- 230000000694 effects Effects 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 5
- 230000008569 process Effects 0.000 description 5
- 230000000875 corresponding effect Effects 0.000 description 3
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 238000011022 operating instruction Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- 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]
Abstract
The embodiment of the specification relates to a method and a device for dynamically adjusting a proposed timeout threshold value, and electronic equipment, and the method mainly comprises the following steps: each node sets and records the number R of the participated consensus rounds and the blank count Nil _ R; the proposal consensus node acquires the transaction when in transaction, and if the transaction pool is empty, the proposal consensus node sends a blank proposal without transaction content; the proposal consensus node and other consensus nodes receiving the proposal do not vote for the blank proposal in the first stage and increment the blank count Nil _ R of the proposal node and other consensus nodes receiving the proposal; and setting the proposal overtime threshold of the first-stage voting to be positively correlated with the consensus round number R and negatively correlated with the blank count Nil _ R. By the method, the effect that the block cannot be generated when no transaction exists in the transaction pool and the proposal overtime threshold value of the first-stage voting is dynamically adjusted can be achieved, so that after the application system is idle for a long time and a user transaction arrives, consensus and the block generation can be rapidly achieved.
Description
Technical Field
The embodiment of the specification relates to the technical field of networks, in particular to a method and a device for dynamically adjusting a proposal timeout threshold value and electronic equipment.
Background
In the existing blockchain system, for example, a BFT consensus algorithm system is adopted, a time threshold for block overtime is preset in the consensus process, and a block is generated in a preset time range regardless of whether a transaction of a user arrives or not. In the blockchain system of the semi-synchronous network hypothesis consensus protocol, after view switching or the number of consensus rounds is increased, the consensus mechanism tests the network condition by gradually increasing the proposal timeout threshold. When the proposed timeout threshold increases, it inevitably results in a delay in transaction speed. Meanwhile, for a block chain system with relatively few applications, the proportion of empty blocks without any transaction content is particularly large, a lot of disk space is occupied, and the speed of subsequent retrieval is indirectly reduced.
Disclosure of Invention
The embodiment of the specification provides a dynamic adjustment method and device for a proposed timeout threshold value and electronic equipment, and aims to solve the problems that in the prior art, a large number of blank blocks are generated without transaction, and the block output speed is low.
In order to solve the above technical problem, the embodiments of the present specification adopt the following technical solutions:
in a first aspect, a method for dynamically adjusting a proposed timeout threshold is provided, which is applied to a blockchain system, and the method includes:
each node sets and records the number R of the participated consensus rounds and the blank count Nil _ R; wherein the blank count is the number of proposals without transaction content sent or received by the node;
the proposal consensus node acquires the transaction when in transaction, and if the transaction pool is empty, the proposal consensus node sends a blank proposal without transaction content;
the proposal consensus node and other consensus nodes receiving the proposal do not vote for the blank proposal in the first stage and increment the blank count Nil _ R of the proposal node and other consensus nodes receiving the proposal;
and setting the proposal overtime threshold of the first-stage voting to be positively correlated with the consensus round number R and negatively correlated with the blank count Nil _ R.
In a second aspect, an apparatus for dynamically adjusting a proposed timeout threshold is provided, which is applied to a blockchain system, and the apparatus includes:
setting a module: setting and recording the number R of participating consensus rounds and a blank count Nil _ R for each node; wherein the blank count is the number of proposals without transaction content sent or received by the node;
a proposal acquisition module: the proposal consensus node is used for acquiring the transaction when the proposal consensus node carries out the transaction, and if the transaction pool is empty, the proposal consensus node sends a blank proposal without transaction content;
a first stage voting module: the system comprises a blank proposal receiving node, a proposal consensus node and other consensus nodes, wherein the blank proposal receiving node is used for setting the proposal consensus node and other consensus nodes receiving the proposal not to perform first-stage voting on the blank proposal and increasing the blank count Nil _ R of the blank proposal by self;
a timeout threshold setting module: the proposal timeout threshold for setting the first-stage vote is positively correlated with the consensus round number R and negatively correlated with the blank count Nil _ R.
In a third aspect, an electronic device is provided, including: one or more processors and memory, wherein the memory contains one or more computer programs executable by the one or more processors to cause the one or more processors to perform a method for dynamic adjustment of a proposed timeout threshold provided in accordance with embodiments of the present invention.
In a fourth aspect, the present invention further provides a storage medium storing a computer program, the computer program enabling a computer to execute the method for dynamically adjusting the proposed timeout threshold according to the embodiments of the present invention.
The embodiment of the specification adopts at least one technical scheme which can achieve the following beneficial effects: when there are no transactions in the transaction pool, then no blocks are issued. By counting blank proposals without transaction contents of the nodes and dynamically adjusting the proposal overtime threshold of the first-stage voting, after the application system is idle for a long time and user transactions arrive, consensus can still be rapidly achieved and blocks can be generated. In addition, the negotiation of the block timeout time between the consensus nodes is carried out at a fixed frequency, and the consensus pace is adjusted.
Drawings
In order to more clearly illustrate the embodiments of the present specification or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only some embodiments described in the embodiments of the present specification, and for those skilled in the art, other drawings can be obtained according to the drawings without any creative efforts.
FIG. 1 is a schematic diagram illustrating steps of a method for dynamically adjusting a proposed timeout threshold according to an embodiment of the present disclosure;
FIG. 2 is a schematic structural diagram of a dynamic adjustment apparatus for a proposed timeout threshold provided in an embodiment of the present specification;
fig. 3 is a schematic structural diagram of an electronic device provided in an embodiment of this specification.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present disclosure more clear, the technical solutions of the embodiments of the present disclosure will be clearly and completely described below with reference to the specific embodiments of the present disclosure and the accompanying drawings. It is to be understood that the embodiments described are only a few embodiments of the present disclosure, and not all embodiments. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments in the present specification without any creative effort belong to the protection scope of the embodiments in the present specification.
The technical solutions provided by the embodiments of the present description are described in detail below with reference to the accompanying drawings.
Example one
Referring to fig. 1, a proposed dynamic timeout threshold adjustment method provided in an embodiment of the present disclosure is applied to a blockchain system, and the method includes:
step 101: each node sets and records the number R of the participated consensus rounds and the blank count Nil _ R; wherein the blank count is the number of proposals without transaction content sent or received by the node;
step 102: the proposal consensus node acquires the transaction when in transaction, and if the transaction pool is empty, the proposal consensus node sends a blank proposal without transaction content;
step 103: the proposal consensus node and other consensus nodes receiving the proposal do not vote for the blank proposal in the first stage and increment the blank count Nil _ R of the proposal node and other consensus nodes receiving the proposal;
step 104: and setting the proposal overtime threshold of the first-stage voting to be positively correlated with the consensus round number R and negatively correlated with the blank count Nil _ R.
The method may further include: and when the timeout waiting time of the first-stage voting reaches the proposal timeout threshold, starting the second-stage voting, voting by all nodes after the first-stage voting does not receive the voting with the effective threshold, entering the next round of consensus, and simultaneously increasing the number R of the consensus rounds by all the nodes.
It should be noted that: because the vote is not carried out after other consensus nodes (Voter) receive the blank proposal (proposal), the counting of the vote cannot reach the legal vote number, so the consensus nodes enter the proposal overtime waiting time in the first stage of the vote, and start the second round of the vote after the overtime waiting time is reached.
The setting of the proposal timeout threshold may further comprise: setting a basic time threshold value of the proposal overtime; the proposed timeout threshold for the first stage vote is M times the base time threshold, where M is R-Nil _ R + 1.
For example: in the block chain system, firstly setting a basic time threshold value Timeout as Q seconds; in round 4 consensus (R equals 3, since round 4 consensus has not ended yet, the number of rounds has not been incremented yet), a first blank count occurs, (Nil _ R equals 1), and the proposed timeout threshold proposal _ wait for the first phase vote of this round is 3Q seconds.
It can be seen that when there is a continuous non-transaction, the system will not go empty quickly, and the setting of the proposed timeout threshold will be adjusted along with the increase of the blank count, so that when a new transaction is obtained from the transaction pool, the voting can still be commonly and quickly identified and block-out.
It should be noted that: the technical scheme of the embodiment of the invention is suitable for the block chain system adopting the semi-synchronous network hypothesis consensus protocol, such as the block chain system adopting BFT consensus.
The method may further comprise the step of blank count synchronization:
setting the number of updating rounds of blank counting;
and with the updating round number as an interval, broadcasting the blank count Nil _ R of the node to other common nodes by all common nodes, and updating the blank count Nil _ R of all the nodes according to the maximum value of all the blank counts Nil _ R.
Through the technical scheme of the specification, when no transaction exists in the transaction pool, no block is generated. By counting blank proposals without transaction contents of the nodes and dynamically adjusting the proposal overtime threshold of the first-stage voting, after the application system is idle for a long time and user transactions arrive, consensus can still be rapidly achieved and blocks can be generated. In addition, the negotiation of the block timeout time between the consensus nodes is carried out at a fixed frequency, and the consensus pace is adjusted.
Example two
Referring to fig. 2, a schematic structural diagram of a dynamic adjustment apparatus for a proposed timeout threshold provided in an embodiment of the present disclosure is shown, where the apparatus mainly includes:
the setting module 201: setting and recording the number R of participating consensus rounds and a blank count Nil _ R for each node; wherein the blank count is the number of proposals without transaction content sent or received by the node;
the proposal acquisition module 202: the proposal consensus node is used for acquiring the transaction when the proposal consensus node carries out the transaction, and if the transaction pool is empty, the proposal consensus node sends a blank proposal without transaction content;
the first stage voting module 203: the system comprises a blank proposal receiving node, a proposal consensus node and other consensus nodes, wherein the blank proposal receiving node is used for setting the proposal consensus node and other consensus nodes receiving the proposal not to perform first-stage voting on the blank proposal and increasing the blank count Nil _ R of the blank proposal by self;
timeout threshold setting module 204: the proposal timeout threshold for setting the first-stage vote is positively correlated with the consensus round number R and negatively correlated with the blank count Nil _ R.
The device can also further comprise a second-stage voting module, which is used for starting the second-stage voting after the timeout waiting time of the first-stage voting reaches the proposal timeout threshold, entering the next round of consensus after all the nodes vote for the first-stage voting without receiving the effective threshold, and simultaneously increasing the number R of the consensus rounds by each node.
The timeout threshold setting module may further include: setting a basic time threshold value of the proposal overtime; the proposed timeout threshold for the first stage vote is M times the base time threshold, where M is R-Nil _ R + 1.
It should be noted that: the technical scheme of the embodiment of the invention is suitable for the block chain system adopting the semi-synchronous network hypothesis consensus protocol, such as the block chain system adopting BFT consensus.
Further, the apparatus further comprises a blank count synchronization module configured to:
setting the number of updating rounds of blank counting;
and with the updating round number as an interval, broadcasting the blank count Nil _ R of the node to other common nodes by all common nodes, and updating the blank count Nil _ R of all the nodes according to the maximum value of all the blank counts Nil _ R.
Through the technical scheme of the specification, when no transaction exists in the transaction pool, no block is generated. By counting blank proposals without transaction contents of the nodes and dynamically adjusting the proposal overtime threshold of the first-stage voting, after the application system is idle for a long time and user transactions arrive, consensus can still be rapidly achieved and blocks can be generated. In addition, the negotiation of the block timeout time between the consensus nodes is carried out at a fixed frequency, and the consensus pace is adjusted.
It should be understood that the dynamic adjustment apparatus for the proposed timeout threshold described in the second embodiment may execute all technical solutions related to the dynamic adjustment method for the proposed timeout threshold in the form of a functional module, and implement corresponding technical effects, which are not described herein again.
EXAMPLE III
Fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present disclosure. Referring to fig. 3, at a hardware level, the electronic device includes a processor, and optionally further includes an internal bus, a network interface, and a memory. The Memory may include a Memory, such as a Random-Access Memory (RAM), and may further include a non-volatile Memory, such as at least 1 disk Memory. Of course, the electronic device may also include hardware required for other services.
The processor, the network interface, and the memory may be connected to each other via an internal bus, which may be an ISA (Industry Standard Architecture) bus, a PCI (Peripheral Component Interconnect) bus, an EISA (Extended Industry Standard Architecture) bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one double-headed arrow is shown in FIG. 3, but this does not indicate only one bus or one type of bus.
And the memory is used for storing programs. In particular, the program may include program code comprising computer operating instructions. The memory may include both memory and non-volatile storage and provides instructions and data to the processor.
The processor reads the corresponding computer program from the nonvolatile memory into the memory and then runs the computer program, and a dynamic adjusting device for the proposal overtime threshold value is formed on the logic level. The processor executes the program stored in the memory, and is specifically used for executing the method operations executed when the dynamic adjustment device for the proposed timeout threshold is taken as an execution subject.
The method performed by the apparatus according to the embodiments shown in fig. 1 and fig. 2 of the present specification may be implemented in a processor or implemented by a processor. The processor may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuits of hardware in a processor or instructions in the form of software. The Processor may be a general-purpose Processor, including a Central Processing Unit (CPU), a Network Processor (NP), and the like; but also Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components. The methods, steps, and logic blocks disclosed in one or more embodiments of the present specification may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with one or more embodiments of the present disclosure may be embodied directly in hardware, in a software module executed by a hardware decoding processor, or in a combination of the hardware and software modules executed by a hardware decoding processor. The software module may be located in ram, flash memory, rom, prom, or eprom, registers, etc. storage media as is well known in the art. The storage medium is located in a memory, and a processor reads information in the memory and completes the steps of the method in combination with hardware of the processor.
The electronic device may also execute the method of fig. 1 and implement the functions of the corresponding apparatus in the embodiment shown in fig. 1, which are not described herein again in this specification.
Of course, besides the software implementation, the electronic device of the embodiment of the present disclosure does not exclude other implementations, such as a logic device or a combination of software and hardware, and the like, that is, the execution subject of the following processing flow is not limited to each logic unit, and may also be hardware or a logic device.
Through the technical scheme of the specification, when no transaction exists in the transaction pool, no block is generated. By counting blank proposals without transaction contents of the nodes and dynamically adjusting the proposal overtime threshold of the first-stage voting, after the application system is idle for a long time and user transactions arrive, consensus can still be rapidly achieved and blocks can be generated. In addition, the negotiation of the block timeout time between the consensus nodes is carried out at a fixed frequency, and the consensus pace is adjusted.
Example four
Embodiments of the present specification also provide a storage medium storing a computer program, the computer readable storage medium storing one or more programs for use by a processor to perform the method for dynamically adjusting a timeout threshold described in the present application.
Through the technical scheme of the specification, when no transaction exists in the transaction pool, no block is generated. By counting blank proposals without transaction contents of the nodes and dynamically adjusting the proposal overtime threshold of the first-stage voting, after the application system is idle for a long time and user transactions arrive, consensus can still be rapidly achieved and blocks can be generated. In addition, the negotiation of the block timeout time between the consensus nodes is carried out at a fixed frequency, and the consensus pace is adjusted.
In short, the above description is only a preferred embodiment of the present disclosure, and is not intended to limit the scope of the present disclosure. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present specification shall be included in the protection scope of the present specification.
The system, apparatus, module or unit illustrated in one or more of the above embodiments may be implemented by a computer chip or an entity, or by an article of manufacture with a certain functionality. One typical implementation device is a computer. In particular, the computer may be, for example, a personal computer, a laptop computer, a cellular telephone, a camera phone, a smartphone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement 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 tape magnetic disk storage 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 phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
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 may 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.
Claims (12)
1. A dynamic adjustment method for a proposal timeout threshold is applied to a block chain system, and comprises the following steps:
each node sets and records the number R of the participated consensus rounds and the blank count Nil _ R; wherein the blank count is the number of proposals without transaction content sent or received by the node;
the proposal consensus node acquires the transaction when in transaction, and if the transaction pool is empty, the proposal consensus node sends a blank proposal without transaction content;
the proposal consensus node and other consensus nodes receiving the proposal do not vote for the blank proposal in the first stage and increment the blank count Nil _ R of the proposal node and other consensus nodes receiving the proposal;
and setting the proposal overtime threshold of the first-stage voting to be positively correlated with the consensus round number R and negatively correlated with the blank count Nil _ R.
2. The method of claim 1, further comprising: and when the timeout waiting time of the first-stage voting reaches the proposal timeout threshold, starting the second-stage voting, voting by all nodes after the first-stage voting does not receive the voting with the effective threshold, entering the next round of consensus, and simultaneously increasing the number R of the consensus rounds by all the nodes.
3. The method of claim 2, further comprising: setting a basic time threshold value of the proposal overtime; the proposed timeout threshold for the first stage vote is M times the base time threshold, where M is R-Nil _ R + 1.
4. The method of claim 3, wherein the blockchain system is a blockchain system that employs a semi-synchronous network hypothesis consensus protocol.
5. The method of claims 1-4, further comprising:
setting the number of updating rounds of blank counting;
and with the updating round number as an interval, broadcasting the blank count Nil _ R of the node to other common nodes by all common nodes, and updating the blank count Nil _ R of all the nodes according to the maximum value of all the blank counts Nil _ R.
6. An apparatus for dynamically adjusting a proposed timeout threshold for use in a blockchain system, the apparatus comprising:
setting a module: setting and recording the number R of participating consensus rounds and a blank count Nil _ R for each node; wherein the blank count is the number of proposals without transaction content sent or received by the node;
a proposal acquisition module: the proposal consensus node is used for acquiring the transaction when the proposal consensus node carries out the transaction, and if the transaction pool is empty, the proposal consensus node sends a blank proposal without transaction content;
a first stage voting module: the system comprises a blank proposal receiving node, a proposal consensus node and other consensus nodes, wherein the blank proposal receiving node is used for setting the proposal consensus node and other consensus nodes receiving the proposal not to perform first-stage voting on the blank proposal and increasing the blank count Nil _ R of the blank proposal by self;
a timeout threshold setting module: the proposal timeout threshold for setting the first-stage vote is positively correlated with the consensus round number R and negatively correlated with the blank count Nil _ R.
7. The apparatus of claim 6, further comprising a second voting module for starting a second voting stage when the timeout waiting time of the first voting stage reaches the proposal timeout threshold, wherein all nodes vote for votes that have not received a valid threshold in the first voting stage, and then enter a next consensus round, and each node increments the number of consensus rounds R.
8. The apparatus of claim 7, the timeout threshold setting module further comprising: setting a basic time threshold value of the proposal overtime; the proposed timeout threshold for the first stage vote is M times the base time threshold, where M is R-Nil _ R + 1.
9. The apparatus of claim 8, wherein the blockchain system is a blockchain system that employs a semi-synchronous network hypothesis consensus protocol.
10. The apparatus of claims 6-9, further comprising a white space count synchronization module to:
setting the number of updating rounds of blank counting;
and with the updating round number as an interval, broadcasting the blank count Nil _ R of the node to other common nodes by all common nodes, and updating the blank count Nil _ R of all the nodes according to the maximum value of all the blank counts Nil _ R.
11. An electronic device, comprising:
one or more processors;
a memory for storing one or more computer 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-5.
12. 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-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011100701.4A CN112232954A (en) | 2020-10-15 | 2020-10-15 | Dynamic adjustment method and device for proposal timeout threshold value and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011100701.4A CN112232954A (en) | 2020-10-15 | 2020-10-15 | Dynamic adjustment method and device for proposal timeout threshold value and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112232954A true CN112232954A (en) | 2021-01-15 |
Family
ID=74113022
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011100701.4A Pending CN112232954A (en) | 2020-10-15 | 2020-10-15 | Dynamic adjustment method and device for proposal timeout threshold value and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112232954A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113821569A (en) * | 2021-09-30 | 2021-12-21 | 广州智链未来科技有限公司 | Block chain consensus method and block chain |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107171829A (en) * | 2017-04-24 | 2017-09-15 | 杭州趣链科技有限公司 | A kind of dynamic node management method for algorithm realization of being known together based on BFT |
| CN109150598A (en) * | 2018-08-10 | 2019-01-04 | 上交所技术有限责任公司 | A kind of BFT common recognition algorithm bandwidth utilization rate improved method based on block piece |
| CN109447810A (en) * | 2018-11-29 | 2019-03-08 | 杭州秘猿科技有限公司 | Parallel block chain common recognition method, system, electronic equipment and computer readable storage medium |
| CN109447795A (en) * | 2018-09-11 | 2019-03-08 | 中国人民解放军国防科技大学 | Byzantine consensus method supporting rapid achievement of final confirmation |
| CA3061603A1 (en) * | 2018-11-14 | 2020-05-14 | Royal Bank Of Canada | System and method for storing contract data structures on permissioned distributed ledgers |
| CN111160881A (en) * | 2019-12-11 | 2020-05-15 | 马上游科技股份有限公司 | Method and system for decentralized side-chain issuance of anchored backbone tokens |
| CN111507840A (en) * | 2020-04-15 | 2020-08-07 | 财付通支付科技有限公司 | Block chain consensus method, device, computer and readable storage medium |
-
2020
- 2020-10-15 CN CN202011100701.4A patent/CN112232954A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107171829A (en) * | 2017-04-24 | 2017-09-15 | 杭州趣链科技有限公司 | A kind of dynamic node management method for algorithm realization of being known together based on BFT |
| CN109150598A (en) * | 2018-08-10 | 2019-01-04 | 上交所技术有限责任公司 | A kind of BFT common recognition algorithm bandwidth utilization rate improved method based on block piece |
| CN109447795A (en) * | 2018-09-11 | 2019-03-08 | 中国人民解放军国防科技大学 | Byzantine consensus method supporting rapid achievement of final confirmation |
| CA3061603A1 (en) * | 2018-11-14 | 2020-05-14 | Royal Bank Of Canada | System and method for storing contract data structures on permissioned distributed ledgers |
| CN109447810A (en) * | 2018-11-29 | 2019-03-08 | 杭州秘猿科技有限公司 | Parallel block chain common recognition method, system, electronic equipment and computer readable storage medium |
| CN111160881A (en) * | 2019-12-11 | 2020-05-15 | 马上游科技股份有限公司 | Method and system for decentralized side-chain issuance of anchored backbone tokens |
| CN111507840A (en) * | 2020-04-15 | 2020-08-07 | 财付通支付科技有限公司 | Block chain consensus method, device, computer and readable storage medium |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113821569A (en) * | 2021-09-30 | 2021-12-21 | 广州智链未来科技有限公司 | Block chain consensus method and block chain |
| CN113821569B (en) * | 2021-09-30 | 2024-02-06 | 广州智链未来科技有限公司 | Block chain consensus method and block chain |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109447810B (en) | Parallel block chain consensus method, system, electronic device and computer-readable storage medium | |
| CN110659988B (en) | Parallel processing method and device for block chain consensus and execution and electronic equipment | |
| CN108648078B (en) | Transaction preprocessing method and device and electronic equipment | |
| CN110648136B (en) | Consensus and transaction synchronous parallel processing method and device and electronic equipment | |
| CN108846749B (en) | Partitioned transaction execution system and method based on block chain technology | |
| CN110061930B (en) | Method and device for determining data flow limitation and flow limiting values | |
| CN112506671B (en) | Transaction processing method and device in block chain and electronic equipment | |
| WO2020168933A1 (en) | Network request processing method, device, terminal and storage medium | |
| CN110018884B (en) | Distributed transaction processing method, coordination device, database and electronic equipment | |
| CN109582398B (en) | State processing method and device and electronic equipment | |
| CN111698244B (en) | Method and device for rapidly participating in consensus of newly added nodes and electronic equipment | |
| CN110708163A (en) | Block chain consensus method, device and system and electronic equipment | |
| CN111369358A (en) | Block chain consensus method and device and electronic equipment | |
| CN110648125B (en) | Packaging transaction method and device, electronic equipment and storage medium | |
| CN111882322A (en) | Method and device for packaging transactions in sequence and electronic equipment | |
| CN112232954A (en) | Dynamic adjustment method and device for proposal timeout threshold value and electronic equipment | |
| CN108829498B (en) | Service data access method and device | |
| CN108647102B (en) | Service request processing method and device of heterogeneous system and electronic equipment | |
| CN113486109A (en) | Data synchronization method and device of heterogeneous database and electronic equipment | |
| CN111709748A (en) | Transaction execution method and device with service attribute and electronic equipment | |
| CN110535785B (en) | Control method and device for sending frequency and distributed system | |
| CN115794697A (en) | Memory access method and device | |
| CN110599139B (en) | Block output method and device in block chain consensus algorithm | |
| CN110032564B (en) | Method and device for determining association relation of data table | |
| CN109241050B (en) | Data query method, device and system and electronic equipment |
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 | ||
| CB02 | Change of applicant information |
Address after: Room 2339, 2nd Floor, No. 92, Huancheng North Road, Gongshu District, Hangzhou City, Zhejiang Province 310005 Applicant after: Hangzhou Xita Technology Co.,Ltd. Address before: Room 2001 and 2010, 20 / F, block a, Huaxing Times Square, 478 Wensan Road, Xihu District, Hangzhou, Zhejiang 310000 Applicant before: Hangzhou Xita Technology Co.,Ltd. |
|
| CB02 | Change of applicant information |