pith. sign in

arxiv: 2505.02208 · v6 · pith:B564JGB5new · submitted 2025-05-04 · 💻 cs.DC · cs.CY· cs.SI

Grassroots Federation: Fair Democratic Governance at Scale

Ehud Shapiro , Nimrod Talmon This is my paper

Pith reviewed 2026-05-22 17:07 UTC · model grok-4.3

classification 💻 cs.DC cs.CYcs.SI
keywords dynamic federationsfair representationsortitiongrassroots governanceproportional fairnessdecentralized democracystructural changepersistent floors
0
0 comments X

The pith

A protocol maintains fair seat allocations in federated digital communities that form, join, and split over time, delivering both persistent minimums at every step and eventual proportionality after stabilization.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper addresses the challenge of extending static fairness in democratic governance to a dynamic environment where small self-governing groups and larger sortition-based assemblies evolve through structural changes in all directions. It formalizes federations that overlap and change bottom-up, top-down, and middle-out, then introduces a protocol to handle the resulting integral seat allocations. The protocol ensures child communities always receive their required floor of seats at all times while long-run averages converge to shares proportional to community size. This builds on prior work about grassroots federations, constitutional consensus, and metric-space governance to support an egalitarian decentralized platform.

Core claim

The authors present a protocol that reconciles integral seat allocations with dynamic, overlapping federations so that child communities meet their persistent floors at every moment while long-run averages converge to proportional fairness, thereby extending static fairness properties to handle communities forming, joining, and splitting in any direction.

What carries the argument

The dynamic seat-allocation protocol that maintains persistent floors for child communities while driving long-run averages to proportionality across evolving, overlapping federations.

If this is right

  • Federations can grow or shrink through any combination of bottom-up, top-down, and middle-out changes without breaking fairness rules.
  • Small communities retain self-governance while larger ones continue to select assemblies by sortition under the same fairness guarantees.
  • The protocol integrates with existing mechanisms for atomic transactions, constitutional consensus, and self-amending constitutions in a single decentralized platform.
  • Persistent floors protect minority groups during transitions while eventual proportionality restores overall fairness once the structure stabilizes.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The approach could be tested in agent-based models of community formation to measure how quickly averages converge after repeated splits.
  • Similar reconciliation of fixed allocations with dynamic membership might apply to other resource-distribution problems such as bandwidth sharing in peer networks.
  • If the floors are set too high relative to total seats, the system might force temporary over-representation that could be measured in real deployments.

Load-bearing premise

Integral seat numbers can be adjusted on the fly in overlapping federations so child groups always keep their minimum seats while averages still settle on proportional shares after changes stop.

What would settle it

Run a sequence of federation splits and merges in simulation and check whether any child community ever drops below its assigned persistent seat floor or whether the time-averaged representation after stabilization deviates from the size-based proportion.

Figures

Figures reproduced from arXiv: 2505.02208 by Ehud Shapiro, Nimrod Talmon.

Figure 1
Figure 1. Figure 1: The rest of this section builds the formal model needed to capture such structures, [PITH_FULL_IMAGE:figures/full_fig_p006_1.png] view at source ↗
read the original abstract

We propose a framework for the fair democratic governance of federated digital communities that form and evolve dynamically, where small groups self-govern and larger groups are represented by assemblies selected via sortition. Prior work addressed static fairness conditions; here, we formalize a dynamic setting where federations evolve over time through communities forming, joining, and splitting, in all directions -- bottom-up, top-down, and middle-out -- and adapt the fairness guarantees. The main technical challenge is reconciling integral seat allocations with dynamic, overlapping federations, so that child communities always meet their persistent floors while long-run averages converge to proportional fairness. Overcoming these challenges, we introduce a protocol that ensures fair participation and representation both persistently (at all times) and eventually (in the limit after stabilization), extending the static fairness properties to handle structural changes. Prior work shows how grassroots federations can be specified via atomic transactions among assembly members, Constitutional Consensus can realize these transactions and the democratic processes leading to them, and Constitutional Governance in Metric Spaces lets a community govern itself and amend its own constitution. Together, these works form a comprehensive design for an egalitarian, fairly governed, large-scale decentralized sovereign digital community platform.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript proposes a framework for fair democratic governance of dynamically evolving federated digital communities, where small groups self-govern and larger groups use sortition-selected assemblies. It extends prior static fairness results to a dynamic setting with communities forming, joining, and splitting in bottom-up, top-down, and middle-out directions. The central claim is a protocol that reconciles integral seat allocations with overlapping federations such that child communities meet persistent floors at every moment while long-run averages converge to proportional fairness, building on the authors' earlier work on atomic transactions, Constitutional Consensus, and Constitutional Governance in Metric Spaces.

