Pith. sign in

REVIEW 1 major objections 8 minor 37 references

Slack and Budget Breaking in Threshold Team Production

T0 review · 1 major / 8 minor · reviewed 2026-07-08 · glm-5.2

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Exact bounty formula deters coalitional delay in threshold systems

desk verdict Clean, self-contained minimax bounty for threshold team production. The main theorem is correct and the lower bound is tight. Worth a serious referee. read the letter →

arxiv 2607.06197 v1 pith:2CAOWS6D submitted 2026-07-07 cs.GT

Benjamin Marsh , Alejandro Ranchal-Pedrosa This is my paper
classification cs.GT
keywords deltasharescompletionnstarbountycoalitiononlycommitted
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper solves the incentive problem of preventing coalitions of agents from deliberately delaying the completion of a threshold task — any system where a public good is produced only after enough verifiable shares are committed, such as threshold signatures, data availability certification, or k-of-n voting. The central observation is that when the honest schedule produces more share opportunities than strictly needed (creating 'slack'), delay is no longer something a single agent can achieve: a coalition must withhold more shares than the slack to push completion past the deadline. This converts unilateral free-riding into coordinated sabotage, which can be priced. The paper proves that the cheapest sabotage set always has size exactly one more than the slack, and that the optimal way to deter it is a uniform, timely bounty: pay every contributor equally if the task completes on time, pay nothing if it is late. The paper then derives the exact minimum budget the principal must post, proves it is tight among all nonnegative completion-measurable bounties, and shows that recovery-fee leakage and exclusion ratchets enter the formula in precise ways. A separate impossibility result establishes that no transfer rule based only on committed shares can eliminate a final-slot race in which a coalition observes enough pre-completion information to act before the task is sealed.

What carries the argument

The argument rests on a pathwise slack-geometry identity (Theorem 1): completion is delayed past the honest horizon if and only if the coalition withholds strictly more than Δ shares. This reduces the coalitional game to pricing the cheapest sabotage set of size Δ+1. A symmetrization lemma (Lemma 3) shows that anonymous contracts are without loss for worst-case design. A recovery-slot farming bound (Lemma 4) limits how much fee revenue a delaying coalition can recoup after the deadline. Together these collapse the problem to a single inequality comparing the coalition's opportunity cost — forfeited fees plus forfeited bounty — against its delay value plus recovery revenue.

What would settle it

Construct a threshold system with positive slack Δ, post the exact budget B* with TIMELY-TEAM, and exhibit a coalition controlling exactly Δ+1 horizon shares whose total bounty under the rule is at most (Δ+1)B*/N* and whose delay value L plus recovery revenue R₁⁺ strictly exceeds (Δ+1)f + (Δ+1)B*/N*. If such a coalition exists and can profitably deviate, the budget is insufficient and the tightness claim fails.

Watch

Extended reading notes

Core claim

