PQV
  • ๐Ÿ–๏ธIntroduction
    • Problem and Solution
  • Problem: Background
    • โ˜‘๏ธEvolution of Voting System
    • ๐ŸงจSybil Attack
  • Solution: PQV
    • ๐Ÿ’กProbabilistic QV
    • ๐ŸšงMathematical Proof
    • ๐Ÿค–Simulation
      • Environment
      • Results
    • ๐Ÿ”ขPQV Calculator
  • Use Cases
    • ๐Ÿ’ตQuadratic Funding
    • ๐Ÿ”‘PoS/DPoS
    • ๐ŸงฑApplications
      • LeGovernor
  • Governor C
    • ๐Ÿ›๏ธGovernor C
    • ๐Ÿ‘ฉโ€๐Ÿ’ปDeveloper Guides
  • Discussions
    • โ›“๏ธMulti-Chain PQV
  • References
    • Papers
  • D3LAB Media
    • Website
    • Twitter
    • Github
    • Medium
    • LinkedIn
Powered by GitBook
On this page
  1. Solution: PQV

Probabilistic QV

PreviousSybil AttackNextMathematical Proof

Last updated 3 years ago

PQV Basic

Sybil attack is advantageous in QV because the more votes are divided, the more profitable it is. D3LAB suggests PQV which applies a probabilistic model so dividing votes always results in a loss.

Assume that the total number of votes is 100, and a user submitted 10 votes. There is a 10% (10100\frac{10}{100}10010โ€‹) of chance that his opinion will be reflected, or a 90% (1โˆ’101001-\frac{10}{100}1โˆ’10010โ€‹)chance that it will not.

The expected value of voting in this condition is 10ร—0.1โ‰ˆ0.3162\sqrt{10}\times0.1\approx0.316210โ€‹ร—0.1โ‰ˆ0.3162. However if the user split the 10 votes in two, the expected value lowered to 5ร—2ร—0.05โ‰ˆ0.2246\sqrt{5}\times2\times0.05\approx0.22465โ€‹ร—2ร—0.05โ‰ˆ0.2246. This means doing Sybil attack is less beneficial.

๐Ÿ’ก