https://github.com/potlock/grantpicks
Pairwise voting mechanism for Stellar built on Soroban and NEAR Protocol.
https://github.com/potlock/grantpicks
budget-boxing budgetboxing grantpicks grants pairwise pairwise-voting soroban stellar xlm
Last synced: about 1 month ago
JSON representation
Pairwise voting mechanism for Stellar built on Soroban and NEAR Protocol.
- Host: GitHub
- URL: https://github.com/potlock/grantpicks
- Owner: PotLock
- License: mit
- Created: 2024-05-12T19:21:14.000Z (about 1 year ago)
- Default Branch: main
- Last Pushed: 2025-04-03T10:11:12.000Z (about 2 months ago)
- Last Synced: 2025-04-03T10:34:46.638Z (about 2 months ago)
- Topics: budget-boxing, budgetboxing, grantpicks, grants, pairwise, pairwise-voting, soroban, stellar, xlm
- Language: TypeScript
- Homepage: https://grantpicks.com
- Size: 8.72 MB
- Stars: 4
- Watchers: 1
- Forks: 1
- Open Issues: 76
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# GrantPicks Monorepo
Pairwise voting mechanism for Stellar built on Soroban (Stellar & NEAR). Mono repo for front end and smart contracts.
# Resources
- Technical Architecture https://potlock.org/grantpicks-stellar-architecture
- Repo https://github.com/PotLock/grantpicks <- where all the code will be pushed
- Backlog https://potlock.org/grantpicks-stellar-backlog <- task by task break down
- Figma https://potlock.org/grantpicks-figma <- where wireframes and prototypes will be developed
# About Pairwise
The "budget boxing" algorithm, utilizes pairwise preferences to allocate budget percentages among various items or projects. This method starts by collecting votes through pairwise preferences, where voters choose between two options at a time (e.g., "A vs B"). This approach simplifies the voting process, making it more engaging and manageable for voters, as they only need to consider two options at a time. The simplicity of this method also ensures that a large amount of preference data can be efficiently gathered with minimal cognitive load on the voters.
Once the pairwise preferences are collected, they are used to construct a preference graph, essentially a matrix of votes. This matrix is then processed to derive a probability distribution over the items. However, instead of interpreting these probabilities in a conventional sense, they are treated as percentages of the total budget. This means that the algorithm's output directly informs how the budget should be distributed among the items based on the collective preferences of the voters. This method makes the decision-making process transparent and scalable, as it can handle many voters and items efficiently by leveraging mathematical and computational tools.
- App https://pairdrop.daodrops.io/
- Github Repo https://github.com/dOrgTech/PairDrop
- Original Idea https://news.colony.io/ideas/en/budget-box
- https://github.com/JoinColony/budgetBox
- https://uploads-ssl.webflow.com/61840fafb9a4c433c1470856/639b50ee30b729cb016806c1_BudgetingBoxes.pdf
- Mechanism Institute: https://www.mechanism.institute/library/pairwise
Staging https://staging.grantpicks.com
Testnet https://testnet.grantpicks.com
## Contracts
Stellar ContractIds Staging
round contract: CCN5CHAAMS4UNRA7EJ4E6DV6GELVOXX6OC2IHY3MPVEDMTKI3E4ITMLJ
project registry: CBQWQLBRCIXY5OIV63MOB3IAXIT5X5JTXOXFFFJ2TOBYLBO6I5LPWA7J
Testnet
round contract : CCIBKU2IGSZ67WY3MWMXLY42FJ4BZ6AFLJAIPHEAS4HRS3SD255HWH2C
project registry: CCWDFOWHCOQNU4I76IPA4ORAKLGRBT6HLXTEUFMZJEBGPBSLPUMB2ZUC