The paper's central result is the exact worst-case budget formula B* = N*/(Δ+1) · (L + R₁⁺ − (Δ+1)f)⁺, where N* is the number of share opportunities by the honest deadline, Δ is the slack (redundant shares), f is the per-share fee, L is the coalition's maximum delay value, and R₁⁺ bounds recovery-slot fee leakage. This budget is both sufficient (achieved by the uniform timely team bounty TIMELY-TEAM, which pays B/N* to every admissible horizon share if completion is on time and zero otherwise) and necessary (Theorem 4 shows any budget-B bounty has some Δ+1 shares whose total bounty is at most (Δ+1)B/N*, so a coalition controlling exactly those shares can profitably delay if the budget is any

Load-bearing premise

The model assumes that coalition members can make frictionless side payments to one another, perfectly coordinating and redistributing delay value among themselves. If real coalitions face internal coordination costs or trust constraints, the actual budget required to deter delay could be lower than the formula predicts, and the tightness claim would be an overestimate rather than an exact characterization.

Editorial extensions

If this is right

  • Protocol designers can compute the exact bounty needed to deter coalitional delay given only the threshold, the honest schedule, the per-share fee, and an upper bound on extractable value — no estimation of cartel membership or private types required.
  • Setting the threshold to exactly divide the number of share opportunities (zero slack) is the most expensive configuration, because a single withheld share suffices to delay; provisioning positive slack weakly reduces the required bounty.
  • Closing the recovery-fee leak — for example by paying fees only for shares committed before the deadline — sets R₁⁺ to zero and can eliminate the need for an external bounty entirely when fees alone exceed the delay value.
  • Exclusion ratchets that punish no-show agents with future routing loss add a per-withholding continuation cost λ, directly reducing the required bounty budget by (Δ+1)λ.
  • The final-slot visibility impossibility means that completion bounties solve the multi-slot sabotage problem but cannot prevent within-slot front-running; threshold encryption, commit-reveal, or sealing mechanisms are needed for that residual risk.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

1 major / 8 minor

Summary. This paper studies the incentive problem of coalitional delay in threshold team production systems, where a public task completes only after κ verifiable shares are committed. The key observation is that if the honest schedule creates N* = κ + Δ share opportunities by the deadline, then Δ shares are slack, and a coalition delays completion if and only if it withholds at least Δ+1 shares. The authors characterize the exact worst-case budget B* needed to deter such coalitional delay using a nonnegative, completion-measurable, timely bounty. The optimal rule (TIMELY-TEAM) uniformly distributes the bounty across all horizon shares if completion is on time, and pays nothing if completion is late. The paper proves that this bound is tight among all nonnegative completion-measurable timely bounties (Theorems 2–4), carefully accounts for recovery fee revenue (Lemmas 4–5), and discusses extensions including exclusion ratchets, Bayesian slack uncertainty, and a final-slot visibility impossibility result.

Significance. The paper provides a clean, parameter-free characterization of the budget needed to deter coalitional delay in threshold systems. The main derivation is self-contained: B* follows from the slack identity (Theorem 1) and a pigeonhole argument (Theorem 2) without fitting to data. The tightness result (Theorem 4) correctly identifies the minimal coalition controlling exactly the cheapest Δ+1 horizon shares as the binding adversary. The recovery accounting in Lemmas 4–5 is careful and well-structured. The result is applicable to several systems (threshold signatures, data availability, coded dissemination, generic k-of-n tasks), and the separation between the multi-slot sabotage problem (solved by the bounty) and the within-slot visibility floor (not solvable by transfer rules alone, Proposition 2) is a useful conceptual contribution. The inclusion of a Sedna instantiation (Appendix A) and calibration examples (Appendix D) adds practical grounding.

major comments (1)
  1. Theorem 4 (Matching lower bound) requires a coalition that controls exactly the cheapest Δ+1 horizon shares and no other horizon shares. The paper argues this is the worst case because under TIMELY-TEAM, a coalition controlling additional submitted horizon shares forfeits their bounty too, strictly increasing cost. This argument is correct under the assumption that the coalition's horizon share holdings are observable or that the existence of such a minimal coalition on some path suffices for tightness. However, the ex-post condition (Definition 1) quantifies over all coalitions on every path. The tightness claim would be strengthened by explicitly stating that the lower bound holds on any path where such a minimal coalition exists (which, by the pigeonhole argument, is every path). The current phrasing in the Theorem 4 statement ('Suppose the contact path contains a set of Δ+1 horizon份额
minor comments (8)
  1. §2, Definition 1: The phrase 'arbitrary internal side payments funded by at most L + Rrec(c)' could be clearer about whether 'at most' means the side payments cannot exceed L + Rrec(c) in total, or per member. Clarifying this would improve readability.
  2. §4, Theorem 2: The proof states 'If a coalition controls exactly those shares, withholding them deletes Δ+1 contributions and delays completion by Theorem 1, while forfeiting at most this much bounty.' The phrase 'at most' is correct but could be confused with 'at least'; consider rephrasing to 'forfeiting no more than (Δ+1)B/N* in bounty' for clarity.
  3. §5.2: The timely fee prefix rule is introduced somewhat informally. A formal definition (parallel to Definition 2 for the bounty) would help readers precisely understand the distinction between the fee rule and the bounty rule.
  4. Appendix D, Table: The row for κ=50, t*=3, Δ=10 shows q(0)=0.699, which is substantially higher than the κ=30 row (q(0)=0.136) despite both having Δ=10. A brief note explaining why the delay probability increases with t* for fixed Δ would help readers interpret the table.
  5. References [16] and [22] are self-citations to the Sedna system. These are relevant for the instantiation but should be clearly marked as such to avoid any appearance of self-promotion, especially since the abstract theorem does not depend on Sedna.
  6. §6, Proposition 2: The condition 'the coalition can take an extraction action before completion while still producing the same committed shares used by the bounty rule' is a strong assumption. A brief discussion of when this holds in practice (e.g., in agent-local coded dissemination) versus when it might not would contextualize the impossibility result.
  7. Appendix G: The net marginal fee condition is stated in prose without a formal definition. Given that Theorem 3 explicitly assumes nonnegative marginal fees, a formal statement of the weaker net marginal condition would make the appendix more useful.
  8. Typos: §2, 'a coalition may prefer to withhold enough of its own share opportunities to make completion late' — 'share opportunities' could be 'shares' for consistency. §5.1, Lemma 4 proof: 'fewer than d recovery shares can have been publicly committed; otherwise the post-horizon deficit would already have been filled' — consider 'would already have been filled' for grammar.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for a careful reading and a constructive recommendation. The referee correctly identifies that Theorem 4's tightness argument can be stated more explicitly regarding the relationship between the ex-post quantification in Definition 1 and the existence of a minimal coalition on every path. We agree this clarification improves the paper and will revise accordingly.

read point-by-point responses

  1. Referee: Theorem 4 (Matching lower bound) requires a coalition that controls exactly the cheapest Δ+1 horizon shares and no other horizon shares. The paper argues this is the worst case because under TIMELY-TEAM, a coalition controlling additional submitted horizon shares forfeits their bounty too, strictly increasing cost. This argument is correct under the assumption that the coalition's horizon share holdings are observable or that the existence of such a minimal coalition on some path suffices for tightness. However, the ex-post condition (Definition 1) quantifies over all coalitions on every path. The tightness claim would be strengthened by explicitly stating that the lower bound holds on any path where such a minimal coalition exists (which, by the pigeonhole argument, is every path). The current phrasing in the Theorem 4 statement should be clarified.

    Authors: The referee is correct that the connection between the ex-post quantification in Definition 1 and the lower-bound argument in Theorem 4 should be made fully explicit. We will revise the manuscript to state this clearly. The key logical chain is as follows. (1) By the pigeonhole argument in Theorem 2, on every full-submission on-time path with N* horizon shares, any budget-B completion-measurable bounty assigns to some set of Δ+1 horizon shares a total bounty of at most (Δ+1)B/N*. (2) On every such path, there exists a coalition controlling exactly those Δ+1 cheapest shares and no other horizon shares — this is an existential statement about a realized contact path, not an observability assumption. The coalition is defined by the shares it controls on that path. (3) Definition 1 quantifies over all coalitions on every path; the lower bound exhibits, for each path, a specific coalition that makes delay profitable when the budget is below B*. Since such a coalition exists on every path (by the pigeonhole argument), the lower bound holds pathwise and uniformly. (4) The restriction to a coalition controlling exactly Δ+1 shares and no others is not a weakening: under TIMELY-TEAM, a larger coalition forfeits strictly more bounty, so the minimal coalition is the binding adversary. We will add an explicit sentence after the Theorem 4 statement clarifying that the pigeonhole argument of Theorem 2 guarantees the existence of such a minimal coalition on every on-time path, and that this is why the lower bound applies uniformly under the ex-post condition of Definition 1. revision: yes

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity. The derivation chain is parameter-free and self-contained; self-citations are for implementation context only.

full rationale

The paper's central derivation chain is: Theorem 1 (delay ⟺ W > Δ, a direct counting identity from N* = κ + Δ) → Theorem 2 (pigeonhole: among N* shares with total bounty ≤ B, the Δ+1 cheapest sum to at most (Δ+1)B/N*; TIMELY-TEAM achieves equality uniformly) → Lemmas 2, 4, 5 (opportunity cost, recovery bound, binding case c = Δ+1) → Theorem 3 (sufficiency: inequality (Δ+1)f + (Δ+1)B/N* ≥ L + R₁⁺) → Theorem 4 (necessity: same pigeonhole argument shows any budget-B bounty has Δ+1 cheap shares, so violating the inequality yields a profitable deviation). Each step follows from prior steps or direct counting/algebra. The budget formula B* = N*/(Δ+1)·(L + R₁⁺ − (Δ+1)f)⁺ is obtained by solving the inequality for B, and the lower bound (Theorem 4) independently reuses the pigeonhole argument from Theorem 2 to show tightness. No step reduces to its inputs by construction. The inputs L, R₁⁺, f, N*, Δ are model primitives or external bounds, not fitted parameters. Self-citations (refs 16, 22 by the same authors) appear only in the Sedna instantiation context (Appendix A) and are not invoked in any theorem proof. The score of 1 reflects the presence of these non-load-bearing self-citations; the core mathematical argument is fully self-contained and non-circular.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The paper introduces no new physical entities or particles. The model uses standard game-theoretic constructs (coalitions, bounties, fees). The axioms are domain assumptions appropriate to the threshold-system setting. The 'timely' bounty expiration is a design rule, not an axiom about the world. No free parameters are fitted; the formula is parameter-free given external inputs (κ, Δ, f, L, R₁⁺).

assumptions (5)
  • domain assumption Transferable utility with frictionless side payments within coalitions
    Definition 1 (§2): The delay value L can be redistributed frictionlessly among coalition members. This reduces coalitional stability to aggregate opportunity cost comparison.
  • domain assumption Static nonnegative marginal fees
    §2 and Appendix G: An additional admissible pre-horizon share cannot reduce the agent's other revenue before considering delay value. The main theorem depends on this; Appendix G states a weaker net marginal condition.
  • domain assumption Admissibility is publicly verifiable
    §2: A submitted share counts only if it satisfies the committed validity rule. Enforced by agent-bound tickets in the coded dissemination instantiation.
  • domain assumption Exchangeable availability process
    §2: The law of (A_t) is invariant under agent relabeling. Used in Lemma 3 (symmetrization) to show anonymous contracts are without loss for worst-case design.
  • ad hoc to paper Timeliness of bounty: all bounty payments are zero when T > t*
    Definition 2 (§4): The TIMELY-TEAM rule expires the bounty on delay. This is a design choice central to preventing bounty recapture in recovery slots.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Slack and Budget Breaking in Threshold Team Production." pith.science (2026). https://pith.science/paper/2CAOWS6D

@misc{pith2026260706197,
  author       = {Pith},
  title        = {Pith review of: Slack and Budget Breaking in Threshold Team Production},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/2CAOWS6D}},
  note         = {Machine review of arXiv:2607.06197}
}
abstract

