1 Introduction↩︎

Permissionless systems rest on a radical premise: that open participation, without gatekeepers or trusted authorities, can produce secure and fair collective outcomes. The mechanism that makes this possible—binding influence to the expenditure of a scarce resource—has been the cornerstone of distributed consensus since Nakamoto [1]. Yet deployment has revealed a persistent gap between this promise and reality. Bitcoin’s hash power is concentrated in a handful of mining pools [2]. Ethereum’s stake is dominated by a small number of liquid staking providers [3].

This paper identifies the structural reason why.

1.1 Resource-Based Defenses and Their Shared Blind Spot↩︎

The foundational obstacle in permissionless systems is the Sybil attack [4]: a single adversary generates many identities to amplify influence beyond any honest participant. The standard response is to make identity costly by tying participation to a scarce resource. Proof-of-Work binds influence to computational effort [1], [5]. Proof-of-Stake binds it to financial capital [6]. Graph-based defenses [7], [8] constrain identity placement via social structure. Identity-binding mechanisms [9], [10] restrict credential issuance to verified participants.

Despite their diversity, these approaches share a common blind spot. The original insight behind resource-weighted participation—introduced by Proof-of-Work—was precise: binding influence to a scarce resource prevents cheap identity creation from amplifying adversarial power. Subsequent work has studied this principle extensively, asking whether an adversary’s aggregate resource share crosses a safety threshold.

What has received far less attention is a different question: does the structure of that resource permit influence to be concentrated at sublinear cost? A resource that is divisible, transferable, and reusable allows a fixed base to be redistributed—through identity replication, delegation, or pooling—achieving disproportionate influence without proportional expenditure, even when aggregate resource share remains unchanged. This paper characterizes exactly which resource properties permit this concentration, and which ones prevent it.

1.2 Why Concentration Is Structurally Inevitable↩︎

The concentration patterns observed across deployed systems are not protocol failures. They are structural consequences of the resources those protocols are built on.

In Bitcoin, mining pools aggregate hash power from thousands of participants into a small number of coordinated identities. Gencer et al. [2] document that the top-four pools routinely control over fifty percent of total hash power. The reason is structural: computational capacity is divisible, transferable, and temporally reusable—properties that allow a fixed resource base to be aggregated, redistributed, and reused across arbitrarily many identities at vanishing marginal cost [11], [12]. Moreover, influence is additive: distributing \(r\) across \(k\) identities preserves total influence, \(\sum_{i} f(r_i) = f(r)\), so redistribution incurs no penalty.

Proof-of-Stake replaced computational effort with financial capital, eliminating PoW’s energy cost. But the structure of the underlying resource is identical in the relevant sense: capital is divisible, transferable, temporally reusable, and additive in influence. Delegation mechanisms allow a fixed capital base to be distributed across many validator identities, each carrying proportional influence [6], [13]. The outcome is familiar: as of 2023, Lido Finance alone controlled approximately thirty percent of all staked ETH [3].

The same structural argument applies to every resource that can be subdivided and reused across identities. The pattern is not a coincidence. When a resource satisfies all four properties, a fixed base can be aggregated and redistributed across arbitrarily many identities—amplifying network presence, proposal bandwidth, and committee weight without proportional expenditure. The concentration of power is not an externality. It is built into the resource.

1.3 The Missing Question↩︎

The observation above points to a question existing analyses do not answer:

What structural properties of a security resource guarantee that no adversary can achieve \(s\)-unit influence over \(T\) windows at cost below \(\Omega(sT)\)?

We formalize this through \(C(s,T)\): the minimum expenditure required to achieve influence proportional to \(s\) independent participation units over \(T\) consecutive windows—whether through identity replication, delegation, or pooling. Two regimes matter. If \(C(s,T) = o(sT)\), a fixed resource base suffices to achieve arbitrarily large influence—concentration is cheap regardless of protocol design. If \(C(s,T) = \Omega(sT)\), each additional unit of sustained influence requires proportional expenditure— concentration is structurally infeasible.

The answer, we show, is determined entirely by the structure of the underlying resource. No protocol rule can enforce \(C(s,T) = \Omega(sT)\) when the resource itself is divisible, transferable, temporally reusable, and additive in influence. This is an impossibility result. It holds independently of consensus design, cryptographic assumptions, or network model.

But impossibility alone is not enough. The second result of this paper is constructive: we identify a class of resources—throughput-bounded, non-transferable, and window-local—that provably enforces \(C(s,T) = \Omega(sT)\). This resource class has not been formally characterized in prior work. Beyond its theoretical significance, this characterization is actionable: Any consensus protocol grounded in a throughput-bounded, non-transferable, and window-local resource inherits \(C(s,T) = \Omega(sT)\) by construction, without additional protocol-level enforcement. Introducing this class, and proving its properties, is the central contribution of this paper.

1.4 This Paper↩︎

