System and methods of Efficient Consensus Mechanism Utilizing Competitive Computational Races for Enhanced Network Security and Resource Optimization
AssigneeLibermans Co.
InventorsANNA LIBERMAN WOODFORD, DAVID LIBERMAN, DANIIL LIBERMAN, MARIA LIBERMAN
Life of this patent
Estimating the term…
Abstract
This invention presents a consensus mechanism that enhances network efficiency and security by optimizing resource utilization. By integrating a competitive Race that aligns voting power with computational contributions made during a confined timeframe, the mechanism addresses the inefficiencies of traditional PoW without relying on capital staking as in PoS. The mechanism ensures fairness, incentivizes meaningful computational work during specific periods, and maintains the integrity of the network through an honest majority.
Claims13
A consensus mechanism for use with a Blockchain or similar network comprising multiple network participants, wherein each network participant's voting weight is based on the computational work performed during a defined short time period (“Race”), confining intensive computation to short simultaneous periodic or conditionally-initiated windows, without computation between the windows, to achieve consensus, comprising the steps of:
- (a) simultaneously starting the Race for all network participants by generating a random number collaboratively by all network participants with voting power;
- (b) participants engage in computationally demanding tasks, supporting Byzantine fault-tolerant consensus, only during Races, serving as evidence of computational contribution without requiring continuous resource expenditure;
- prohibiting any computational activity from influencing consensus outside the Race window;
- (c) compiling the outcomes of the tasks into computational evidence, which determines the voting weight each participant holds in the network;
- (d) participants submit their computational evidence within the Race, and
- (e) voting weights are assigned proportionally to the participants based on the verified computational evidence upon Race completion and are reused to achieve consensus during a non-computational period following the Race.
Dependencies are inferred from the claim text.