A threshold system completes a public task only after $\kappa$ verifiable shares are publicly committed. If the honest schedule creates \( \Nstar=\kappa+\Delta \) share opportunities by deadline $t^\star$, then $\Delta$ shares are slack such that a coalition delays completion if and only if it withholds at least $\Delta+1$ shares. The incentive problem is therefore to price the cheapest sabotage set. Agents receive a direct fee $f$ per committed share. A delaying coalition may also obtain delay value at most $L$, and may earn additional fee revenue during recovery after the deadline. Let $R_1^+$ be a pathwise upper bound on the coalition's incremental fee revenue in a recovery slot that completes the task, including any same-slot overshoot. The principal can post a nonnegative completion bounty that depends only on committed shares, uses no deposits or punishments, and expires if completion is late. The optimal rule is uniform, as if completion occurs by $t^\star$, every admissible horizon share receives $B/\Nstar$, otherwise no bounty is paid. Full participation is ex-post strongly delay proof exactly when \( (\Delta+1)f+\frac{\Delta+1}{\Nstar}B \ge L+R_1^+ . \) Equivalently, the exact worst-case budget is \( B^\star = \frac{\Nstar}{\Delta+1} \bigl(L+R_1^+-(\Delta+1)f\bigr)^+ . \) The bound is tight for every nonnegative completion measurable bounty, among the $\Nstar$ horizon shares, some $\Delta+1$ receive total bounty at most $(\Delta+1)B/\Nstar$, and withholding precisely those shares delays completion. The result applies to threshold signatures, data availability certification, coded dissemination, and generic $k$-of-$n$ completion tasks. We also isolate a separate limit, no transfer rule based only on completed shares can remove a final slot race in which a coalition has already observed enough pre-completion shares to act.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