This paper draws a structural boundary in the design space of permissionless systems and introduces a resource class that sits on the right side of it.

We prove that any resource satisfying four properties— divisibility, additivity of influence, temporal reusability, and identity transferability—admits influence amortization: \(C(s,T) = o(sT)\), regardless of protocol design. Computation, capital, storage, and delegated stake all fall into this class. No mechanism built on such a resource can enforce linear cost of influence concentration.

We then introduce throughput-bounded resources: resources in which each participation unit requires an independent channel, the channel output is non-transferable, and allocation does not carry over across time windows. We prove that any such resource enforces \(C(s,T) = \Omega(sT)\): each additional unit of sustained influence incurs marginal cost \(\Delta(s,T) = \Omega(T)\), growing with the time horizon. Concentration of influence is structurally infeasible by construction.

Together, these two results establish a sharp asymptotic separation: parallelizable resources admit influence concentration at vanishing marginal cost; throughput-bounded resources structurally preclude it.

The separation between these two classes yields a direct design rule—the Resource Substitution Principle: enforcing linear cost of influence concentration requires grounding participation in a resource that violates at least one parallelizability property. Protocol design cannot substitute for resource structure.

1.5 Contributions↩︎

1. Impossibility under parallelizable resources (Theorem 2). Any mechanism whose weighting resource satisfies divisibility, additivity, temporal reusability, and identity transferability satisfies \(C(s,T) = o(sT)\), regardless of protocol design. Influence concentration is achievable at vanishing marginal cost.

2. Linear cost of influence concentration under throughput-bounded resources (Theorem 3). We introduce the class of throughput-bounded, non-transferable, window-local resources and prove that any such resource enforces \(C(s,T) = \Omega(sT)\), with marginal cost \(\Delta(s,T) = \Omega(T)\).

3. Resource Substitution Principle (Theorem 5). Linear cost of influence concentration requires violating at least one parallelizability property. No protocol can enforce this boundary without a structural change in the underlying resource.

1.6 Paper Organization↩︎

Section 2 reviews related work. Section 3 presents the system model. Section 4 develops the resource framework. Section 5 proves the impossibility result. Section 6 proves the linear lower bound. Section 7 establishes the structural separation, the Resource Substitution Principle, and hybrid system behavior. Section 8 classifies concrete resource types. Section 9 presents the evaluation. Section 10 discusses limitations. Section 11 concludes.

2 Related Work↩︎

Prior work on Sybil resistance and permissionless systems addresses several distinct security questions. We survey the main research directions and identify the gap this paper fills. Table 1 summarizes the distinction.

2.1 Resource-Based Sybil Defenses↩︎

Douceur [4] established that in the absence of a trusted authority, identity replication in open systems cannot be prevented. Nakamoto [1] proposed binding participation to a scarce resource—computational effort—as a practical response to this impossibility. Formal analyses of Nakamoto-style consensus [5], [14]–[16] establish chain-growth, common-prefix, and chain-quality guarantees expressed as thresholds on adversarial hash power. Proof-of-Stake protocols—including Ouroboros [6], [17], [18], Snow White [19], and Algorand [20]—replace computational effort with financial capital and derive analogous guarantees as thresholds on adversarial stake. These protocols collectively instantiate the aggregate-threshold adversarial model formalized in foundational Byzantine fault-tolerance work [21], [22]; Algorand additionally employs verifiable random functions [23] for committee selection.

These analyses consistently reason about aggregate adversarial resource ownership. Security guarantees take the form: if the adversary controls less than a threshold fraction of the total resource, the protocol is safe. They do not characterize whether a fixed resource base can be used to concentrate influence at sublinear marginal cost. The present paper addresses this question directly.

2.2 Empirical and Systems-Level Analyses↩︎

Empirical work documents the centralization patterns that resource-based mechanisms produce in practice. Gencer et al. [2] measure mining pool concentration in Bitcoin and Ethereum. Rosenfeld [11], [24] analyzes pooled mining reward systems and hash-rate-based double-spending dynamics. Bonneau et al. [12] and Narayanan et al. [25] survey the broader security and deployment landscape of Bitcoin. Gervais et al. [26], [27] quantify security-performance tradeoffs and decentralization properties of deployed proof-of-work systems. Work on selfish mining [28] and double-spending [29] analyzes adversarial strategies under aggregate resource models. Network-layer studies [30] document how propagation dynamics interact with pool-driven resource concentration.

These works describe the symptoms of structural resource properties—concentration, pooling, delegation— but do not formally characterize why such patterns are structurally inevitable under divisible, reusable resources. The present paper provides this characterization.

2.3 Economic Analyses of Consensus↩︎

Budish [31] and Budish et al. [32] analyze the economic limits of permissionless consensus, framing security in terms of the cost of mounting a majority attack. Carlsten et al. [33] study incentive stability in the absence of block rewards. Saleh [13] provides an equilibrium analysis of Proof-of-Stake.