Significance. If the protocol rigorously satisfies the persistent and eventual fairness properties under concurrent structural changes, the result would be significant for scalable decentralized governance systems. It would provide a concrete mechanism for maintaining fairness invariants in evolving federations, extending the authors' prior static results to a setting with practical relevance for large-scale digital communities.

major comments (2)
  1. [Abstract] Abstract: the claim that the protocol ensures persistent fairness 'at all times' while reconciling integral seats with dynamic overlaps is load-bearing for the central contribution, yet the abstract supplies no equations, allocation rules, or proof sketch showing how floor constraints remain feasible when multiple communities change simultaneously (e.g., two children each requiring a floor of 1 against a single available seat).
  2. [Protocol description] The protocol section (presumably §4 or §5): the manuscript must demonstrate that the integer allocation step never violates a child's persistent floor during concurrent form/join/split operations; if the solution relies on sequential stabilization or temporary relaxation, the 'at all times' guarantee fails, directly undermining the extension from static to dynamic fairness.
minor comments (2)
  1. Add an explicit formal definition of 'persistent floor' and 'eventual proportional fairness' early in the paper, with a clear statement of the integer linear program solved at each step.
  2. [Introduction] The citation to prior work by the same authors is appropriate but should include a short paragraph distinguishing the new dynamic reconciliation from the static results in the referenced papers.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful and constructive report. The comments correctly identify areas where the presentation of the persistent fairness claims can be strengthened, particularly regarding the abstract and the handling of concurrent operations. We respond point by point below and will incorporate revisions in the next version of the manuscript.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the claim that the protocol ensures persistent fairness 'at all times' while reconciling integral seats with dynamic overlaps is load-bearing for the central contribution, yet the abstract supplies no equations, allocation rules, or proof sketch showing how floor constraints remain feasible when multiple communities change simultaneously (e.g., two children each requiring a floor of 1 against a single available seat).

    Authors: We agree that the abstract is too concise to convey the supporting details. In the revised version we will expand the abstract by one sentence to outline the core allocation rule (priority assignment of seats to persistent floors via a federation overlap graph, followed by proportional distribution of remainders) and to note that feasibility under simultaneous changes is established by Theorem 5.2. The two-child example will be referenced explicitly as a case handled by reserving floor seats before any structural update is committed. revision: yes

  2. Referee: [Protocol description] The protocol section (presumably §4 or §5): the manuscript must demonstrate that the integer allocation step never violates a child's persistent floor during concurrent form/join/split operations; if the solution relies on sequential stabilization or temporary relaxation, the 'at all times' guarantee fails, directly undermining the extension from static to dynamic fairness.

    Authors: We acknowledge that an explicit argument for concurrent structural changes is needed to make the 'at all times' claim fully transparent. The current protocol description relies on the atomic-transaction model from our prior work to serialize updates, but we will add a new subsection (5.3) containing a short invariance proof: at every commit point the allocation first satisfies all declared persistent floors using a conservative max-flow computation on the current federation graph; only then are remaining seats assigned. This ordering ensures no floor is ever violated, even when multiple communities change simultaneously, without relaxing floors or deferring to post-stabilization. The added material will include the two-child example as a worked case. revision: yes

Circularity Check

1 steps flagged

Dynamic fairness extension inherits core mechanisms via self-citation to prior author works