37 extracted references · 37 canonical work pages

  1. [1]

    R. J. Aumann. Acceptable points in general cooperativen-person games. InContri- butions to the Theory of Games IV, Annals of Mathematics Studies 40, pp. 287–324, Princeton University Press, 1959

    work page 1959

  2. [2]

    B. D. Bernheim, B. Peleg, and M. D. Whinston. Coalition-proof Nash equilibria I. Concepts.Journal of Economic Theory, 42(1):1–12, 1987

    work page 1987

  3. [3]

    Bergemann and S

    D. Bergemann and S. Morris. Robust mechanism design.Econometrica, 73(6):1771– 1813, 2005

    work page 2005

  4. [4]

    Chung and E

    H. Chung and E. Shi. Foundations of transaction fee mechanism design.SODA, 2023

    work page 2023

  5. [5]

    Danezis, L

    G. Danezis, L. Kokoris-Kogias, A. Sonnino, and A. Spiegelman. Narwhal and Tusk: A DAG-based mempool and efficient BFT consensus.EuroSys, 2022

    work page 2022

  6. [6]

    Keidar, E

    I. Keidar, E. Kokoris-Kogias, O. Naor, and A. Spiegelman. All you need is DAG. PODC, 2021

    work page 2021

  7. [7]

    Garimidi et al

    P. Garimidi et al. Multiple concurrent proposers: Why and how.IACR Cryptology ePrint Archive, 2025/1772, 2025

    work page 2025

  8. [8]

    M. Luby. LT codes.FOCS, 2002

    work page 2002