These analyses model adversarial capability in terms of aggregate resource ownership and study equilibrium incentives or corruption costs. They do not study whether influence can be concentrated at sublinear cost through delegation or pooling—the question central to this paper.

2.4 Graph-Based and Social-Structure Defenses↩︎

SybilGuard [7], SybilLimit [8], and SybilControl [34] bound adversarial influence by exploiting the observation that in social networks, the number of edges between honest and Sybil regions is small relative to internal connectivity. SybilInfer [35] applies probabilistic inference over trust graphs to identify adversarial clusters. Game-theoretic analyses [36] study equilibrium conditions under which honest participants can deter adversarial identity creation.

These approaches address a different question: where Sybil identities can be placed within a social graph, rather than how the cost of adversarial influence scales over time. They provide no characterization of \(C(s,T)\) as \(s\) or \(T\) grows, and their guarantees depend on graph-topology assumptions that may not hold in practice [37].

2.5 Identity-Binding Mechanisms↩︎

Proof-of-Personhood [9] and pseudonym parties [10] bind credentials to real-world participants to enforce one-person–one-identity mappings. Reputation systems [38] offer a related but distinct approach: rather than binding participation to verified identity, they tie influence to accumulated behavioral history. These mechanisms address admission—restricting the creation of new identities—rather than the sustained cost of concentrating influence over time. Once admitted, influence may still be governed by a transferable, reusable resource.

2.6 Capability and Rate-Limiting Architectures↩︎

Hardware-rooted execution environments such as Intel SGX [39] enforce per-device participation limits that bind resource generation to specific hardware. Capability-based systems [40] and congestion-control mechanisms [41] impose per-actor throughput constraints in different deployment contexts. Bitcoin-NG [42] decouples block leadership from transaction throughput, instantiating a per-leader rate constraint as a protocol-level primitive. HoneyBadger BFT [43] makes explicit throughput bounds central to its communication complexity analysis. Alwen et al. [44] study sustained space and time complexity of sequential proof-of-work constructions.

These works impose per-actor throughput constraints but analyze them in the context of access control, network stability, or computational hardness—not the cost of influence concentration. They do not establish the structural separation between parallelizable and throughput-bounded resource classes that this paper proves.

2.7 Positioning↩︎

The common thread across prior work is a focus on aggregate adversarial capability: how much resource does an adversary control, and is it below a safety threshold? No prior work asks whether a fixed aggregate resource can be used to concentrate influence at sublinear marginal cost—whether through identity replication, delegation, or pooling—nor establishes the structural conditions under which this is or is not possible.

This paper provides that characterization. We identify the structural properties that determine whether adversarial cost scales as \(o(sT)\) or \(\Omega(sT)\), establish an impossibility result for parallelizable resources, introduce the throughput-bounded resource class and prove its linear cost guarantee, and derive a design principle for systems requiring linear cost of influence concentration.

3 System Model↩︎

We model an open and permissionless system in which identity creation is inexpensive and no admission authority exists. Influence is regulated by a security-weighting resource \(\mathcal{R}\). Our objective is to characterize how structural properties of \(\mathcal{R}\) determine whether influence can be concentrated at sublinear cost—whether through identity replication, delegation, or pooling.

Table 2 summarizes the core notation.

3.1 Identities and Participation↩︎

In permissionless systems, an identity is a cryptographic key pair that authorizes participation. A single real-world entity may control arbitrarily many key pairs, and therefore arbitrarily many identities, at negligible cost [4]. Influence concentration may therefore arise either through identity replication—controlling many key pairs each with unit weight—or through resource aggregation—controlling few key pairs but delegating or pooling sufficient resource to achieve equivalent aggregate influence. The model captures both mechanisms uniformly.

Let \(\mathcal{U}\) denote the universe of potential participants. At each time window \(t\), the system contains a set of active identities \(\mathcal{V}_t \subseteq \mathcal{U}\). An adversary \(\mathcal{A}\) is identity-unbounded: it may create, retire, and coordinate an arbitrary number of identities at negligible syntactic cost. Let \(S_t \subseteq \mathcal{V}_t\) denote the set of identities controlled by \(\mathcal{A}\) at window \(t\), with \(|S_t| = s_t\). No a priori bound is placed on \(s_t\).

3.2 Time Model↩︎

Time proceeds in discrete windows \(t = 1, 2, \ldots\) A window represents the minimal interval over which resource allocation and influence are refreshed—for example, a block interval or governance epoch.

We evaluate security over a finite horizon of \(T\) windows. An identity is sustained if it remains active throughout all windows \(t = 1, \ldots, T\).

3.3 Resource and Influence↩︎

