#proposal #dao #module #voting #choice #vote #contract

dao-proposal-condorcet

A DAO DAO proposal module with ranked-choice, Condorcet voting

7 stable releases

new 2.6.0 Nov 8, 2024
2.5.0 Oct 31, 2024
2.4.2 Jul 22, 2024
2.3.0 Oct 18, 2023
0.1.0 Jul 3, 2023

#833 in Magic Beans

Download history 72/week @ 2024-07-15 380/week @ 2024-07-22 14/week @ 2024-07-29 11/week @ 2024-09-23 147/week @ 2024-10-28

147 downloads per month
Used in 2 crates (via dao-testing)

BSD-3-Clause

375KB
3.5K SLoC

dao-proposal-condorcet

dao-proposal-condorcet on crates.io docs.rs

This is a DAO DAO proposal module which implements The Condorcet Method.

https://www.princeton.edu/~cuff/voting/theory.html

This module lacks many basic features. For example, proposals and choices do not have human readable names and descriptions. For this first version, the goal is to build a correct, secure, and gas efficent voting system that may be audited, not to build a proposal module that is ready for use with humans and a frontend.

To this end, this module differs from dao-proposal-single and dao-proposal-multiple in that it does not:

  1. support revoting,
  2. integrate with pre-propose modules, nor
  3. support proposal and vote hooks

The ranked choice voting system used is described in detail here. This contract will make no sense unless you read that PDF first as there is a fair bit of math.

what works reliably
is to know the raw silk,
hold the uncut wood.
Need little,
want less.
Forget the rules.
Be untroubled.

Dependencies

~10MB
~210K SLoC