jeffemmett
/
Aragon_Conviction_Voting
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Merge pull request #2 from Jeff-Emmett/patch-2 

Update README.md
This commit is contained in:
Andrew Clark 2020-07-14 12:37:40 -04:00 committed by GitHub
parent 99123162e7 08cd4f3296
commit f394c0be62
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
README.md
View File

@ -1,8 +1,6 @@
# Aragon_Conviction_Voting
[Conviction Voting](https://medium.com/commonsstack/conviction-voting-a-novel-continuous-decision-making-alternative-to-governance-62e215ad2b3d) is a novel decision making process used to estimate real-time collective preference in distributed work proposal systems. Voters continuously express their preference by staking tokens in favor of proposals they would like to see approved, with the conviction (i.e. weight) of their vote growing over time. Collective conviction accumulates until it reaches a set threshold specified by a proposal according to how much funding it is requesting, at which point it passes and funds are released from the funding pool so work may begin. Conviction voting improves on discrete voting processes by allowing participants to vote at any time, and moves from consensus to consent based decision making. This eliminates the governance bottleneck of large distributed communities, where a quorum of participants may be required to vote on every proposal.
In the conviction voting model, a graph structure is used to record the interaction of participants, candidates, proposals, and their outcomes.
[Conviction Voting](https://medium.com/commonsstack/conviction-voting-a-novel-continuous-decision-making-alternative-to-governance-62e215ad2b3d) is a novel decision making process used to estimate real-time collective preference in a distributed work proposal system. Voters continuously express their preference by staking tokens in favor of proposals they would like to see approved, with the conviction (i.e. weight) of their vote growing over time. Collective conviction accumulates until it reaches a set threshold specified by a proposal according to the amount of funds requested, at which point it passes and funds are released so work may begin. Conviction voting improves on discrete voting processes by allowing participants to vote at any time, and moves from consensus to consent based decision making. This eliminates the governance bottleneck of large distributed communities, where a quorum of participants is required to vote on every proposal. In the conviction voting model, graph structures are used to represent participants and proposals, as well as participants private affinity and public conviction towards proposals.
## Simulations