Let \(\mathcal{R}\) denote the security-weighting resource. For each identity \(v \in \mathcal{V}_t\) and window \(t\), let \(r_v(t) \in \mathbb{R}_{\geq 0}\) denote the resource allocated to \(v\). Influence is determined by a mapping \[W_v(t) = f\bigl(r_v(t)\bigr),\] where \(f : \mathbb{R}_{\geq 0} \to \mathbb{R}_{\geq 0}\) is the protocol’s resource-to-influence function. No structural assumptions are placed on \(f\) at this stage; these will be derived from properties of \(\mathcal{R}\) in Section 4.

The total adversarial influence at window \(t\) is \[W_{\mathcal{A}}(t) = \sum_{v \in S_t} W_v(t).\]

The activation threshold establishes a per-identity, per-window resource floor that is unavoidable regardless of resource structure. The structural results of this paper concern costs beyond this floor: whether a resource imposes an additional \(T\)-scaling cost per unit of sustained influence, or whether temporal reusability eliminates it.

3.4 Adversarial Model↩︎

The adversary \(\mathcal{A}\) is computationally unbounded but constrained by the structural properties of \(\mathcal{R}\). Specifically, \(\mathcal{A}\) may:

• instantiate, retire, and coordinate an arbitrary number of identities;

• allocate and reallocate resource across identities when the resource structure permits;

• reuse resource across time windows when temporal reuse is allowed;

• aggregate influence through delegation or pooling when the resource structure permits.

This model subsumes the aggregate-resource adversaries used in blockchain consensus analyses [5], [6] while remaining protocol-agnostic. The adversary’s only binding constraint is the structural properties of \(\mathcal{R}\), formalized in Section 4.

3.5 Adversarial Cost↩︎

This definition captures influence concentration in full generality: the adversary may achieve influence proportional to \(s\) units through any combination of identity replication, resource delegation, or pooling, whichever minimizes total expenditure.

To expose the structure of costs, we decompose \(C(s, T)\) as \[C(s, T) = C_{\mathrm{stock}}(s) + C_{\mathrm{flow}}(s, T) + h(s, T),\] where \(C_{\mathrm{stock}}(s)\) is the one-time acquisition cost of resources that persist across all \(T\) windows without renewal (e.g., staked capital, hardware); \(C_{\mathrm{flow}}(s, T)\) is the cumulative per-window expenditure for resources that must be renewed each window (e.g., energy, device attestations); and \(h(s, T)\) is the coordination overhead of managing \(s\) participation units over \(T\) windows.

The structural separation of Sections 5–6 concerns the scaling of \(C_{\mathrm{flow}}(s, T)\): parallelizable resources admit \(C_{\mathrm{flow}}(s, T) = 0\) once stock is acquired, whereas throughput-bounded resources enforce \(C_{\mathrm{flow}}(s, T) = \Omega(sT)\).

This assumption captures the empirically observed behavior of pooling and delegation infrastructure: mining pools, validator delegation services, and cloud-managed multi-account orchestration each allow an operator to manage many participation units with overhead scaling as \(O(s + T)\) rather than \(O(sT)\) [11]–[13]. Assumption 1 is an environmental condition on coordination infrastructure, not a property of \(\mathcal{R}\); the two are independent. Theorem 2 holds even when \(h(s, T) = 0\), and Theorem 3 holds regardless of how small \(h(s, T)\) is.

3.6 Scaling Regimes↩︎

Two asymptotic regimes characterize the adversarial cost function.

Under sublinear scaling, the marginal cost of each additional unit of sustained influence does not grow with the time horizon: \(\Delta(s, T) = o(T)\), where \(\Delta(s, T) = C(s, T) - C(s-1, T)\). A fixed resource base suffices to achieve arbitrarily large influence—concentration is cheap regardless of protocol design.

Under linear scaling, each additional unit of sustained influence incurs cost at least \(\Omega(T)\), growing with the time horizon. Achieving influence proportional to \(s\) units over \(T\) windows costs at least \(\Omega(sT)\) regardless of how the adversary distributes its resource.

The central question of this paper is: which regime does a given resource \(\mathcal{R}\) induce? Section 4 provides the structural answer.

4 Resource Framework↩︎

We develop an axiomatic framework for security-weighting resources. Rather than analyzing specific protocols, we characterize resources by their structural properties—the constraints they impose on division, aggregation, reuse, and transfer across identities and time. These properties, not protocol design, determine whether influence concentration is achievable at sublinear cost.

4.1 Resource as a Structural Object↩︎

A security-weighting resource \(\mathcal{R}\) is a quantity that can be allocated across identities, evolves across time windows, and determines influence through the mapping \(f\) of Section 3. The analysis is agnostic to the semantic nature of \(\mathcal{R}\)—whether it is computation, capital, storage, or participation time. What matters are the structural properties governing how \(\mathcal{R}\) behaves under partition, aggregation, temporal reuse, and identity transfer.

4.2 Structural Properties↩︎

The three conditions of Definition 8 jointly imply that each active identity requires an independent participation channel whose capacity cannot be shared, pooled, or carried forward across identities or time. Scaling the number of active identities therefore requires provisioning additional independent channels.

