Quadratic Funding
How quadratic funding uses a matching pool and a square-root formula to fund public goods by breadth of support rather than size of wallet — the math, why it fights plutocracy, and how sybils break it.
The basics
Funding by Number of Supporters, Not Size of Wallet
Quadratic funding (QF) is a mechanism for allocating a shared matching pool to public goods — open-source software, community projects, research — in a way that reflects how many people support something, not just how much money a few big donors give. Contributors make small donations to projects they value, and a matching pool tops those up using a formula that gives far more weight to the number of contributors than to the size of contributions. A project that many people each give a little to can receive more matching than one a single whale funds heavily. Gitcoin popularised QF for funding Ethereum public goods.
Why This Is Clever
Ordinary funding is plutocratic: whoever has the most money decides what gets funded. QF is designed to be more democratic — it optimises for broad community support, so a project loved by a thousand ordinary people beats one bankrolled by a single rich backer. It tries to fund what a community actually collectively wants, using the matching pool to amplify grassroots preferences. This makes it a promising tool for funding public goods, which markets chronically underfund because their benefits are shared and hard to monetise.
- QF allocates a matching pool to public goods by breadth of support
- The formula weights the number of contributors far above the size of contributions
- Many small donors can out-match a single large one
- Gitcoin popularised it for funding Ethereum/open-source public goods
Key Takeaways
- QF funds what a community broadly supports, not what whales prefer
- A matching pool amplifies grassroots donations via a square-root-based formula
- It targets the chronic underfunding of shared public goods
Going deeper
The Math, Intuitively
The core of QF is that a project's matched amount is based on the square of the sum of the square roots of individual contributions. The practical effect: take each contribution, square-root it, add those up, then square the total. Because square roots dampen large amounts and reward many separate contributions, the formula strongly favours breadth. Ten people giving one dollar each produce a much larger matched amount than one person giving ten dollars, even though the raw total is the same. Under idealised assumptions, QF is proven to allocate the matching pool in proportion to the true collective value the community places on each public good — a genuinely elegant result.
The Sybil Problem
QF's strength — rewarding many distinct contributors — is also its fatal weakness if identities are not real. Because more unique contributors means dramatically more matching, an attacker who creates many fake identities (a sybil attack) and has each 'person' donate a small amount can capture a large share of the matching pool illegitimately. This is not a corner case; it is the central practical threat to QF, and every real deployment lives or dies by its sybil resistance. Without robust proof that contributors are distinct humans, QF degrades into a mechanism for whoever can fake the most identities — the opposite of its democratic intent.
Defending With Identity and Collusion Resistance
Real QF systems bolt on defences. Proof-of-personhood and identity-scoring systems (Gitcoin Passport, for instance) try to weight or filter contributions by how likely each account is a unique human, reducing the payoff of sybils. Collusion resistance is a related concern: groups coordinating to game the pool (or bribing others to donate to their project) undermine the mechanism, motivating research into cryptographic approaches (like MACI — Minimal Anti-Collusion Infrastructure) that hide individual votes to make bribery unenforceable. The honest picture is that QF is powerful in theory but only as good as its identity and anti-collusion layer in practice; the mechanism and its sybil defences are inseparable.
QF Is Only as Good as Its Sybil Resistance
The elegant math of quadratic funding assumes contributors are distinct real people. The moment fake identities can each make small donations, an attacker can siphon a large share of the matching pool — because QF deliberately rewards many contributors. So any QF round is only as legitimate as its proof-of-personhood and anti-collusion machinery. When evaluating a QF system (as a donor, a project, or a designer), the sybil-resistance layer is not a footnote — it is the thing that determines whether the round funds genuine community favourites or whoever gamed the identities best.
- Matched amount ≈ (sum of square roots of contributions), squared — breadth dominates size
- Under ideal assumptions QF allocates matching in proportion to true collective value
- Sybil attacks (many fake identities giving small amounts) are the central threat
- Proof-of-personhood and anti-collusion (e.g. MACI) are essential, not optional
Key Takeaways
- The square-root formula makes many small donors outweigh a few large ones
- Sybil attacks directly exploit QF's breadth-rewarding design
- QF in practice is inseparable from its identity and collusion-resistance layer
Under the hood
Constrained QF and Real-World Adjustments
Pure QF assumes unlimited matching and perfect identities; real deployments adjust heavily. Matching pools are finite, so budgets are normalised and capped, which distorts the ideal proportions. Contribution caps, minimum thresholds, per-project matching limits, and pairwise-bounded QF (which limits how much any pair of contributors can jointly influence, blunting collusion) are all used to make QF robust in messy reality. Each adjustment trades some theoretical optimality for practical resistance to gaming. Understanding a specific QF round means reading its rules — the matching cap, the identity requirements, the collusion mitigations — because these determine the actual incentives far more than the textbook formula does.
QF in the Broader Public-Goods Toolkit
Quadratic funding is one instrument in a growing kit of crypto mechanisms for funding shared goods, alongside retroactive public-goods funding (reward proven impact after the fact), conviction voting (continuous preference-weighted allocation), and direct grants. Each suits different situations: QF is good for surfacing broad community preferences among many candidate projects; retroactive funding is better when impact is easier to judge in hindsight than to predict; conviction voting suits ongoing, evolving allocation. Sophisticated ecosystems combine them — for example, QF rounds to fund promising work and retroactive rounds to reward what actually delivered. Seeing QF as one tool with specific strengths and failure modes, rather than a universal solution, is the mature framing.
What Determines Whether QF Works
For a serious observer, a QF program's credibility rests on a few concrete factors: the robustness of its proof-of-personhood (weak identity = sybil capture), the collusion mitigations in place, the size and rules of the matching pool, and the transparency of how contributions and matching are computed and audited. A well-run QF round with strong identity and clear rules can genuinely direct funding toward community-valued public goods that markets would ignore — a real contribution. A poorly-defended round becomes a game of manufactured identities and coordinated donations that funds the best gamers. QF is neither a magic democratiser nor a broken toy; it is a powerful mechanism whose real-world legitimacy is decided by the unglamorous identity-and-rules layer wrapped around the elegant math.
Key Takeaways
- Finite pools + caps + pairwise bounding make real QF a constrained approximation of the ideal
- QF complements retroactive funding and conviction voting — different tools for different cases
- Legitimacy hinges on identity robustness, collusion mitigations, pool rules, and auditability
Related Content
Related Coins
Related Scams
Key Terms
More Topics
Browse all 179 topicsUniswap v4 Hooks
How v4's hooks turn an AMM pool into programmable infrastructure — custom logic at every stage of a swap — plus the singleton architecture and the new risks that programmability introduces.
Permit2 & Signature Approvals
How Permit2 and EIP-2612 replace clunky, dangerous unlimited token approvals with signed, time-boxed permissions — improving UX and safety, and where the new signature surface can still be abused.
Account Abstraction: Paymasters & Bundlers
A deep dive into the ERC-4337 machinery beyond the wallet: how bundlers relay user operations, how paymasters sponsor or tokenise gas, and the economics and trust of gasless transactions.
Decentralized AI Training & Inference
How crypto networks try to coordinate distributed AI compute, training, and inference — Bittensor, Akash, Ritual and others — the token incentives involved, and the hard technical limits.
Conviction Voting
A governance method where support accumulates the longer you hold a position, funding proposals continuously as conviction builds — designed for ongoing treasury allocation without snapshot-vote gaming.
Futarchy: Governance by Prediction Markets
A governance model that decides policy using prediction markets — 'vote on values, bet on beliefs' — its elegant logic, the real experiments running it, and why it is powerful but perilous.
Retroactive Public Goods Funding
The 'reward impact after it happens' model — RetroPGF — that funds public goods based on proven results rather than promised plans, why it fixes prediction risk, and the hard problem of judging impact.
Shared Sequencing & Based Rollups
Who decides the order of transactions on a rollup — and why decentralising that role matters. Shared sequencers, based rollups, and preconfirmations, explained without hype.
References & further reading
- secondaryButerin, Hitzig & Weyl — A Flexible Design for Funding Public Goods
The foundational paper formalising quadratic funding.
archived copy ↗