specific steps
  1. self citation load bearing [Abstract, second paragraph]
    "Prior work shows how grassroots federations can be specified via atomic transactions among assembly members, Constitutional Consensus can realize these transactions and the democratic processes leading to them, and Constitutional Governance in Metric Spaces lets a community govern itself and amend its own constitution. Together, these works form a comprehensive design for an egalitarian, fairly governed, large-scale decentralized sovereign digital community platform."

    The central claim of a protocol ensuring persistent and eventual fairness in dynamic federations is justified by invoking the authors' own prior results as the enabling mechanisms for atomic transactions, consensus, and self-governance. The dynamic extension's validity therefore reduces to the correctness of these self-cited foundations rather than standing on an independent derivation or external benchmark within this paper.

full rationale

The paper explicitly extends static fairness properties from three prior works by the same authors to a dynamic setting with structural changes. The abstract positions these self-citations as forming the comprehensive design foundation, and the new protocol's guarantees for persistent floors and proportional fairness in overlapping federations rely on those foundations without re-deriving or independently verifying them here. This creates moderate load-bearing dependence on self-citation, but the extension itself introduces new reconciliation logic for integral seats, so the central claim retains some independent technical content rather than reducing fully by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The proposal rests on definitions of fairness and sortition from prior papers by the same authors, plus the assumption that community evolution can be modeled so that integral allocations remain feasible at every step.

axioms (2)
  • domain assumption Sortition yields fair representation for larger groups
    Invoked when describing how larger groups are represented by assemblies.
  • domain assumption Communities evolve through bottom-up, top-down, and middle-out formation, joining, and splitting
    Stated as the dynamic setting the protocol must handle.

pith-pipeline@v0.9.0 · 5736 in / 1296 out tokens · 67411 ms · 2026-05-22T17:07:43.198763+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

  • IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear
    ?
    unclear

    Relation between the paper passage and the cited Recognition theorem.

    The main technical challenge is reconciling integral seat allocations with dynamic, overlapping federations, so that child communities always meet their persistent floors while long-run averages converge to proportional fairness.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Constitutional Governance in Metric Spaces

    cs.MA 2026-05 unverdicted novelty 8.0

    A polynomial-time constitutional governance protocol in metric spaces unifies aggregation, supermajority amendment, deliberation, and consensus for digital communities and organizations.

  2. Characterising Global Platforms: Centralised, Decentralised, Federated, and Grassroots

    cs.DC 2025-11 conditional novelty 8.0

    The paper partitions global platforms into four classes by the cardinality of essential agents in multiagent atomic-transactions protocols, with proofs that centralised, decentralised, federated, and grassroots social...

  3. Constitutional Governance in Metric Spaces

    cs.MA 2026-05 unverdicted novelty 7.0

    Constitutional governance in metric spaces integrates aggregation, deliberation, and supermajority amendment into a single polynomial-time process for egalitarian self-governance.

  4. Volitional Multiagent Atomic Transactions: Describing People and their Machines

    cs.DC 2026-04 unverdicted novelty 7.0

    Volitional multiagent atomic transactions model systems of people and machines by requiring both machine preconditions and human willingness for atomic actions, enabling safety and liveness analysis for grassroots platforms.

  5. Implementing Grassroots Logic Programs with Multiagent Transition Systems and AI

    cs.PL 2026-02 unverdicted novelty 6.0

    Derives correct deterministic semantics for multiagent logic programs from abstract ones and uses them as specs for AI-generated Dart implementations.

Reference graph

Works this paper leans on