Note that \(\tau\) and \(r_{\min}\) are independent parameters: \(r_{\min}\) is the minimum resource required for an identity to be active, while \(\tau\) bounds the maximum. For the system to admit active identities, we require \(0 < r_{\min} \leq \tau\). The linear lower bound of Theorem 3 holds for any such configuration and is tightest when \(r_{\min} = \tau\).

4.3 Resource Classes↩︎

The following proposition shows that parallelizable resources render influence invariant to identity partitioning—the formal basis of influence amortization.

4.4 Resource Taxonomy↩︎

Table [tab:taxonomy] classifies representative resource types by the structural properties they satisfy. Proof-of-Work is decomposed into its capacity component (mining hardware: parallelizable stock) and its operational component (energy: window-local flow). The theorems of this paper apply to each component separately; the full economic cost of PoW mining involves both.

5 Impossibility Under Parallelizable Resources↩︎

We prove that no protocol grounded in a parallelizable resource can enforce linear cost of influence concentration. The result is independent of protocol design, cryptographic assumptions, and network model: it follows from the structural properties of the resource alone.

5.1 Marginal Influence Cost↩︎

The marginal cost of achieving one additional unit of sustained influence is \[\Delta(s, T) \;=\; C(s, T) - C(s-1, T).\] A resource admits influence amortization if \(\Delta(s, T) = o(T)\): the marginal cost does not grow with the time horizon. We show that every parallelizable resource satisfies this condition, and in fact satisfies the stronger bound \(\Delta(s, T) = O(1)\).

5.2 Supporting Lemmas↩︎

5.3 Main Result↩︎

Theorem 2 is an impossibility result in the following sense: no choice of protocol rules, consensus mechanism, or cryptographic construction can enforce \(C(s,T) = \Omega(sT)\) when the underlying resource is parallelizable. The barrier is structural, not algorithmic. Any adversary with access to a parallelizable resource of aggregate size \(s \cdot r_{\min}\) can sustain \(s\)-unit influence over an arbitrarily long horizon \(T\) at cost growing only as \(O(s)\)—independent of \(T\).

Note that Assumption 1 is used only to bound the coordination term \(h(s,T)\). The core conclusion—that \(C_{\mathrm{flow}}(s,T) = 0\) for a parallelizable resource—holds even when \(h(s,T) = 0\): temporal reusability alone eliminates per-window renewal cost once the stock is acquired.

6 Linear Lower Bound Under Throughput-Bounded Resources↩︎

We prove the complementary result: throughput-bounded, non-transferable, window-local resources structurally enforce \(C(s,T) = \Omega(sT)\). In contrast to parallelizable resources, where influence can be amortized across identities and time, throughput-bounded resources require independent participation capacity per identity per window. Scaling the number of active identities therefore requires proportionally increasing recurring expenditure.

6.1 Supporting Lemma↩︎

6.2 Main Result↩︎

The bound \(C(s,T) \geq s \cdot T \cdot r_{\min}\) is tight: setting \(r_v(t) = r_{\min}\) for all \(v\) and \(t\) achieves \(C(s,T) = s \cdot T \cdot r_{\min}\) exactly, so the lower bound matches the minimum achievable cost.

Theorem 3 holds independently of Assumption 1: the linear lower bound follows from the structural properties of \(\mathcal{R}\) alone, regardless of how small \(h(s,T)\) is.

Contrast with Theorem 2. The separation between the two resource classes is sharpest at the level of marginal cost: \[\begin{align} &\text{Parallelizable:} \quad \Delta(s,T) = O(1), \nonumber \\ &\text{Throughput-bounded:} \quad \Delta(s,T) = \Omega(T). \end{align}\] Under parallelizable resources, each additional unit of sustained influence becomes asymptotically free as the time horizon grows. Under throughput-bounded resources, each additional unit costs at least \(r_{\min} \cdot T\)—growing linearly with the horizon.

7 Structural Separation and Design Consequences↩︎

Theorems 2 and 3 establish bounds on \(C(s,T)\) for each resource class separately. We now combine them into a single separation result and derive its design consequences.

7.1 Structural Separation↩︎

7.2 Resource Substitution Principle↩︎

Theorem 4 yields a direct design constraint.

The Resource Substitution Principle is the central design consequence of this work: the boundary between amortizable and non-amortizable influence regimes is a property of the resource class, not of protocol design.

7.3 Intermediate Regimes↩︎

Theorems 2 and 3 characterize the two extremal resource classes. Real-world mechanisms may satisfy structural properties only partially, yielding scaling behavior that interpolates between the two regimes.

Partial transferability. Suppose at most a fraction \(\alpha \in [0,1]\) of the aggregate allocation can be reassigned across identities, while the remaining fraction \((1-\alpha)\) is identity-bound. Then the adversary can amortize only the transferable portion, yielding \[C(s,T) = \Omega\bigl((1-\alpha) \cdot sT\bigr).\] The bound tightens as \(\alpha \to 0\) (full throughput-boundedness) and weakens as \(\alpha \to 1\) (full parallelizability).

