SearcharxivSearch

arXiv subjects

Jon Legarda

Publications and source records attributed to Jon Legarda.

3 recordsLinked to original sources

Scarcity Is Not Enough: Structural Limits of Linear Sybil Cost Under Parallelizable Resources

Permissionless systems resist Sybil attacks by binding influence to scarce resources. Yet influence concentration persists across systems built on computation, capital, and other reusable resources despite substantial differences in protocol design. This raises a fundamental question: is concentration primarily a consequence of protocol rules, or of the structural properties of the underlying resource itself? We address this through the adversarial cost function $C(s,T)$, the minimum expenditure to sustain influence equivalent to controlling $s$ independent participants over a horizon of length $T$. We develop an axiomatic resource taxonomy connecting resource structure to adversarial cost scaling. We show that resource-mechanism pairs satisfying divisibility, additivity of influence, temporal reusability, and identity transferability admit influence amortization, yielding $C(s,T)=o(sT)$. Conversely, throughput-bounded, non-transferable, window-local resources enforce $C(s,T)=\Omega(sT)$, with marginal cost $\Delta(s,T)=\Omega(T)$ increasing with time. These results reveal a fundamental asymptotic separation between resource classes that admit amortization and those that enforce linear cost. These results shift the focus of decentralization from protocol design to resource design. If concentration is a structural consequence of the properties that make resources parallelizable, redesigning consensus rules alone cannot eliminate it. The same properties enable concentrated control to be projected across many nominally distinct participants through delegation, pooling, or identity replication, obscuring the relationship between visible identities and underlying control. The search for stronger decentralization must therefore begin with the choice of the underlying resource.

cs.CR

Proof of Commitment: A Human-Centric Resource for Permissionless Consensus

Permissionless consensus protocols require a scarce resource to regulate leader election and provide Sybil resistance. Existing paradigms such as Proof of Work and Proof of Stake instantiate this scarcity through parallelizable resources like computation or capital. Once acquired, these resources can be subdivided across many identities at negligible marginal cost, making linear Sybil cost fundamentally unattainable. We introduce Proof of Commitment (PoCmt), a consensus primitive grounded in a non-parallelizable resource: real-time human engagement. Validators maintain a commitment state capturing cumulative human effort, protocol participation, and online availability. Engagement is enforced through a Human Challenge Oracle that issues identity-bound, time-sensitive challenges, limiting the number of challenges solvable within each human window. Under this model, sustaining multiple active identities requires proportional human-time effort. We establish a cost-theoretic separation showing that protocols based on parallelizable resources admit zero marginal Sybil cost, whereas PoCmt enforces a strictly linear cost profile. Using a weighted-backbone analysis, we show that PoCmt achieves safety, liveness, and commitment-proportional fairness under partial synchrony. Simulations complement the analysis by isolating human-time capacity as the sole adversarial bottleneck and validating the predicted commitment drift and fairness properties. These results position PoCmt as a new point in the consensus design space, grounding permissionless security in sustained human effort rather than computation or capital.

cs.DC

Human Challenge Oracle: Designing AI-Resistant, Identity-Bound, Time-Limited Tasks for Sybil-Resistant Consensus

Sybil attacks remain a fundamental obstacle in open online systems, where adversaries can cheaply create and sustain large numbers of fake identities. Existing defenses, including CAPTCHAs and one-time proof-of-personhood mechanisms, primarily address identity creation and provide limited protection against long-term, large-scale Sybil participation, especially as automated solvers and AI systems continue to improve. We introduce the Human Challenge Oracle (HCO), a new security primitive for continuous, rate-limited human verification. HCO issues short, time-bound challenges that are cryptographically bound to individual identities and must be solved in real time. The core insight underlying HCO is that real-time human cognitive effort, such as perception, attention, and interactive reasoning, constitutes a scarce resource that is inherently difficult to parallelize or amortize across identities. We formalize the design goals and security properties of HCO and show that, under explicit and mild assumptions, sustaining s active identities incurs a cost that grows linearly with s in every time window. We further describe abstract classes of admissible challenges and concrete browser-based instantiations, and present an initial empirical study illustrating that these challenges are easily solvable by humans within seconds while remaining difficult for contemporary automated systems under strict time constraints.

cs.CR