21 extracted references · 21 canonical work pages · cited by 4 Pith papers

  1. [1]

    Justified representation in approval-based committee voting.Social Choice and Welfare, 48(2):461–485, 2017

    Haris Aziz, Markus Brill, Vincent Conitzer, Edith Elkind, Rupert Freeman, and Toby Walsh. Justified representation in approval-based committee voting.Social Choice and Welfare, 48(2):461–485, 2017

    work page 2017

  2. [2]

    Fair, manipulation-robust, and transparent sortition

    Carmel Baharav and Bailey Flanigan. Fair, manipulation-robust, and transparent sortition. InProceedings of the 25th ACM Conference on Economics and Computation, pages 756–775, US, 2024. ACM

    work page 2024

  3. [3]

    M. L. Balinski and H. P. Young.Fair Representation: Meeting the Ideal of One Man, One Vote. Rowman & Littlefield, US, 2010. 21

    work page 2010

  4. [4]

    Liquid democracy: Potentials, problems, and perspectives.Journal of political philosophy, 24(2):162–182, 2016

    Christian Blum and Christina Isabel Zuber. Liquid democracy: Potentials, problems, and perspectives.Journal of political philosophy, 24(2):162–182, 2016

    work page 2016

  5. [5]

    Governance, part 2: Plutocracy is still bad, 2018

    Vitalik Buterin. Governance, part 2: Plutocracy is still bad, 2018. Available at https://vitalik.eth.limo/general/2018/03/28/plutocracy.html

    work page 2018

  6. [6]

    The sybil attack

    John R Douceur. The sybil attack. InProceedings of the international workshop on peer-to-peer systems, pages 251–260, EU, 2002. Springer

    work page 2002

  7. [7]

    Consensus in the presence of partial synchrony.Journal of the ACM (JACM), 35(2):288–323, 1988

    Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. Consensus in the presence of partial synchrony.Journal of the ACM (JACM), 35(2):288–323, 1988

    work page 1988

  8. [8]

    Decentralized autonomous organizations (DAOs) — ethereum.org, 2021, https://ethereum.org/en/dao

    Ethereum. Decentralized autonomous organizations (DAOs) — ethereum.org, 2021, https://ethereum.org/en/dao

    work page 2021

  9. [9]

    Bloomsbury Publishing, UK, 2011

    David M Farrell.Electoral systems: A comparative introduction. Bloomsbury Publishing, UK, 2011

    work page 2011

  10. [10]

    Flanigan, G

    B. Flanigan, G. Kehne, and A. D. Procaccia. Fair sortition made transparent. In proceedings of NIPS ’21, pages 25720–25731, US, 2021. NIPS

    work page 2021

  11. [11]

    Federated assemblies, 2024

    Daniel Halpern, Ariel D Procaccia, Ehud Shapiro, and Nimrod Talmon. Federated assemblies, 2024

    work page 2024

  12. [12]

    Constitutional consensus, 2025

    Idit Keidar, Andrew Lewis-Pye, and Ehud Shapiro. Constitutional consensus, 2025

    work page 2025

  13. [13]

    Perpetual voting: Fairness in long-term decision making

    Martin Lackner. Perpetual voting: Fairness in long-term decision making. InProceedings of the AAAI conference on artificial intelligence, volume 34, pages 2103–2110, US, 2020. AAAI

    work page 2020

  14. [14]

    A peer-to-peer electronic cash system, 2008

    Satoshi Nakamoto and A Bitcoin. A peer-to-peer electronic cash system, 2008

    work page 2008

  15. [15]

    Dynamic social choice with evolving preferences

    David Parkes and Ariel Procaccia. Dynamic social choice with evolving preferences. In Proceedings of the AAAI conference on artificial intelligence, volume 27, pages 767–773, US, 2013. AAAI

    work page 2013

  16. [16]

    Grassroots distributed systems: Concept, examples, implementation and applications (brief announcement)

    Ehud Shapiro. Grassroots distributed systems: Concept, examples, implementation and applications (brief announcement). In37th International Symposium on Distributed Computing (DISC 2023). (Extended version: arXiv:2301.04391), pages 47:1, 47:7, Italy,

    work page arXiv 2023

  17. [17]

    Grassroots platforms with atomic transactions: Social networks, cryp- tocurrencies, and democratic federations, 2025

    Ehud Shapiro. Grassroots platforms with atomic transactions: Social networks, cryp- tocurrencies, and democratic federations, 2025

    work page 2025

  18. [18]

    Oxford University Press, UK, 2011

    Peter Stone.The luck of the draw: The role of lotteries in decision making. Oxford University Press, UK, 2011

    work page 2011

  19. [19]

    Ethereum: A secure decentralised generalised transaction ledger

    Gavin Wood et al. Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper, 151(2014):1–32, 2014. 22

    work page 2014

  20. [20]

    Public Affairs, US, 2019

    Shoshana Zuboff.The age of surveillance capitalism: The fight for a human future at the new frontier of power. Public Affairs, US, 2019

    work page 2019

  21. [21]

    Shoshana Zuboff. Surveillance capitalism or democracy? the death match of institutional orders and the politics of knowledge in our information civilization.Organization Theory, 3(3):26317877221129290, 2022. 23

    work page 2022