Bounded temporal reuse. Suppose resource allocation persists for at most \(k\) consecutive windows before requiring renewal. The adversary must renew every \(k\) windows, incurring \(\lceil T/k \rceil\) renewal events, so \[C(s,T) = \Omega\!\left(s \cdot \frac{T}{k}\right).\] This interpolates between linear scaling at \(k=1\) (window-local) and sublinear scaling as \(k \to T\) (full temporal reuse).

Characterizing intermediate regimes in full generality remains an open problem; we return to it in Section 10.

7.4 Hybrid Systems↩︎

Real-world systems often combine resource classes. A governance protocol, for example, may allocate voting influence proportionally to financial stake (a parallelizable resource) while constraining proposal submission through per-identity rate limits (a throughput-bounded resource). The following lemma shows that the linear lower bound is preserved whenever a throughput-bounded component is present.

Lemma 5 has a practical implication: a system designer can enforce linear influence cost by introducing any throughput-bounded participation component, even alongside parallelizable influence mechanisms. The throughput-bounded component dominates asymptotically under additive decomposition.

8 Instantiations and Classification↩︎

The structural taxonomy of Table [tab:taxonomy] classifies representative resource types by the properties of Definitions 4–8. This section provides the formal classification argument for per-actor throughput channels and walks through the principal instantiations.

8.1 Per-Actor Throughput Channels↩︎

Several mechanisms naturally ground participation in per-actor execution channels: device-bound attestation environments, human interaction tasks, and rate-limited participation protocols with non-transferable channel binding. We formalize the structural classification of this resource class.

8.2 Instantiation Walkthrough↩︎

Proof-of-Work (hardware component). Mining hardware is divisible, transferable across mining pools, and temporally reusable. Influence is additive: aggregate hash power determines block-production probability independently of identity partitioning. Mining pools empirically instantiate this amortization: the top-four pools routinely control over fifty percent of total hash power [2], [11], consistent with \(C(s,T) = o(sT)\).

Proof-of-Stake (financial capital). Financial capital satisfies the same four properties as PoW hardware: divisible, additive, temporally reusable, and identity-transferable. Delegation mechanisms allow a fixed capital base to be distributed across many validator identities, each carrying proportional influence [6], [13]. As of 2023, Lido Finance alone controlled approximately thirty percent of all staked ETH [3], instantiating the same amortization pattern.

Device-bound execution. Trusted execution environments [39] bind activity to specific hardware. Each device constitutes one per-actor throughput channel whose output is non-transferable and must be renewed each window; a single device cannot simultaneously attest for multiple identities. By Theorem 6, \(C(s,T) = \Omega(sT)\).

Human real-time participation. Human cognition imposes intrinsic per-window throughput limits that cannot be increased by additional computational infrastructure. Sustaining \(s\) active identities requires \(s\) independent human participants, each constituting one channel; \(C(s,T) = \Omega(sT)\) by Theorem 6.

Rate-limited network participation. Account-level rate limits qualify as throughput-bounded only when structurally bound to non-transferable execution channels. Limits attached to syntactic identifiers alone are bypassable through identity replication and do not satisfy Definition 8. Effective enforcement requires binding rate constraints to independent, non-aggregable participation channels such as device-attested proposal submission.

8.3 Governance Illustration↩︎

Consider a governance protocol in which voting influence is proportional to delegated stake—as in DAO-style governance [45]—while proposal submission is subject to a per-identity participation constraint.

Without throughput-binding. If submission limits are enforced only at the account level (syntactic identity), an adversary controlling stake \(r^*\) may split it across \(s\) accounts while preserving total voting weight. Each account gains independent proposal bandwidth, committee presence, and rate-limited interaction capacity. The adversary achieves \(s\)-unit influence at cost \(C(s,T) = o(sT)\) via Theorem 2, since the underlying resource (stake) is parallelizable.

With throughput-binding. If proposal submission is additionally bound to non-transferable participation channels—for example, device-attested submissions or identity-bound participation windows—then the participation component constitutes a throughput-bounded resource \(\mathcal{R}_t\). By Lemma 5, the hybrid system enforces \(C(s,T) = \Omega(sT)\): the throughput-bounded component dominates asymptotically, regardless of how parallelizable the influence mechanism is.

This illustrates the practical import of Corollary 1: the designer need not replace the parallelizable influence mechanism. Introducing any throughput-bounded participation component is sufficient to enforce linear cost of influence concentration.

9 Evaluation↩︎

Note. All figures and tables in this section are direct visualizations of the closed-form cost expressions of Theorems 2 and 3. They are not empirical measurements of deployed systems. Their purpose is to make the asymptotic separation concrete across representative parameter ranges.

