Delegated proof-of-stake(DPOS) consensus mechanism is widely adopted in blockchain platforms, but problems exist in its current applications. In order to explore the security risks in the voting attack of the DPOS con...Delegated proof-of-stake(DPOS) consensus mechanism is widely adopted in blockchain platforms, but problems exist in its current applications. In order to explore the security risks in the voting attack of the DPOS consensus mechanism, an extensive game model between nodes was constructed, and it was concluded that the DPOS consensus mechanism relies too much on tokens, and the possibility of node attacks is very high. In order to solve the problems of frequent changes of DPOS consensus mechanism nodes, inactive node voting, excessive reliance on tokens, and malicious nodes, a dynamic, credible, and attack-evading DPOS consensus mechanism was proposed. In addition, the Python simulation results show that the improved Bayesian voting algorithm is effective in calculating node scores.展开更多
In this paper, we find particular use for a maximally entangled initial state that produces a quantized version of two player two strategy games. When applied to a variant of the well-known game of Chicken, our constr...In this paper, we find particular use for a maximally entangled initial state that produces a quantized version of two player two strategy games. When applied to a variant of the well-known game of Chicken, our construction shows the existence of new Nash equilibria with the players receiving better payoffs than those found in literature.展开更多
基金supported by the National Natural Science Foundation of China(71673122,72074117)the Fund of Social Sciences in Jiangsu Province(20WTB007)the Scientific Research Fund of Education Ministry-China Mobile(D203209000115)。
文摘Delegated proof-of-stake(DPOS) consensus mechanism is widely adopted in blockchain platforms, but problems exist in its current applications. In order to explore the security risks in the voting attack of the DPOS consensus mechanism, an extensive game model between nodes was constructed, and it was concluded that the DPOS consensus mechanism relies too much on tokens, and the possibility of node attacks is very high. In order to solve the problems of frequent changes of DPOS consensus mechanism nodes, inactive node voting, excessive reliance on tokens, and malicious nodes, a dynamic, credible, and attack-evading DPOS consensus mechanism was proposed. In addition, the Python simulation results show that the improved Bayesian voting algorithm is effective in calculating node scores.
文摘In this paper, we find particular use for a maximally entangled initial state that produces a quantized version of two player two strategy games. When applied to a variant of the well-known game of Chicken, our construction shows the existence of new Nash equilibria with the players receiving better payoffs than those found in literature.
