Crates.io | dao-proposal-condorcet |
lib.rs | dao-proposal-condorcet |
version | 2.6.0 |
source | src |
created_at | 2023-07-03 18:20:25.8595 |
updated_at | 2024-11-08 00:07:11.05335 |
description | A DAO DAO proposal module with ranked-choice, Condorcet voting. |
homepage | |
repository | https://github.com/DA0-DA0/dao-contracts |
max_upload_size | |
id | 907255 |
size | 660,222 |
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:
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.