We use the following closed-form expressions: \[\begin{align} C_{\mathrm{par}}(s,T) &= s \cdot r_{\min} + h(s,T), \quad h(s,T) = s + T, \tag{1} \\ C_{\mathrm{bnd}}(s,T) &= s \cdot T \cdot r_{\min}, \tag{2} \end{align}\] with \(r_{\min} = 1.0\) unless stated otherwise.

9.1 Cost Scaling Analysis↩︎

Figure 1 plots total adversarial cost and the normalised ratio \(C(s,T)/sT\) against sustained influence units \(s\), for \(T=100\).

Figure 2 fixes \(s=10\) and varies the time horizon \(T\) for three values of \(r_{\min}\). Throughput-bounded cost grows strictly linearly in \(T\) for all parameter values; parallelizable cost remains sublinear relative to \(sT\).

9.2 Non-Amplification Under Identity Replication↩︎

Figure 3 isolates the effect of identity replication under a throughput-bounded resource. The honest population is fixed at \(n=200\) validators. An adversary controls \(m\) independent participation channels and \(s\) target identities, with \(s \in \{400, 700, 1000\}\)—all strictly larger than the plot range of \(m\). Adversarial influence share is \(W_{\mathcal{A}} / W_{\mathrm{tot}} = \min(m,s) / (\min(m,s) + n)\).

Since \(s > m\) throughout, \(\min(m,s) = m\) for all plotted values, and all three curves are identical. Influence share is therefore determined entirely by channel capacity \(m\), not by identity count \(s\): multiplying the number of adversarial identities by a factor of \(2.5\) (from \(s=400\) to \(s=1000\)) yields zero influence gain. This directly validates the non-amplification consequence of Theorem 3.

9.3 Parameter Sensitivity↩︎

Table 3 reports the crossover \(s^*\)—the value of \(s\) at which \(C_{\mathrm{bnd}}(s,T) = C_{\mathrm{par}}(s,T)\)—for representative \((T, r_{\min})\) combinations: \[s^* = \frac{T}{T \cdot r_{\min} - r_{\min} - 1}, \quad T \cdot r_{\min} > r_{\min} + 1. \label{eq:crossover}\tag{3}\] For all tested values, \(s^*\) is small and decreases as \(T\) grows: by \(T=25\), any adversary sustaining more than two or three influence units faces higher cost under throughput-bounded resources than under parallelizable ones.

The evaluation confirms three properties predicted by the theory: (1) the parallelizable normalised cost \(C_{\mathrm{par}}(s,T)/sT \to 0\) as \(s,T \to \infty\) (Theorem 2); (2) the throughput-bounded normalised cost \(C_{\mathrm{bnd}}(s,T)/sT = r_{\min}\) remains bounded away from zero for all \(s\) and \(T\) (Theorem 3); and (3) adversarial influence under throughput-bounded resources scales with channel capacity \(m\), not with identity count \(s\), confirming that identity replication without proportional channel capacity yields no influence gain.

9.4 Empirical Calibration↩︎

The closed-form expressions of Sections 9.1–9.3 illustrate the asymptotic regimes using unit parameters. We now calibrate the model against two deployed systems whose concentration behavior is documented in the cited literature, using parameters drawn directly from those sources. The purpose is to show that the framework produces non-trivial, quantitatively grounded predictions about observable participation patterns.

Ethereum proof-of-stake

The Ethereum protocol requires each validator to commit a minimum stake of \(r_{\min} = 32\) ETH [6], making this the natural activation threshold. As of 2023, Lido Finance operated approximately \(s \approx 300{,}000\) validators, representing roughly thirty percent of all staked ETH [3]. Time is measured in epochs; one Ethereum epoch comprises 32 slots and lasts approximately 6.4 minutes.

Figure 4 applies the cost model to these parameters. Under the current parallelizable mechanism (financial capital), the adversarial cost is \[C_{\mathrm{par}}(300{,}000,\, T) \;\approx\; 9.6 \times 10^6 \;\text{ETH},\] independent of \(T\): a one-time stock acquisition suffices regardless of the participation horizon. Under a hypothetical throughput-bounded mechanism with the same \(r_{\min}\), the cost grows as \(C_{\mathrm{bnd}}(300{,}000,\, T) = 32 \times 300{,}000 \times T\) ETH, reaching \(9.6 \times 10^9\) ETH at \(T = 1{,}000\) epochs (approximately 4.4 days)—a quantity exceeding the total circulating ETH supply by approximately two orders of magnitude (total supply \(\approx 1.2 \times 10^8\) ETH as of December 2023 [3]). The normalised ratio \(C_{\mathrm{par}}/sT \to 0\) while \(C_{\mathrm{bnd}}/sT = r_{\min} = 32\) remains constant, consistent with Theorems 2 and 3 respectively.

Bitcoin proof-of-work

