--- title: Connection-Oriented Quadratic Funding (CO-QF) url: https://www.emergentmind.com/topics/connection-oriented-quadratic-funding-co-qf type: topic --- # Connection-Oriented Quadratic Funding (CO-QF) Connection-Oriented Quadratic Funding (CO-QF) is a modification of standard Quadratic Funding (QF) that reallocates matching funds using information about connections, groups, or communities rather than treating contributors as isolated agents. In the Gitcoin deployment studied in 2025, CO-QF was designed to favor projects that are jointly supported by different groups of contributors—described as “cooperation across difference”—instead of simply rewarding projects that mobilize large, tightly knit, or heavily coordinated crowds [2509.18343]. It emerged against the background of the canonical QF rule \(F^p = \left(\sum_i \sqrt{c_i^p}\right)^2\), which in the standard quasi-linear public-goods model attains the Samuelson condition \(V^{p\prime}(F^p)=1\) and, within a symmetric analytic class \(F(\vec c)=g\!\left(\sum_i h(c_i)\right)\), is uniquely selected by the welfare-maximizing and boundary conditions \(h(c)=\sqrt c\), \(g(x)=x^2\) [1809.06421] [2206.14711]. ## 1. Standard Quadratic Funding as the baseline Quadratic Funding was introduced for decentralized funding of public goods in environments with quasi-linear utility, independent values across goods, smooth increasing concave valuations, and a subsidy pool or tax system that covers the deficit [1809.06421]. For a project \(p\), contributors choose \(c_i^p \ge 0\), and the mechanism assigns \[ F^p=\left(\sum_i \sqrt{c_i^p}\right)^2. \] The resulting deficit is \[ F^p-\sum_i c_i^p = \left(\sum_i \sqrt{c_i^p}\right)^2-\sum_i c_i^p = 2\sum_{i0\), defining agent \(i\)’s prosocial utility as \[ \hat u_i(F)=\sum_{j\in N}\alpha_{ij}u_j(F). \] Agents choose contributions based on \(\hat u_i\), but welfare is evaluated using the personal utilities \(u_i\) to avoid double counting [2509.18343]. Under QF, the equilibrium condition becomes \[ \hat u_i'(F^{\textsf{QF}})=\frac{\sqrt{c_i}}{\sum_j \sqrt{c_j}}, \] so that \(\sum_i \hat u_i'(F^{\textsf{QF}})=1\). If \(\alpha_{ij}>0\) for at least one off-diagonal pair, then the aggregate marginal benefit from personal utilities is strictly less than \(1\), which implies that \(F^{\textsf{QF}}\) does not maximize social welfare [2509.18343]. In the paper’s interpretation, QF becomes over-generous once dense prosocial concern is present. The same paper presents a stylized fairness failure under a bounded subsidy pool: large, coordinated groups can drag a disproportionately large share of the matching pool toward their favorite projects, even when doing so is inefficient relative to broader welfare. This is the setting in which Gitcoin participants described QF as a “popularity contest” [2509.18343]. Independent evidence from Gitcoin’s capital-constrained implementation identified a complementary resource-allocation problem. Under unconstrained QF, per-project matching is \[ M^{p,\text{QF}} = \left(\sum_i \sqrt{c_i^p}\right)^2-\sum_i c_i^p = 2\sum_{i\neq j}\sqrt{c_i^p c_j^p}, \] so matching requirements scale with contributor pairs, approximately \(O(n^2)\) in the number of contributors \(n\) [2010.01193]. The paper explicitly states that “while total individual contributions scale linearly, target matching amounts scale quadratically following the number of pairs of contributors” [2010.01193]. It also documents small, scattered contributions across many projects, rapid growth of the capital-constraint factor \(k\), and reciprocal backing consistent with strategic behavior [2010.01193]. These observations do not by themselves define CO-QF, but they explain why a mechanism that is blind to connection structure can perform poorly in practice. ## 3. Formal definition of CO-QF CO-QF introduces an explicit group structure. Let \(N\) be the set of agents and \(G\subseteq 2^N\) a set of groups. If agent \(i\) belongs to group \(g\), the membership weight \(w_{i,g}>0\) measures how strongly \(i\) belongs to that group, with normalization \[ \sum_{g\in G} w_{i,g}=1. \] For a given project with contributions \(c_i\), the unnormalized CO-QF subsidy is defined by iterating over ordered pairs of groups and aggregating contributions from the symmetric difference [2509.18343]. In compact notation, \[ \text{subsidy}^{\textsf{CO-QF}} = \sum_{g,h\in G}\sqrt{G_{g,h}\cdot H_{g,h}}, \] where \[ G_{g,h}=\sum_{i\in g\setminus h} c_i w_{i,g}, \qquad H_{g,h}=\sum_{j\in h\setminus g} c_j w_{j,h}. \] Total funding is then \[ F^{\textsf{CO-QF}}=\sum_i c_i+\text{subsidy}^{\textsf{CO-QF}}. \] The mechanism changes the combinatorics of the subsidy term. Standard QF rewards pairwise agreement between individuals through \(\sum_{i\neq j}\sqrt{c_i c_j}\). CO-QF rewards pairwise agreement between groups, and only contributions from the symmetric difference \(g\triangle h=(g\setminus h)\cup(h\setminus g)\) contribute to each group-pair term [2509.18343]. Support from donors who are already shared across groups is discounted in that term. In the Gitcoin deployment, the group construction was deliberately simple. The set \(G\) was taken to be the set of projects in the round. A donor who contributed to project \(q\) was placed into group \(q\), and the membership weight was defined by donation share: \[ w_{i,g_q} = \frac{c_{i,q}}{\sum_r c_{i,r}}, \] so that a donor’s total influence is distributed across the projects to which they gave [2509.18343]. The paper notes that if one instead sets \(G=\{\{i\}\mid i\in N\}\), so that each agent is its own group and \(w_{i,\{i\}}=1\), one can recover standard QF behavior [2509.18343]. ## 4. Analytical rationale: plurality, prosociality, and group proxies The conceptual basis of CO-QF is plurality in Weyl’s sense: a project is especially valuable when it is supported by diverse groups that do not share the same social or interest cluster [2509.18343]. On this view, the defect in standard QF is not only that it assumes selfish agents, but that it rewards dense within-cluster mobilization even when such mobilization partly reflects prosocial concern internal to a group rather than independent evidence of broad value. CO-QF therefore uses group memberships as a proxy for the latent structure encoded by \(\alpha_{ij}\). The paper is explicit that it does not directly use \(\alpha_{ij}\) in the mechanism. It also states that designs based on explicitly eliciting social preferences or estimating them from richer social-network data were considered and rejected because \(\alpha_{ij}\) are not directly observable, and because collecting such data would harm usability and raise privacy and complexity issues [2509.18343]. The operative choice was to use lightweight group data that were already available or easy to gather. This perspective clarifies the mechanism’s comparative logic. QF amplifies many small donors because each new donor adds interactions with all others. CO-QF dampens the effect of many donors within the same cluster and amplifies cross-group agreement instead [2509.18343]. A plausible implication is that CO-QF does not reject the square-root/quadratic insight of QF so much as relocate it: the key interaction is moved from individual pairs to group pairs. The paper also records a discarded first design for CO-QF. Its desideratum was that both individuals and groups should experience only sub-linear matching returns: if one person or all members of a group increase their contribution by \(x\), the subsidy should scale as \(O(\sqrt{x})\), not \(O(x)\) [2509.18343]. That earlier rule had stronger theoretical guarantees, but in Gitcoin-like small-world networks with overlapping memberships it attenuated contributions too heavily and produced very flat funding, which stakeholders found uninformative. The final deployed design therefore relaxes the strong group-sublinearity requirement in favor of a simpler and more interpretable group-pair formula [2509.18343]. ## 5. Simulation evidence and Gitcoin deployment The principal quantitative evaluation in the CO-QF paper is simulation-based rather than a closed-form welfare theorem. The simulated environment has \(n=25\) agents, partitioned into \(5\) groups of \(5\) agents each, with utility \[ u_i(F)=\beta_i\ln(F+1),\qquad \beta_i\ge 0. \] Prosociality is parameterized by \(\alpha_{ii}=1\) and total prosocial budget \(B\) per agent satisfying \(\sum_{j\neq i}\alpha_{ij}=B\), with \(B\in\{0.1,0.5,1,1.5,2\}\) [2509.18343]. A parameter \(z\in[0,1]\) controls the fraction of prosocial concern directed toward in-group members, and a variance parameter \(\sigma^2\) controls how predictive group membership is of valuations. For each \((B,z,\sigma^2)\), the authors perform \(50\) trials, solve the Nash equilibrium contribution game under direct donations, QF, and CO-QF, compute the induced funding level, and compare utilitarian welfare to the welfare-optimal benchmark through the approximation ratio \[ \frac{USW(F^{\textsf{mechanism}})}{USW(F^*)}. \] The reported qualitative pattern is consistent across experiments. CO-QF provides higher welfare ratios than QF and direct donations when \(B>0\); as \(B\to 0\), both QF and CO-QF converge to nearly optimal behavior; and CO-QF’s advantage persists across variations in \(z\) and \(\sigma^2\) [2509.18343]. The paper interprets this as evidence that CO-QF remains performant even when group definitions are noisy proxies for the underlying prosocial structure. Gitcoin provides the real-world case study. The paper reports that CO-QF was introduced in late 2023 as an optional mechanism alongside QF and hybrid variants. From its introduction until the time of the paper, there were \(38\) total rounds, \(32\) of which used CO-QF or a CO-QF/QF hybrid, amounting to approximately \(84\%\); the abstract separately reports an \(89\%\) adoption rate for “grant-awarding ventures” [2509.18343]. The paper also states that approximately \(\$4.5\) million were distributed across all rounds and approximately \(\$4\) million via CO-QF or hybrid rounds [2509.18343]. The qualitative component uses semi-structured interviews with \(8\) non-employee round managers. On the distributive dimension, all interviewees considered CO-QF an improvement over QF. In the interview material, CO-QF is described as more “fair” and “equitable,” more reflective of “true sentiment of the broader group,” and better at reducing fake support, exploitation, and mechanism farming [2509.18343]. These claims are not a formal theorem, but they are central to the paper’s empirical interpretation of deployment success. ## 6. Trade-offs, controversies, and broader significance CO-QF is presented neither as a universal replacement for QF nor as a pure anti-fraud mechanism. The paper states that Gitcoin still uses separate anti-Sybil and anti-fraud tools, and that CO-QF is not primarily an anti-fraud mechanism [2509.18343]. Its main purpose is to reorient subsidy allocation toward plural support across groups. The principal controversy is the trade-off between fairness and engagement. Standard QF generated strong excitement because a small donation could have a very large apparent matching effect, and it strongly incentivized outreach and marketing. CO-QF reduces the payoff from pure marketing and cluster mobilization, which several interviewees worried could lower donor excitement, reduce grantee incentives to advertise, and slow ecosystem growth [2509.18343]. Gitcoin’s operational response was to preserve pure QF, pure CO-QF, and hybrid options, with round managers able to choose a weighted average of QF and CO-QF subsidies according to local priorities [2509.18343]. A second controversy is mis-penalization of genuine consensus. One interviewee argued that if many donors independently converge on the same projects round after round, the project-as-group construction can treat them as overly coordinated and effectively penalize them [2509.18343]. This is not a peripheral objection; it identifies a structural risk in any mechanism that discounts correlated behavior. The broader significance of CO-QF lies in its generalization of quadratic mechanism design from isolated individuals to grouped or relational agents. The paper explicitly proposes extensions beyond Gitcoin: in firms, groups could be departments or geographic units; in cities, neighborhoods, income brackets, or demographic clusters; in national or civic settings, political parties, regions, or stakeholder groups [2509.18343]. It also outlines an analogous “Connection-Oriented QV” by reinterpreting Quadratic Voting through the square root of a QF-like funding formula [2509.18343]. This suggests a larger mechanism-design program in which the central design variable is not merely the curvature of the funding rule, but the social unit whose agreement is amplified. In that sense, CO-QF marks a substantive shift in the interpretation of quadratic mechanisms. Standard QF assumes isolated and selfish agents and, in its classical theory, is uniquely optimal within a narrow functional class [2206.14711]. CO-QF begins from the claim that real contributors are social and often prosocial, and that the relevant unit of agreement may be a structured group rather than an atomized individual [2509.18343]. The resulting mechanism is therefore best understood as a connection-oriented reformulation of quadratic matching for settings where plurality, prosociality, and bounded matching pools are empirically central. Source: https://www.emergentmind.com/topics/connection-oriented-quadratic-funding-co-qf