Show all 37 references
  1. [9]

    A.Shokrollahi.Raptorcodes.IEEE Transactions on Information Theory,52(6):2551– 2567, 2006

    2006

  2. [10]

    M. O. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance.Journal of the ACM, 36(2):335–348, 1989

    1989

  3. [11]

    Cachin and S

    C. Cachin and S. Tessaro. Asynchronous verifiable information dispersal.SRDS, 2005

    2005

  4. [12]

    Alhaddad, S

    N. Alhaddad, S. Das, S. Duan, L. Ren, M. Varia, and Z. Xiang. Brief announcement: Scalable asynchronous verifiable information dispersal.DISC, 2022

    2022

  5. [13]

    Zhang, L.-H

    H. Zhang, L.-H. Merino, Z. Qu, M. Bastankhah, V. Estrada-Galinanes, and B. Ford. F3B: A low-overhead blockchain architecture with per-transaction front-running protection.arXiv:2205.08529, 2022

    2022 arXiv

  6. [14]

    A. R. Choudhuri, S. Garg, J. Piet, and G.-V. Policharla. Mempool privacy via batched threshold encryption: Attacks and defenses.USENIX Security, 2024

    2024

  7. [15]

    Bormet et al

    J. Bormet et al. BEAT-MEV: Epochless approach to batched threshold encryption for MEV prevention.USENIX Security, 2025

    2025

  8. [16]

    Marsh and A

    B. Marsh and A. Ranchal-Pedrosa. A mechanism design overview of Sedna. arXiv:2603.17614, 2026

    2026

  9. [17]

    Eskandari, S

    S. Eskandari, S. Moosavi, and J. Clark. SoK: Transparent dishonesty: Front-running attacks on blockchain.Financial Cryptography Workshops, 2019

    2019

  10. [18]

    Daian, S

    P. Daian, S. Goldfeder, T. Kell, Y. Li, X. Zhao, I. Bentov, L. Breidenbach, and A. Juels. Flash Boys 2.0: Frontrunning, transaction reordering, and consensus instability in decentralized exchanges.IEEE Symposium on Security and Privacy, 2020

    2020

  11. [19]

    K. Qin, L. Zhou, B. Livshits, and A. Gervais. Attacking the DeFi ecosystem with flash loans for fun and profit.Financial Cryptography, 2021

    2021

  12. [20]

    Babel, P

    K. Babel, P. Daian, M. Kelkar, and A. Juels. Clockwork finance: Automated analysis of economic security in smart contracts.IEEE Symposium on Security and Privacy, 2023

    2023

  13. [21]

    Roughgarden

    T. Roughgarden. Transaction fee mechanism design.ACM SIGecom Exchanges, 19(1):52–55, 2021

    2021

  14. [22]

    Ranchal-Pedrosa, B

    A. Ranchal-Pedrosa, B. Marsh, L. Kokoris-Kogias, and A. Sonnino. Sedna: Sharding transactions in multiple concurrent proposer blockchains.arXiv:2512.17045, 2025. Slack and Budget Breaking in Threshold Team Production 15

    2025

  15. [23]

    E. H. Clarke. Multipart pricing of public goods.Public Choice, 11:17–33, 1971

    1971

  16. [24]

    T. Groves. Incentives in teams.Econometrica, 41(4):617–631, 1973

    1973

  17. [25]

    Holmström

    B. Holmström. Moral hazard in teams.The Bell Journal of Economics, 13(2):324– 340, 1982

    1982

  18. [26]

    R. Wilson. Game-theoretic analyses of trading processes. InAdvances in Economic Theory: Fifth World Congress, pp. 33–70, 1987

    1987

  19. [27]

    Kelkar, F

    M. Kelkar, F. Zhang, S. Goldfeder, and A. Juels. Order-fairness for Byzantine consensus.CRYPTO, 2020

    2020

  20. [28]

    Kelkar, S

    M. Kelkar, S. Deb, S. Long, A. Juels, and S. Kannan. Themis: Fast, strong order- fairness in Byzantine consensus.CCS, 2023

    2023

  21. [29]

    K. Mu, B. Yin, A. Asheralieva, and X. Wei. Separation is good: A faster order- fairness Byzantine consensus.NDSS, 2024

    2024

  22. [30]

    Cachin, J

    C. Cachin, J. Mićić, N. Steinhauer, and L. Zanolini. Quick order fairness.Financial Cryptography, 2022

    2022

  23. [31]

    Al-Bassam, A

    M. Al-Bassam, A. Sonnino, and V. Buterin. Fraud and data availability proofs: Maximising light client security and scaling blockchains with dishonest majorities. arXiv:1809.09044, 2018

    2018 arXiv

  24. [32]

    M. Yu, S. Sahraei, S. Li, S. Avestimehr, S. Kannan, and P. Viswanath. Coded Merkle tree: Solving data availability attacks in blockchains.Financial Cryptography, 2020

    2020

  25. [33]

    V. Buterin. Notes on data availability sampling and danksharding. Technical notes, 2024

    2024

  26. [34]

    Ranchal-Pedrosa and V

    A. Ranchal-Pedrosa and V. Gramoli. TRAP: The bait of rational players to solve Byzantine consensus.ACM AsiaCCS, 2022

    2022

  27. [35]

    Hoeffding

    W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13–30, 1963

    1963

  28. [36]

    V. Chvátal. The tail of the hypergeometric distribution.Discrete Mathematics, 25(3):285–287, 1979

    1979

  29. [37]

    Boucheron, G

    S. Boucheron, G. Lugosi, and P. Massart.Concentration Inequalities: A Nonasymp- totic Theory of Independence. Oxford University Press, 2013. 16 B. Marsh and A. Ranchal-Pedrosa ASednaInstantiation Details This appendix records the implementation details for the coded disseminat...

    2013

Pith tools

Reviewed July 8, 2026 · model on record in the stance chip above.