Gencer et al. [2] report that the top-four Bitcoin mining pools collectively controlled over fifty percent of total hash power, with individual shares of approximately \(16.5\%\), \(15.5\%\), \(12.0\%\), and \(11.5\%\), respectively. We represent each pool’s effective identity count proportional to its share of a normalised network of \(N = 10{,}000\) units.

Figure 5 (a) plots \(C_{\mathrm{par}}(s,T)/sT\) for four operator tiers spanning small pools (\(s = 50\)) to the top-pool tier (\(s = 1{,}650\)). For all tiers, the ratio decays toward zero as \(T\) grows, confirming the \(C_{\mathrm{par}}(s,T) = o(sT)\) prediction of Theorem 2. Figure 5 (b) displays the marginal cost separation: \(\Delta_{\mathrm{par}}(s,T) = O(1)\) versus \(\Delta_{\mathrm{bnd}}(s,T) = \Omega(T)\), illustrating the structural gap of Theorem 4.

The calibration confirms that the asymptotic separation of Theorems 2 and 3 is not merely a theoretical asymptote: at the scale of deployed systems and realistic participation horizons, the cost gap between parallelizable and throughput-bounded mechanisms is quantitatively decisive. For the Lido-scale case, the crossover occurs within the first few epochs; for Bitcoin pool tiers, within the first few hundred block intervals.

10 Limitations and Open Problems↩︎

The structural separation established in this paper characterizes adversarial cost scaling under explicit modeling assumptions. Several limitations and open directions remain.

10.1 Enforcement of Throughput Constraints↩︎

The framework assumes a per-identity throughput bound \(\tau\) and activation threshold \(r_{\min}\) that hold structurally. Practical mechanisms approximate non-transferability and window-locality via device attestation and session serialization, but no deployment enforces them perfectly; advances in automation may effectively increase \(\tau\). The formal guarantees hold given the structural properties of Definitions 9 and 8; deployment-level fidelity is outside the scope of the present framework.

10.2 Non-Additive Hybrid Compositions↩︎

Lemma 5 establishes that a throughput-bounded component preserves the linear lower bound under additive cost decomposition. Non-additive compositions—where the two resource classes interact in ways that are not captured by \(C(s,T) = C_p(s,T) + C_t(s,T)\)—remain outside the present scope.

For example, a system might require a minimum threshold of both parallelizable and throughput-bounded resources to be active, creating a non-additive coupling. Whether the linear lower bound is preserved under such compositions is an open problem.

10.3 Economic Coordination and Identity Markets↩︎

The model abstracts away economic coordination dynamics. In practice, delegation markets, identity outsourcing, and secondary markets for rate-limited credentials may alter the effective cost structure; characterizing equilibrium behavior under adaptive incentives and strategic outsourcing remains outside the present scope.

10.4 Window Granularity and Temporal Modeling↩︎

The model partitions time into discrete windows of fixed duration. Smaller windows increase renewal frequency under throughput-bounded resources; larger windows may weaken window-local constraints. A window-independent formulation expressing the separation in terms of wall-clock time remains an open direction.

10.5 Scope of the Framework↩︎

The framework is structural and protocol-agnostic: it characterizes the resource-level preconditions that any mechanism must satisfy, and does not replace deployment-specific security analyses, probabilistic consensus proofs, or economic equilibrium models. Characterizing intermediate scaling regimes—where structural properties are only partially satisfied—in full generality remains an open theoretical problem.

11 Conclusion↩︎

Binding influence to a scarce resource prevents cheap identity creation from amplifying adversarial power— but scarcity alone is insufficient. The structural properties of the resource determine whether influence can be concentrated at sublinear cost, regardless of how the protocol is designed.

We proved that any resource satisfying divisibility, additivity of influence, temporal reusability, and identity transferability admits influence amortization: \(C(s,T) = o(sT)\), with marginal cost \(\Delta(s,T) = O(1)\) that does not grow with the time horizon (Theorem 2). This is an impossibility result: no protocol rule can enforce linear cost of influence concentration over a structurally parallelizable resource. We further proved that throughput-bounded, non-transferable, window-local resources enforce \(C(s,T) = \Omega(sT)\), with marginal cost \(\Delta(s,T) = \Omega(T)\) growing with the time horizon (Theorem 3). Theorems 2 and 3 together establish a sharp asymptotic separation between the two resource classes (Theorem 4).

The Resource Substitution Principle (Theorem 5) translates this separation into a design rule: enforcing linear cost of influence concentration requires grounding participation in a resource that violates at least one parallelizability property. Protocol design cannot substitute for resource structure. Any mechanism grounded in a throughput-bounded, non-transferable, and window-local resource inherits \(C(s,T) = \Omega(sT)\) by construction—without additional protocol-level enforcement.

Future directions include the formal characterization of intermediate scaling regimes under partial violations of parallelizability, equilibrium analysis under adaptive incentives and identity markets, and the design of practical mechanisms that enforce throughput-boundedness while preserving permissionlessness and accessibility.

References↩︎