Hypothesis and Theory
Frontiers in Blockchain ·
Volume 9 - 2026 | https://doi.org/10.3389/fbloc.2026.1747512
The architecture of blockchain value: capabilities, pillars, and growth dynamics
- Agisilaos Papadogiannis1*corresponding author
- Independent Researcher, The Hague, Netherlands
Abstract
This paper develops a capability-based framework for understanding the architecture and value of blockchain systems. We classify networks into three paradigms: single-capability systems that deliver one core function, multi-capability systems that integrate a bounded set of programmable services, and meta-capability systems that coordinate extensible marketplaces of heterogeneous services. To explain how these paradigms scale, we introduce five architectural pillars, purpose, consensus, incentives, tokenomics, and network effects, that jointly constrain the feasibility and sustainability of capability provision. Building on these foundations, we propose a valuation model in which network value arises from adoption, per-unit service value, and architectural network effects, with composability across capabilities generating quadratic scaling in the symmetric benchmark. We prove a formal dominance result: under symmetric conditions, meta-capability systems dominate multi-capability systems, which in turn dominate single-capability systems. The framework links protocol design choices directly to value creation and clarifies why some architectures scale reliably while others face structural bottlenecks, providing a structured basis for evaluating long-run viability and strategic positioning of blockchain ecosystems.
Keywords
1 Introduction
At their core, both firms and blockchains are mechanisms for value creation. Firms produce and sell goods or services, including digital ones, under centralized governance enforced by legal and regulatory systems (Coase, 1937; Williamson, 1981). Blockchains also enable the production of digital goods, but in a distinct form that we refer to here as digital commodities. These include value transfer (Narayanan et al., 2016), computation and smart contracts (Buterin, 2013), decentralized storage (Wood, 2016b), decentralized finance (DeFi) services (Schär, 2021), and more recently AI inference (Rao, 2023). What distinguishes blockchains is not the nature of the goods but the mode of production: digital commodities are created, exchanged, and secured directly within a shared protocol, without the need for centralized control (Catalini and Gans, 2016; 2020).
Structurally, the two models differ fundamentally. A firm resembles a single planet, self-contained and governed by a board and management. A blockchain network is closer to a solar system: a distributed digital infrastructure in which many autonomous participants, including individuals, firms, and protocols, interoperate under shared, protocol-enforced rules (Davidson et al., 2018). In this sense, blockchains also share features with a stock index, which aggregates multiple firms into a rule-defined collective. The difference is that while an index depends on external institutions to define membership, weighting, and oversight (Malkiel, 2015), a blockchain internalizes these functions. Governance, ownership, monetary policy, and participation are enforced directly within the protocol through consensus, cryptography, and economic incentives (Narayanan et al., 2016; Biais et al., 2019; Cong et al., 2021; Saleh, 2021). Table 1 develops this contrast by comparing the firm as a planet and the blockchain as a solar system.
TABLE 1. Contrasting a bounded organization (Firm as a Planet) with an ecosystem architecture (Blockchain as a solar system).
| Dimension | Traditional firm (planet) | Blockchain network (solar system) |
|---|---|---|
| Governance | Centralized board, enforced by law | Protocol-enforced rules and consensus; coordination without centralized control |
| Ownership | Shares granting profit/asset claims | Tokens granting access, governance, and value rights |
| Operational control | Centralized decision-making | Distributed across autonomous participants |
| Value creation | Production and sale of goods or services | Provision of digital commodities such as payments, computation, storage, DeFi, or AI inference |
| Aggregation | One firm as a self-contained entity | Multi-actor ecosystem, closer to an index but self-governing |
| Interoperability | Limited, mediated through contracts and markets | High, within a shared protocol infrastructure |
| Enforcement | Law and regulatory oversight | Cryptography and economic incentives |
The astronomical analogy is intended to capture differences in structural organization (bounded entity versus multi-actor ecosystem), not to suggest any literal correspondence in governance mechanisms.
The comparison highlights that firms concentrate governance, ownership, and control within a bounded organizational structure (Coase, 1937; Williamson, 1981), whereas blockchains distribute these functions across a protocol-defined ecosystem (Narayanan et al., 2016; Davidson et al., 2018). While both are mechanisms for value creation, blockchains internalize enforcement, interoperability, and coordination in ways that firms cannot replicate without external institutions (Catalini and Gans, 2016; 2020; Biais et al., 2019; Saleh, 2021). This distinction is central to understanding why blockchain networks require a different architectural analysis: their ability to produce and secure digital commodities depends not on hierarchical authority but on the design of consensus, incentives, tokenomics, and network effects (Cong et al., 2021; Schär, 2021).
- Capability paradigms To make the architectural differences precise from the outset, we distinguish three capability paradigms. Single-capability blockchains deliver one narrowly defined service at consensus quality, typically censorship-resistant value transfer (for example, Bitcoin). Multi-capability blockchains deliver a bounded but programmable set of services inside a shared execution environment, enabling diverse applications via smart contracts (for example, Ethereum). Meta-capability blockchains are designed to coordinate open-ended and extensible service ecosystems, where new capability environments can be added and connected over time (for example, Bittensor subnets, Polkadot parachains, or Cosmos zones). Section 2 formalizes this taxonomy and the associated set-theoretic inclusion structure.
1.1 Transaction processing flow
A blockchain is more than a ledger of records. It is a distributed digital infrastructure for producing and exchanging digital commodities. These commodities are generated and transferred through transactions, validated and secured by consensus, and sustained through incentives and tokenomics. Network effects amplify these processes by increasing adoption, liquidity, interoperability, and composability across participants and applications. In this way, a blockchain functions as a self-contained mechanism of value creation, with rules enforced not by law but by cryptography, protocol code, and economic alignment (Narayanan et al., 2016; Catalini and Gans, 2016; Davidson et al., 2018).
This subsection provides a high-level overview of the transaction processing flow in a blockchain as an economic system. Later sections analyze the foundational design pillars (consensus, incentives, tokenomics, etc.) in greater detail.
1.1.1 Transactions as digital commodities
At the technical level, a blockchain is maintained by a network of independent nodes, each running the protocol software (typically open source) that connects them to the network, enforces consensus rules, and synchronizes the shared ledger. No single node can unilaterally manipulate the ledger, since changes require agreement from a majority of validating nodes, and each block must satisfy strict cryptographic and protocol conditions. Invalid transactions or blocks are rejected by honest participants, ensuring the integrity of the chain (Nakamoto, 2008; Narayanan et al., 2016; Biais et al., 2019; Garay et al., 2015; Saleh, 2021).
**Transaction.**
In blockchain systems, a transaction is a protocol-valid state transition that updates the shared ledger under the consensus rules. In account-based systems (e.g., Ethereum), it updates balances and contract state; in UTXO-based systems (UTXO = unspent transaction output), it consumes existing UTXOs and creates new outputs, updating the global UTXO set. Economically, transactions are the means by which digital commodities are created, transferred, or consumed (Narayanan et al., 2016).
This definition is architecture-agnostic: the ledger “state” may be represented as accounts and contract storage, or as the set of unspent transaction outputs.
Examples of transactions include:
- Value transfers: sending cryptocurrency from one address to another (e.g., Bitcoin payments).
- Smart contract execution: invoking program logic deployed on-chain (e.g., Ethereum decentralized applications (dApps)).
- Staking operations: locking tokens to secure the network or earn rewards (e.g., Proof-of-Stake systems).
- Governance actions: voting on protocol upgrades or parameter changes.
- Network-specific prompts: submitting and ranking machine learning tasks or outputs (e.g., Bittensor).
- Tokenization: creating digital representations of assets, rights, or data.
1.1.2 Consensus and incentives
Once created, transactions are broadcast to the network, validated by participating nodes, and grouped into blocks. Each block contains a cryptographic reference (hash) to the previous block, linking them into an immutable sequence of records, hence the term blockchain. Consensus mechanisms such as Proof-of-Work (PoW), Proof-of-Stake (PoS), or Proof-of-Intelligence (PoI) determine which node proposes the next block and how agreement is reached among participants (Nakamoto, 2008; King and Nadal, 2012; Buterin, 2022). PoW relies on computational effort, PoS on staked capital, and PoI on the provision of verifiable intelligence (e.g., Bittensor). Other variants, such as Proof-of-Authority (PoA) (POA Network, 2018) or Proof-of-History (PoH) (Yakovenko, 2018), adapt the same principle to different operational contexts.
In public, permissionless blockchains, participation in block production is sustained by protocol-defined rewards. Without these incentives, miners, validators, or other specialized participants would have little reason to commit computational, financial, or operational resources to secure the network.
Nodes that participate in block production receive rewards, typically in the form of newly issued tokens and transaction fees. These rewards provide the primary mechanism for motivating node operators to participate honestly, aligning their operational behavior with network security (Saleh, 2021; Schär, 2021).
1.1.3 Transaction flow
For an individual transaction, this process is linear (creation → confirmation), even though the network repeats the same flow continuously across transactions and blocks. As illustrated in Figure 1, a user-initiated transaction is created and broadcast to the network, validated by participating nodes, collected into candidate blocks, agreed upon through consensus (which selects one block), and appended to the shared ledger. The protocol simultaneously generates reward transactions, which compensate the participant responsible for the winning block. In PoW systems this participant is called a miner, while in PoS and related protocols it is a validator. In delegated or pooled staking schemes, rewards may also be shared with those who staked tokens to the winning validator. These mechanisms sustain block production and align participants’ incentives with honest behavior (Nakamoto, 2008; King and Nadal, 2012; Saleh, 2021; Schär, 2021). This process ensures that the ledger remains tamper-resistant, auditable, and synchronized without centralized control (Narayanan et al., 2016; Biais et al., 2019).

1.1.3.1 Takeaway
This lifecycle illustrates how blockchains substitute hierarchical control with protocol-defined processes that combine cryptography, consensus, and incentives. The next section reviews prior art that has attempted to conceptualize these dynamics, after which we develop our framework based on two complementary dimensions: capabilities, which capture what a blockchain can do, and pillars, which define how it is architected through purpose, incentives, consensus, tokenomics, and network effects.
1.2 Prior art
Research on blockchain systems spans economics, institutional analysis, and systems engineering. Early perspectives emphasized transaction cost economics and the relative roles of firms and markets in coordinating exchange (Coase, 1937; Williamson, 1981). In this tradition, blockchains have been framed as institutional technologies that shift elements of governance and enforcement from law and organizations into protocol rules (Catalini and Gans, 2016; Davidson et al., 2018).
Several works propose structured lenses for assessing blockchain applicability and design. From an engineering perspective, Xu et al. (2019) synthesize architectural requirements and design dimensions for blockchain applications. Gourisetti et al. (2020) introduce an applicability framework centered on decentralization, trust assumptions, and efficiency trade-offs.
Complementary streams focus on specific components, including token design and incentive structures (Cong et al., 2021; Saleh, 2021), consensus protocols (Nakamoto, 2008; Garay et al., 2015; King and Nadal, 2012; POA Network, 2018; Yakovenko, 2018), market equilibria and pricing dynamics (Biais et al., 2018), valuation and network effects (Pagnotta and Buraschi, 2018), and the economics of DeFi ecosystems (Schär, 2021).
A further stream studies security-budget and fee-market mechanics that govern long-run sustainability, including mining incentives under adversarial settings, the transition from block rewards to fees, and limits of security provision under competition and congestion (Kroll et al., 2013; Budish, 2018; Carlsten et al., 2016; Easley et al., 2019; Huberman et al., 2021). Related work in market microstructure shows how transaction ordering creates endogenous rent extraction and strategic behavior, including maximal extractable value (MEV), with implications for users, application design, and protocol rules (Daian et al., 2020; Roughgarden, 2020; Qin et al., 2021). On the architecture side, scalability and modularity research emphasizes layered designs and interoperability, highlighting the resulting composability trade-offs (Poon and Dryja, 2016; Al-Bassam, 2019; Zamyatin et al., 2019; Bonneau et al., 2015). Finally, empirical asset-pricing and adoption studies provide evidence on how network activity and risk premia relate to crypto valuations (Schilling and Uhlig, 2019; Liu and Tsyvinski, 2021; Howell et al., 2020; Yaga et al., 2018).
While these perspectives provide valuable insights, they typically treat blockchain either as a cost-reducing coordination mechanism or as a governance innovation, and often analyze components in isolation. By contrast, our approach centers the capability set of a blockchain, the concrete services it can deliver at consensus quality, and links capability breadth and complementarities to a valuation structure. We then show how this capability set is enabled and constrained by five architectural pillars, purpose, consensus, incentives, tokenomics, and network effects, providing a unified lens that connects protocol design choices to scaling dynamics and long-run sustainability.
1.3 Contributions
This paper makes four contributions to the study of blockchain architecture and valuation.
- It introduces a capability-based lens for analyzing blockchain systems. A blockchain is defined by the set of services it can reliably deliver at consensus quality, which we call its capabilities.
- It proposes a taxonomy of blockchains into single-capability, multi-capability, and meta-capability paradigms (Section 2). This classification highlights how systems differ in scope, composability, and potential for value creation.
- It develops a valuation framework that links network value to capability adoption, user base, and network effects (Section 3). This framework enables systematic comparison across the three paradigms introduced in the taxonomy.
- It explains how capabilities are enabled and constrained by five architectural pillars: purpose, consensus, incentives, tokenomics, and network effects. These pillars capture distinct but interdependent design dimensions that determine which capabilities can be realized in practice and how they scale.
Figure 2 illustrates the framework. Capabilities define what a blockchain can do, while the five pillars specify the architectural conditions that make those services feasible and scalable. The circular structure highlights their interdependence: capabilities are both outcomes of coordinated pillars and anchors that shape further design choices.

1.4 Interdependence of the five pillars
The five pillars are analytically distinct but operate as a coupled system: a capability set is feasible only if the pillars jointly support it, and changes in one pillar propagate to the others.
Purpose → consensus, incentives, tokenomics
Purpose fixes the service objective and therefore required security, latency, and throughput, which constrain viable consensus choices and the implied security budget (hence incentives and tokenomics).
Consensus ↔ incentives (security budget)
Consensus specifies what must be defended (finality, censorship resistance, reorg risk); incentives determine who defends it and at what cost (hashpower in PoW; staked capital and slashing risk in PoS). The protocol must finance this defense via issuance and fees.
Tokenomics ↔ incentives (financing and behavior)
Tokenomics defines the reward stream (issuance, fees, burns) and claim distribution; incentives translate these flows into effort and honesty constraints. Mispricing security (underpaying) or overburdening users (excessive fees) reduces participation and shrinks feasible capabilities.
Network effects → tokenomics and incentives (scale feedback)
Adoption can strengthen fee revenue and reduce reliance on issuance, but scale also introduces congestion and rent-extraction dynamics (e.g., Maximal Extractable Value (MEV) 1 ), requiring fee and role-incentive adjustments.
Incentives and network effects → purpose credibility
Purpose is a coordination device: sustained service quality reinforces the narrative; persistent failures lead users and developers to update beliefs and reallocate activity, reshaping the realized capability set.
Capabilities as outcome and constraint
Capabilities are enabled by the pillars, but expanding C X increases attack surface and operational complexity, tightening consensus requirements and raising incentive/tokenomic calibration demands.
Design implication
Architectural evaluation should therefore be conducted at the level of (capabilities, pillars) jointly, since pillar choices determine feasible capabilities and capability expansion feeds back into pillar requirements.
1.5 Paper structure and roadmap
The remainder of the paper proceeds in three steps. First, Section 2 defines blockchain capabilities and introduces the single-, multi-, and meta-capability taxonomy, formalizing what a blockchain can do. Second, Section 3 develops a capability-based valuation framework and derives comparative dominance results, clarifying why breadth and composability can generate superlinear scaling. Third, Sections 4–8 elaborate the five architectural pillars that determine how capability sets are made feasible and sustainable in practice. Section 9 concludes with implications for engineering management, digital infrastructure design, and policy.
2 Blockchain capabilities
A blockchain can be understood as a system designed to deliver a set of capabilities (services).
Capability.
In this paper, a capability refers to a distinct type of service that a blockchain can reliably deliver at consensus quality. Examples include value transfer (Bitcoin), execution of smart contracts (Ethereum), or incentivised provision of machine learning outputs (Bittensor). The capability set of a blockchain is the collection of such services it supports.
Having introduced the notion of a capability, we next classify blockchains according to the scope and extensibility of their capability sets. This taxonomy distinguishes between narrow, bounded, and open-ended systems, which correspond to three paradigms of blockchain design (see Figure 3).
Classification.
- Single-capability blockchains deliver one narrowly defined service at consensus quality. Their capability set essentially has a single element, such as censorship-resistant peer-to-peer payments in Bitcoin. Communication is predominantly point-to-point or point-to-multipoint, generating network effects that scale mainly with user adoption.
- Multi-capability blockchains support several distinct but predefined services, typically around programmable smart contracts. Their capability set is larger but bounded, yet within this environment new capabilities can emerge that were not foreseen at launch (e.g., decentralidzed finance (DeFi), non-fungible tokens (NFTs), decentralized autonomous organizations (DAOs)). Communication is many-to-many but structured, as smart contracts act as hubs that coordinate participants, giving rise to layered network effects across applications.
- Meta-capability blockchains are designed for open-ended and extensible services. Their capability set can expand toward the universal set F, since they enable coalitions of services or sub-networks (e.g., Bittensor subnets, Polkadot parachains, Cosmos zones) to define entirely new environments and functions beyond the base layer. Communication is heterogeneous and open-ended, spanning subnet-to-subnet and protocol-to-protocol interactions, which fosters compounding network effects across ecosystems.

Let F denote the universal set of capabilities that can be delivered on-chain at consensus quality. Examples include value transfer, computation, data storage, governance, and decentralised finance. A capability set C X ⊆ F for a blockchain X lists the specific services it can perform.
For the three paradigms introduced above, we define their capability sets in Equations 1–3:
C Single = value transfer , (1)
C Multi ⊆ value transfer , smart contract execution , tokenisation , … , (2)
C Meta ⊆ F . (3)
By construction, these satisfy the nested inclusion chain shown in Equation 4:as illustrated schematically in Figure 4.
C Single ⊆ C Multi ⊆ C Meta ⊆ F , (4)

Examples
- Single-capability: Bitcoin (BTC) (Nakamoto, 2008), Litecoin (LTC) (Lee, 2011), and Monero (XMR) (Van Saberhagen, 2013). These networks focus primarily on censorship-resistant peer-to-peer value transfer.
- Multi-capability: Ethereum (ETH) (Buterin, 2013), Solana (SOL) (Yakovenko, 2018), Cardano (ADA) (Kiayias et al., 2017). These provide general-purpose smart contract platforms that support diverse decentralized applications.
- Meta-capability: Bittensor (TAO) (Rao, 2023), Polkadot (DOT) (Wood, 2016b), Cosmos (ATOM) (Kwon, 2016), and Avalanche (AVAX) (Team Rocket, 2018). These enable multiple categories of digital services and support interoperability across service types and networks.
The classification into single, multi, and meta-capability blockchains highlights what services a network can provide. To evaluate the economic significance of these services, the next section develops a capability-based valuation framework. This framework translates capability sets into network value as a function of adoption, user base, and network effects.
Remark 1 (Astronomical Analogy). The taxonomy of blockchain capabilities can be illustrated through an astronomical metaphor. A firm resembles a planet, bounded and self-contained. A single-capability blockchain is akin to a solar system with one dominant star, sustaining a single orbit (e.g., peer-to-peer value transfer). A multi-capability blockchain is comparable to a star cluster, where diverse orbits coexist and interact (e.g., smart contracts, dApps, DeFi). Finally, a meta-capability blockchain resembles a galaxy: a collection of many star systems (subnets, parachains, zones) that interoperate, form coalitions, and generate new systems over time. This analogy highlights the inclusion chain:
Capabilities as both input and outcome
Capabilities serve a dual role in blockchain architecture. On the one hand, they act as design anchors, guiding both valuation and the formulation of the five architectural pillars. For example, a system intended only for value transfer will adopt simpler consensus and incentive structures than one designed for general-purpose computation. On the other hand, capabilities are also emergent outcomes of pillar design: once consensus, incentives, and tokenomics are instantiated, they shape which services are reliably feasible in practice. Thus, the declared capability set reflects the protocol’s intended function, while the realised capability set manifests through the coordinated operation of the architectural pillars.
Transition to valuation
The capability taxonomy identifies differences in architectural scope and extensibility, but it does not yet quantify their economic significance. The next section therefore introduces a capability-based valuation framework that maps capability sets into aggregate network value through adoption, per-unit service value, and interaction effects.
3 Capabilities-based valuation
The classification of blockchains into single-, multi-, and meta-capability paradigms highlights what services a system can provide. To assess their economic significance, we translate this perspective into a simple valuation framework. The framework expresses network value as the aggregate contribution of each capability, weighted by its adoption and amplified by network effects.
Let X be a blockchain with capability set C X and global user base u. Each capability f ∈ C X is adopted by a share a f ( u ) of users, giving it an effective user base
u f = a f u u , (5)
Let v f ( u f ) denote the economic value contributed by capability f when it is adopted by u f users (see Equation 5). We model this contribution aswhere φ f summarizes price, quality, and scarcity into a single constant, and N f ( u f ) is the network-effect multiplier that captures how the utility of capability f scales with its user base (for example linear, polynomial, or exponential). The units of v f are set by φ f (currency-equivalent or an index), while N f ( ⋅ ) is dimensionless.
v f u f = φ f ⏟ value - per - unit u f ⏟ capability - specific user base N f u f ⏟ network - effect multiplier , (6)
The total network value of blockchain X with global user base u is denoted by V X ( u ). We model it aswhere the first term aggregates stand-alone capability contributions and the second term captures complementarities across capabilities. Here η f g ≥ 0 is a dimensionless parameter capturing the strength of complementarity between capabilities f and g, with the sum taken over all unordered pairs of distinct capabilities ( f , g ). V 0 ( u ) > 0 is a normalization scale with units of value, introduced to keep V X ( u ) dimensionally consistent. 2 In the symmetric benchmark environments used below, we set V 0 ( u ) = φ u N ( u ) so that the bracketed contribution of the composability term depends only on capability count. The notation f < g indexes unordered pairs under an arbitrary but fixed ordering of C X. For example, DeFi protocols leverage both value transfer and smart contract execution, creating positive composability effects.
V X u = ∑ f ∈ C X v f u f ⏟ direct contributions + ∑ f < g η f g v f u f v g u g V 0 u ⏟ composability effects , (7)
The multiplicative form of the composability term reflects that complementarities arise only when both capabilities are present at scale. An additive formulation would simply duplicate their stand-alone contributions, while a bilinear term v f ( u f ) v g ( u g ) expresses that joint adoption enables new services whose value expands with the product of their respective scales. This approach parallels established models of complementarities in economics, where interactions between inputs are represented through multiplicative structures, such as in Cobb–Douglas production functions (Cobb and Douglas, 1928), supermodular utility and production systems (Topkis, 1998; Milgrom and Roberts, 1990), and network externality models where cross-effects scale with joint participation (Farrell and Klemperer, 2007; Katona and Sarvary, 2008). In this sense, the bilinear term formalizes how blockchain capabilities reinforce one another, turning individual services into composable digital ecosystems.
Special cases
We specialize Equation 7 to the three blockchain paradigms introduced earlier: single-capability (e.g., Bitcoin, Litecoin), multi-capability (e.g., Ethereum, Solana), and meta-capability networks (e.g., Bittensor, Polkadot). For each paradigm P ∈ { single , multi , meta }, let C P denote its capability set andthe number of distinct capabilities it contains. By construction,
K P ≔ | C P |
C single ⊆ C multi ⊆ C meta , K meta ≥ K multi ≥ 1 .
Pairwise complementarities are captured by η f g P ≥ 0, where we assume η f g meta ≥ η f g multi for all pairs ( f , g ) common to both sets. This reflects the intuition that meta-capability blockchains, by design, embed richer forms of composability than multi-capability networks, while single-capability systems have no cross-term complementarities. This yields the specific value expressions for single-capability (Equation 8), multi-capability (Equation 9), and metacapability (Equation 10) networks:
V single u = v transfer u . (8)
V multi u = ∑ f ∈ C multi v f u f + ∑ f < g f , g ∈ C multi η f g multi v f u f v g u g V 0 u . (9)
V meta u = ∑ f ∈ C meta v f u f + ∑ f < g f , g ∈ C meta η f g meta v f u f v g u g V 0 u . (10)
By construction, meta-capability networks can host more services (larger C meta) and support stronger pairwise complementarities ( η f g meta ≥ η f g multi ), which together raise V meta ( u ) relative to V multi ( u ) and V single ( u ) under the same adoption level u.
3.1 Limiting cases and dominance results
To highlight the relative strengths of single-, multi-, and meta-capability paradigms, we consider two stylized benchmarks. Each benchmark strips away secondary effects to isolate the drivers of aggregate value: capability count, complementarities, and network-effect strength. Together, they establish a clean foundation for later architectural analysis.
3.1.1 Benchmark 1: no composability, full adoption
We begin with the most minimal environment, where capabilities neither reinforce nor interact with one another. Three simplifying assumptions apply:
- Zero composability: η f g = 0 for all f ≠ g.
- Full adoption: a f ( u ) = 1, so each capability scales with the full user base u f = u.
- Identical per-unit value: φ f = φ > 0 for all capabilities.
Let K X = | C X | denote the number of capabilities in network X. Each paradigm P ∈ { single , multi , meta } shares a network-effect function N P ( u ).
Under these assumptions, capability value collapses to the simple forms shown in Equations 11–13:
V single u = φ u N single u , (11)
V multi u = φ u K multi N multi u , (12)
V meta u = φ u K meta N meta u . (13)
Here, value grows proportionally with the number of capabilities and the strength of network effects.
Limiting Dominance.
Statement. Fix u ≥ u 0 > 0. Ifwith at least one inequality strict, then
K meta ≥ K multi ≥ 1 , N meta u ≥ N multi u ≥ N single u ,
V meta u > V multi u > V single u .
Proof. All terms φ and u are positive and common across paradigms. Relative values are therefore ordered by the products of K ⋅ and N ⋅ ( u ), with strict inequality whenever one factor is strictly larger.
Interpretation
This benchmark delivers two key insights:
- If all paradigms share the same scaling function N ( u ), the ranking reduces to capability counts: more services imply more value.
- If higher paradigms also enjoy stronger scaling (e.g. exponential vs. polynomial N ( ⋅ )), their dominance becomes more pronounced as user bases expand.
- Introducing nonnegative composability ( η f g ≥ 0 ) would only reinforce these results by amplifying complementarities.
Benchmark 1 shows that, even without synergies, paradigms with broader scope and stronger network effects dominate. This benchmark is conservative, as it treats services as independent and ignores the reinforcing interactions typically present in real systems. Benchmark 2 relaxes this assumption by introducing complementarities between capabilities, allowing us to see how value scales once interactions are taken into account.
3.1.2 Benchmark 2: scaling with capability count K
The first benchmark ignored complementarities, but in practice capabilities rarely exist in isolation. To capture this, we now allow for fixed pairwise complementarities within each paradigm.
We maintain simplicity while introducing interaction:
- Full adoption: a f ( u ) = 1.
- Identical per-unit value: φ f = φ > 0.
- Common network-effect multiplier N ( u ) > 0 across paradigms.
- Constant pairwise complementarities within each paradigm:
η f g P ≡ η P ≥ 0 , P ∈ multi , meta .
| Quadratic Scaling with Pairwise Complementarities.
Statement. Let K P = | C P | be the number of capabilities in paradigm P. Assume full adoption a f ( u ) = 1, identical per-unit value φ f = φ > 0, a common network-effect multiplier N ( u ) > 0, and constant pairwise complementarities within each paradigm,In addition, set the normalization scale in Equation 7 toThen the aggregate value satisfiesThis yields the special cases for each paradigm, as detailed in Equations 15-17:
η f g P ≡ η P ≥ 0 , P ∈ multi , meta .
V 0 u = φ u N u .
V P u = φ u N u K P + η P K P K P − 1 2 , P ∈ multi , meta . (14)
V single u = φ u N u , (15)
V multi u = φ u N u K multi + η multi K multi K multi − 1 2 , (16)
V meta u = φ u N u K meta + η meta K meta K meta − 1 2 . (17)
Proof
Under full adoption, u f = u for all f, hence Equation 6 implies a common per-capability contribution
v f = φ u N u .
For a paradigm P with K P capabilities, the direct component in Equation 7 is
∑ f ∈ C P v f = K P v f .
There are K P 2 unordered capability pairs. With constant complementarities η f g P ≡ η P and normalization V 0 ( u ) = v f, the composability component is
∑ f < g η P v f v g V 0 u = η P v f 2 v f K P 2 = η P v f K P 2 .
Adding the two components yieldswhich is Equation 14.
V P u = v f K P + η P K P 2 = φ u N u K P + η P K P K P − 1 2 ,
Asymptotic Dominance and Growth-Rate Conditions.
Assume η multi > 0 and η meta > 0. If K multi → ∞ and K meta → ∞ withthen the quadratic terms dominate and
K meta K multi → λ ∈ 0 , ∞ ,
lim K → ∞ V meta u V multi u = η meta η multi λ 2 .
In particular, if K meta = K multi asymptotically ( λ = 1 ), the limiting ratio equals η meta / η multi.
Moreover, if K meta / K multi → ∞ (meta capability breadth grows strictly faster), then
lim K → ∞ V meta u V multi u = ∞ .
A separate sufficient condition for divergence is η multi = 0 with η meta > 0, in which case V multi ( u ) is asymptotically linear in K multi while V meta ( u ) is quadratic in K meta.
Remark
This result formalizes why broader paradigms with stronger complementarities enjoy a structural advantage: as ecosystems scale, meta-capability systems not only accumulate more functions but also amplify their value through reinforcing interactions.
Properties
Two immediate implications follow:
- For any η P ≥ 0, value V P ( u ) grows strictly faster with K P than in the no-composability case.
- If η meta > η multi and K meta ≥ K multi, then meta necessarily dominates multi, with strict inequality whenever either factor is stronger.
Illustration
For concreteness, set φ = 1 and N ( u ) = 1 so that differences arise purely from complementarities. We choose η multi = 0.5 and η meta = 0.75 to reflect that multi-capability blockchains exhibit moderate complementarities (e.g., between payments and smart contracts), whereas meta-capability blockchains embed stronger systemic synergies (e.g., interoperability across heterogeneous service markets). The values 0.5 and 0.75 are not empirical estimates but stylized parameters chosen to highlight the relative strength of cross-capability reinforcement. Under these assumptions, quadratic growth in K takes the form shown in Equations 18, 19:
V multi u = K multi + 0.5 K multi K multi − 1 2 , (18)
V meta u = K meta + 0.75 K meta K meta − 1 2 . (19)
Figure 5 visualizes these expressions, showing how value V ( u ) scales with capability count K under different paradigms. As the figure illustrates, meta-capability systems dominate asymptotically due to stronger quadratic amplification, while multi-capability systems maintain a structural advantage over single-capability ones.

Empirical anchoring
While η is introduced as a stylized complementarity parameter, it admits operational proxies in public blockchain data. For multi-capability platforms, interaction intensity can be approximated using cross-contract call graphs, multi-protocol transaction shares, and shared-liquidity measures (e.g., routing through decentralized exchanges, lending pools, and stablecoin rails). For meta-capability architectures, analogous proxies include cross-subnet or cross-zone traffic, bridging and interoperability flows, and measured co-usage across distinct service markets. These observables provide concrete inputs for estimating whether higher interaction intensity is associated with higher realized network value, consistent with Equation 14.
Takeaway
Once complementarities are present ( η P > 0 ), value grows faster than linearly in K. Meta-capability systems, with higher K and stronger η, enjoy quadratic growth advantages over multi-capability systems. This reinforces the earlier dominance result: broader, more interconnected paradigms are structurally advantaged.
Interpreted in practice, Bitcoin’s persistent dominance is less about capability variety ( K = 1 ) and more about its vast global user base u and high per-unit value φ for the store/transfer of value function.
Ethereum illustrates the multi-capability case, where composability across payments, smart contracts, and DeFi generates synergies ( η multi > 0 ).
Emerging meta-capability systems such as Bittensor (TAO) push this logic further by enabling interoperability across heterogeneous service markets, suggesting even stronger quadratic gains as K and η both rise.
In summary, these limiting cases show how capability sets translate into aggregate value through adoption, user base, and network effects. The next section turns to the five architectural pillars, Purpose, Consensus, Incentives, Tokenomics, and Network Effects, that determine whether such capability sets can be realized and sustained.
3.2 Empirical pathways and falsifiability
Although the paper is conceptual, its core claims yield empirically assessable implications. Accordingly, we outline how future work could operationalize the framework and what evidence would be consistent (or inconsistent) with its organizing assumptions. This subsection is not an empirical study and does not report estimated parameters.
Operationalization (conceptual proxies)
A practical research design could map each network X to: (i) a capability breadth measure K X, (ii) interaction or composability proxies that summarize complementarities, and (iii) observable adoption and usage measures. Candidate proxies include:
- Adoption and activity (u, u f): active addresses, transaction counts, fee-paying users, gas consumed, and application usage by capability category (payments, DeFi, storage, AI tasks).
- Capability breadth ( K X ): counts of distinct service categories supported at consensus quality, complemented (for modular architectures) by counts of active units such as protocols, standards, subnets/parachains/zones that exceed a minimum activity threshold.
- Composability/complementarities ( η ): cross-capability interaction intensity, for example co-usage rates across categories, cross-contract call graphs, shared-liquidity and bridging flows, or the share of activity involving at least two capability categories.
- Network value ( V X ): market capitalization or fully diluted valuation, supplemented by usage-based value proxies (fee revenue, burned fees where applicable, and other protocol-level revenue measures).
Data sources and analysis tools (implementation pathway)
All measures above can be constructed from publicly available sources. A typical workflow would combine: (i) on-chain data from block explorers or archival nodes, (ii) standardized datasets and dashboards from established analytics providers and aggregators (e.g., Coin Metrics, Token Terminal, DeFiLlama, Dune), and (iii) protocol documentation and repositories to support a transparent capability taxonomy and module mapping. The analysis is implementable with standard research tooling (Python for ingestion, panel construction, and graph analytics; R or Stata for statistical modeling; and network-analysis libraries for interaction measures). This paper does not execute such a workflow, but the pathway is included to clarify testability.
Testable hypotheses implied by the framework
The dominance logic in Section 3 implies predictions such as:
- Breadth effect: holding adoption fixed, V X is increasing in K X.
- Complementarity effect: holding K X and adoption fixed, V X is increasing in interaction/composability proxies.
- Superlinear implication: the marginal association between K X and V X is stronger when composability proxies are higher, consistent with the quadratic term in Equation 14.
Falsification conditions
The framework would be challenged if, across a broad sample and reasonable proxy choices, (i) V X is not increasing in K X after controlling for adoption and activity, or (ii) measured interaction intensity is not positively associated with V X (or is systematically negative), contradicting η f g ≥ 0 as an organizing approximation. A further falsification case would be evidence that meta-capability architectures do not exhibit higher interaction intensity than multi-capability systems, undermining the mechanism motivating η meta ≥ η multi.
3.3 Limitations of the valuation model
The valuation framework of Section 3 is intentionally stylized. It is designed to organize how capability breadth, adoption, and cross-capability interactions can map into network value, not to deliver point estimates.
Proxy dependence
Key objects in Equation 7 are not directly observable. Capability breadth K X depends on the chosen taxonomy and activity thresholds, while complementarities η f g and network-effect multipliers N f ( ⋅ ) require empirical proxies (for example, cross-contract calls, shared liquidity, or cross-subnet flows). Per-unit values φ f and adoption shares a f ( u ) are context-specific and may vary across time and market regimes.
Scope conditions and trade-offs
The dominance results rely on symmetric benchmark assumptions. In practice, a narrower system can dominate if it has materially higher adoption or higher per-unit service value, and higher interaction intensity can also increase congestion, attack surface, or contagion risk (e.g., bridges, oracles, shared-liquidity dependencies). Capability breadth is therefore not equivalent to capability quality: expanding K X can tighten pillar requirements and reduce the realized capability set if design and governance do not scale.
Transition to pillars
The valuation results show why broader capability sets and stronger cross-capability interactions can create structural advantages as ecosystems scale. Whether these advantages materialize, however, depends on architectural feasibility and sustainability. Accordingly, we now turn to the five pillars that jointly determine which capability sets can be realized in practice and how they evolve with adoption.
4 Purpose
Pillars as feasibility constraints
Having shown how capability breadth and interactions can scale value, we now turn to the architectural conditions that make those capability sets feasible in practice. In the remainder of the paper, each pillar is treated as a constraint on the realized capability set. Purpose anchors the intended scope; consensus, together with incentives, finances and enforces reliability; tokenomics governs scarcity and resource pricing; and network effects determine how adoption feeds back into sustainability.
The first architectural pillar is purpose. Having established that value depends on the breadth and interconnection of a blockchain’s capability set, we now ask: what determines which capabilities a protocol is built to support? Purpose provides this anchor. It defines both the domain a blockchain seeks to serve (monetary transfer, programmable logic, coordination of services) and the narrative through which it justifies its design to users, developers, and investors. In this sense, purpose is not only a technical boundary but also a socio-economic commitment that shapes expectations and adoption.
A further implication is that composability follows directly from purpose. When the declared purpose is narrowly scoped, as in payment-focused systems, composability is unnecessary. As purpose broadens toward general programmability, composability becomes essential to allow decentralized applications to interoperate on shared state. In meta-capability systems, where the purpose is to coordinate heterogeneous services, composability generalizes to cross-chain or cross-domain interoperability. Thus, composability is not an independent architectural pillar but a design consequence of how broad a protocol’s purpose is.
Across the evolution of blockchain systems, purpose has guided the transition from narrowly defined monetary networks to programmable platforms and, more recently, to open coordination layers for heterogeneous service markets. This trajectory yields three paradigms that align with our earlier classification of capability sets:
- Single-capability systems, whose purpose is to deliver one core function with maximum reliability and security.
- Multi-capability systems, designed as general-purpose computational platforms that extend programmability to diverse applications.
- Meta-capability systems, whose purpose is to orchestrate marketplaces of services and enable interoperability across heterogeneous domains.
Table 2 summarizes these three paradigms, their representative examples, core purpose, and architectural focus. Representative projects are well documented in the literature (e.g., Bitcoin (Nakamoto, 2008); Litecoin (Lee, 2011); Monero (Van Saberhagen, 2013); Zcash (Hopwood et al., 2016); Ethereum (Buterin, 2013); Solana (Yakovenko, 2018); Cardano (Kiayias et al., 2017); Avalanche (Team Rocket, 2018); Polkadot (Wood, 2016b); Cosmos (Kwon, 2016); Bittensor (Rao, 2023)). The subsections that follow elaborate each case in greater detail.
TABLE 2. Purpose across blockchain paradigms.
| Paradigm | Examples | Core purpose | Architectural focus |
|---|---|---|---|
| Single-capability | Bitcoin, Litecoin, Monero, Zcash | Peer-to-peer value transfer | Proof-of-work, fixed supply, transparency, reliability in one service |
| Multi-capability | Ethereum, Solana, Cardano | Programmability of applications and finance | Smart contracts, composability, dApps, stablecoins, tokenized assets |
| Meta-capability | Bittensor, Polkadot, Cosmos, Avalanche | Coordination of heterogeneous services | Interoperability, service markets, subnets/parachains, proof-of-intelligence (Bittensor) |
Single-capability blockchains
Single-capability blockchains pursue a narrowly scoped purpose. Bitcoin is the archetype, created to enable censorship-resistant value transfer without reliance on intermediaries (Nakamoto, 2008). Other examples such as Litecoin (Lee, 2011), Monero (Van Saberhagen, 2013), and Zcash (Hopwood et al., 2016) similarly restrict themselves to payments, sometimes with enhanced privacy features. Architecturally, these networks combine proof of work consensus, predictable monetary issuance, and a transparent ledger. They prioritize security and decentralization at the expense of throughput. Their defining purpose is monetary sovereignty, achieved through scarcity enforcement and minimization of trust in external institutions (Narayanan et al., 2016; Biais et al., 2019).
Multi-capability blockchains
Multi-capability blockchains broaden purpose to programmability. Ethereum (Buterin, 2013), Solana (Yakovenko, 2018), Cardano (Kiayias et al., 2017) exemplify this paradigm, enabling smart contracts that support dApps. Here the purpose is not just transferring value but embedding arbitrary logic into the ledger, transforming blockchains into global execution environments (Schär, 2021).
This shift opens a wide range of services, including DeFi protocols, NFT marketplaces, decentralized exchanges, blockchain-based games, and tokenized real-world assets (RWAs). A notable application is the issuance of stablecoins, which maintain parity to fiat or commodities through collateral management and algorithmic mechanisms (Klages-Mundt et al., 2020; Klages-Mundt and Minca, 2019; 2022). Programmability therefore becomes the central architectural aim, with tokenomics and consensus mechanisms adapted to sustain diverse and composable applications.
Meta-capability blockchains
Meta-capability blockchains extend purpose beyond applications to the coordination of markets. Their goal is to provide a substrate where heterogeneous services can coexist and interact under a shared framework. Polkadot (Wood, 2016b) and Cosmos (Kwon, 2016), and Avalanche (Team Rocket, 2018) illustrate this logic at the level of chain interoperability, connecting specialized blockchains through relay or hub mechanisms. Bittensor (Rao, 2023) extends this logic to digital services, where subnets specialize in verifiable commodities such as machine learning outputs. Participants contribute, validate, and monetize these services directly within the protocol, turning the blockchain into a coordination substrate for marketplaces of machine intelligence. The mechanisms that make such coordination reliable are examined in Section 5.
In this design, the blockchain no longer just records transfers or executes contracts but coordinates an evolving marketplace of digital capabilities. This illustrates the broader trajectory of meta-capability systems: from securing financial transactions, to enabling programmable logic, to orchestrating complex digital work across domains.
In summary, purpose is the architectural pillar that defines a protocol’s functional horizon. It anchors the capability set that valuation ultimately acts upon and at the same time shapes the design space of consensus, incentives, tokenomics, and network effects.
5 Consensus
Consensus mechanisms enable nodes to agree on the state of the blockchain despite network latency and adversarial behavior (Buterin, 2022; Saleh, 2021). Their design determines scalability, finality, energy use, and security guarantees. Table 3 provides an overview of dominant mechanisms across paradigms, while Figure 6 illustrates their evolutionary trajectory. Representative projects and mechanisms are well documented in the literature (e.g., Bitcoin (Nakamoto, 2008); Litecoin (Lee, 2011); Monero (Van Saberhagen, 2013); Zcash (Hopwood et al., 2016); Ethereum (Buterin, 2013); Solana (Yakovenko, 2018); Cardano (Kiayias et al., 2017); Avalanche (Team Rocket, 2018); Algorand (Gilad et al., 2017); Polkadot (Wood, 2016b); Cosmos (Kwon, 2016); Bittensor (Rao, 2023); Internet Computer (Andreessen, 2021)).
TABLE 3. Consensus mechanisms across blockchain paradigms.
| Paradigm | Examples | Dominant mechanisms | Consensus characteristics |
|---|---|---|---|
| Single-capability | Bitcoin, Litecoin, Monero, Zcash | Proof-of-work (PoW) | Security through computational effort; strong censorship resistance; limited throughput; high energy cost |
| Multi-capability | Ethereum, Solana, Cardano, Algorand | Proof-of-stake (PoS); proof-of-history (PoH, Solana); proof-of-authority (PoA) | Consensus integrates block creation with resource pricing and contract execution; optimizes scalability, efficiency, and diversity of applications |
| Meta-capability | Bittensor, Polkadot, Cosmos, Internet computer, Avalanche | Base-layer PoS or PoA; task-specific consensus (e.g., proof-of-intelligence in Bittensor) | Layered design: Global ledger secured by PoS or PoA; specialised markets apply domain-specific validation; balances general security with task-level logic |
In Bittensor, Proof-of-Authority governs subnet registration and validator selection, while Proof-of-Intelligence ranks outputs and distributes rewards within subnets.

5.1 Single-capability blockchains
In single-capability blockchains such as Bitcoin, Litecoin, Monero, and Zcash, consensus is secured through Proof-of-Work (PoW) (Nakamoto, 2008). Participants, called miners, expend computational effort to solve cryptographic puzzles, with the first to succeed proposing the next block and earning rewards. PoW provides robust censorship resistance and high security, but throughput is limited and energy consumption is high. These characteristics make PoW the defining mechanism of the single-capability paradigm.
5.2 Multi-capability blockchains
In multi-capability blockchains such as Ethereum, Solana, or Cardano, consensus mechanisms are adapted to support general-purpose computation and smart contracts. Proof-of-Stake (PoS) (King and Nadal, 2012) has emerged as the dominant design, replacing computational expenditure with staked capital as the security anchor. Variants such as Solana’s Proof-of-History (PoH) (Yakovenko, 2018) add cryptographic ordering to increase throughput, while Proof-of-Authority (PoA) (POA Network, 2018) is often employed in sidechains or permissioned environments. Together, these mechanisms aim to balance decentralization, speed, and resource efficiency while maintaining security for application-level execution.
5.3 Meta-capability blockchains
Consensus in meta-capability blockchains operates across multiple layers. At the base layer, mechanisms such as proof-of-stake (Kwon, 2016; Wood, 2016b) or proof-of-authority (Wang et al., 2018; Ribeiro da Silva and Angelis, 2019) secure the ledger and manage the registration of subnets or parachains. At higher layers, specialized mechanisms validate services unique to each domain, such as Proof-of-Intelligence in Bittensor (Rao, 2023).
Bittensor illustrates this dual structure. Subnet registration is governed by a proof-of-authority model, while the quality of machine learning outputs is assessed through Proof-of-Intelligence (PoI). Validators score and weight the relative usefulness of model responses, with rewards distributed accordingly. This layered design aligns general ledger security with domain-specific evaluation, enabling reliable marketplaces for digital services.
Consensus provides the foundation of trust that makes capability sets reliable. Its security and efficiency, however, are only part of the story. The wider economic impact of consensus becomes evident when adoption feeds back into system value through network effects (Section 8).
6 Incentives
Incentive mechanisms align participant behavior with protocol goals (Gans, 2019; Cong et al., 2021). They explain why rational agents contribute computation, capital, bandwidth, or data. Incentives usually combine rewards for desirable behavior with penalties for actions that threaten security or reliability. Figure 7 provides an overview of how incentives accumulate across paradigms, and Table 4 summarizes the main mechanisms and principles. Representative examples include Bitcoin (Nakamoto, 2008), Litecoin (Lee, 2011), Monero (Van Saberhagen, 2013), Ethereum (Buterin, 2013), Solana (Yakovenko, 2018), Cardano (Kiayias et al., 2017), Avalanche (Team Rocket, 2018), Bittensor (Rao, 2023), Polkadot (Wood, 2016b), Cosmos (Kwon, 2016), and Internet Computer (ICP) (Andreessen, 2021).

TABLE 4. Incentive structures across blockchain paradigms (each layer inherits and extends the previous one).
| Paradigm | Examples | Primary incentives | Economic principle |
|---|---|---|---|
| Single-capability | Bitcoin, Litecoin, Monero | Block rewards; transaction fees | Scarce block space priced by fees. Issuance dominates early, fees later |
| Multi-capability | Ethereum, Solana, Cardano | Inherits: block rewards, transaction fees → generalized as gas; Extends: Staking rewards; role-specific fees (oracles, relayers) | Gas fees scale with resource use and demand. Incentives balance diverse actors while preventing congestion |
| Meta-capability | Bittensor, Polkadot, Cosmos, ICP, Avalanche | Inherits: block rewards, gas, staking; Extends: Task-specific rewards in service markets | Market-level fees reward verifiable outputs. Requires alignment between base-layer security and market-level incentives |
6.1 Single-capability blockchains
In single-capability blockchains such as Bitcoin, Litecoin, or Monero, incentives are relatively simple. The main mechanism is the block reward, issued in the native token to the miner who appends the next block (Nakamoto, 2008; Lee, 2011; Van Saberhagen, 2013). Users also pay transaction fees for inclusion, compensating miners for scarce block space (Eyal, 2015). Block rewards dominate in early stages due to issuance schedules, while over time fees are expected to sustain security (Huberman et al., 2021).
6.2 Multi-capability blockchains
Multi-capability blockchains such as Ethereum, Solana, Cardano, or Avalanche inherit the block reward and fee structure of single-capability systems, but extend it to coordinate a wider range of actors. Here, transaction fees are generalized into a gas mechanism that prices computation and storage (Buterin, 2013; Yakovenko, 2018). Gas fees scale with resource use and demand (Saleh, 2021). Validators receive staking rewards for securing the network, while specialised roles such as oracle operators 3 or bridge relayers 4 can earn additional fees. Staking systems often allow delegation, where token holders share in validator rewards while distributing trust (Li et al., 2020). The design challenge is to balance gas pricing, staking returns, and role incentives in order to prevent congestion, limit centralisation, and remain sustainable.
6.3 Meta-capability blockchains
Meta-capability blockchains such as Bittensor, Polkadot, or Cosmos inherit the incentive layers of multi-capability systems, but introduce an additional layer of task-specific rewards. At the base layer, staking rewards and penalties secure the ledger (Wood, 2016b; Kwon, 2016). Above this, each service market defines rewards distributed algorithmically by contribution quality, such as Proof-of-Intelligence scoring in Bittensor (Rao, 2023). These market-level payments resemble gas fees but are scoped to verifiable outputs, completed computations, or other measurable contributions. The multi-layer design allows diverse digital commodities to coexist within a single token economy, but requires calibration to ensure that base-layer security and market-level incentives remain aligned (Xu et al., 2019).
Incentives align individual behavior with protocol-level goals, ensuring that the system sustains itself over time. Their true economic significance becomes evident when growing participation magnifies effects through network effects (Section 8) (Evans, 2003; Gans, 2019).
7 Tokenomics
Tokenomics is the monetary operating system of a blockchain. It encodes how digital assets are created, distributed, and consumed, thereby translating protocol design into economic behavior (Cong et al., 2021). Unlike discretionary monetary policy, tokenomics is enforced by code and consensus, making credibility a function of protocol rules rather than trusted authorities (Saleh, 2021).
7.1 Design parameters
Key parameters of tokenomics determine both scarcity and incentives:
- Supply schedule: issuance may be fixed (Bitcoin), inflationary (Dogecoin), or adaptive/deflationary (Ethereum post-EIP-1559) (Buterin et al., 2019; Wood, 2016a).
- Distribution model: assets may enter circulation via mining, staking, airdrops, or direct sales (Fisch, 2019), shaping initial ownership and decentralization.
- Burn mechanisms: tokens can be permanently removed to counter inflation or stabilize scarcity (Huberman et al., 2021).
- Utility: tokens grant functional rights such as paying transaction fees, accessing computation and storage, participating in governance, or securing the protocol through staking (Harvey et al., 2021).
- Stability and reflexivity: predictable rules (e.g., Bitcoin halving) enhance credibility (Biais et al., 2018), while discretionary or ad hoc changes undermine expectations.
Together, these parameters define the economic grammar of a protocol: they specify who is rewarded, how resources are priced, and how scarcity is maintained. Well-designed tokenomics sustain participation, prevent congestion, and ensure the system remains self-financing as block rewards diminish over time.
7.1.1 Coins and tokens across paradigms
A central distinction is between coins and tokens, which correspond to different architectural layers:
- Coins are native assets of the base protocol (Layer 1). They secure consensus, pay transaction fees, and anchor scarcity.
- Tokens are issued assets within the system, typically via smart contracts or subnet logic. They inherit the security of the base coin while expanding functionality to applications, governance, or service markets (Harvey et al., 2021).
Table 5 summarises how the distinction between coins and tokens manifests across the three blockchain paradigms. Representative examples include Bitcoin (BTC) (Nakamoto, 2008), Litecoin (LTC) (Lee, 2011), Monero (XMR) (Van Saberhagen, 2013), Ethereum (ETH) (Buterin, 2013), Solana (SOL) (Yakovenko, 2018), Polkadot (DOT) (Wood, 2016b), Cosmos (ATOM) (Kwon, 2016), and Bittensor (TAO) (Rao, 2023).
TABLE 5. Coins vs. tokens across blockchain paradigms.
| Paradigm | Native coin | Tokens | Examples |
|---|---|---|---|
| Single-capability | Yes: Secures base protocol, used for payments | Absent: no higher-layer token standards | Bitcoin (BTC), Litecoin (LTC), Monero (XMR) |
| Multi-capability | Yes: pays gas fees, anchors consensus and scarcity | Yes: Issued via smart contracts (ERC-20, ERC-721, etc.) for DeFi, governance, NFTs | Ethereum (ETH + USDC, UNI), Solana (SOL + SRM) |
| Meta-capability | Yes: Secures base layer and coordinates cross-service activity | Yes: Service- or subnet-specific tokens within ecosystem | Polkadot (DOT + parachain tokens), Cosmos (ATOM + zone tokens), Bittensor (TAO + subnet credits) |
Tokenomics therefore enforces monetary discipline and defines access rights to protocol resources. As adoption scales, monetary rules interact with participation growth, creating nonlinear dynamics, for example, price-hashrate spirals where miners’ investment and asset valuation mutually reinforce each other (Pagnotta and Buraschi, 2018).
8 Network effects
The scalability of blockchain value depends critically on network effects, which determine how the addition of new users translates into aggregate system value. Three canonical laws describe distinct scaling logics:
- Sarnoff’s Law (linear): V ( u ) ∝ u. Each additional user adds value through one-way reach, as in broadcast networks (Katz and Shapiro, 1985).
- Metcalfe’s Law (quadratic): V ( u ) ∝ u 2. Value grows with the number of bilateral links, characteristic of peer-to-peer payment networks and early smart contract platforms (Metcalfe, 2013; Katz and Shapiro, 1994).
- Reed’s Law (exponential): V ( u ) ∝ 2 u. Value arises from subgroup formation and coalition-building, particularly relevant for composable ecosystems and meta-capability protocols (Reed, 1999).
Figure 8 illustrates these scaling regimes, while Table 6 situates them within blockchain paradigms and draws on prior work to associate blockchain paradigms with scaling laws (Nakamoto, 2008; Lee, 2011; Van Saberhagen, 2013; Metcalfe, 2013; Katz and Shapiro, 1985; 1994; Huberman et al., 2021; Buterin, 2013; Yakovenko, 2018; Team Rocket, 2018; Kiayias et al., 2017; Reed, 1999; Schär, 2021; Catalini and Gans, 2020; Buterin et al., 2019; Rao, 2023; Wood, 2016b; Kwon, 2016).

TABLE 6. Architectural network effects across blockchain paradigms.
| Paradigm | Examples | Dominant scaling law | Architectural mechanism |
|---|---|---|---|
| Single-capability | Bitcoin, Litecoin, Monero | Metcalfe (quadratic) with Sarnoff elements | Peer-to-peer payments; each user enlarges the transaction web; liquidity and connectivity deepen with user base |
| Multi-capability | Ethereum, Solana, Cardano | Metcalfe → Reed | Smart contracts and composability (DeFi, non-fungible tokens (NFTs), Layer-2 protocols (L2s)) create subgroup effects and developer–user feedback loops; EIP-1559 ties usage to token scarcity via fee burns |
| Meta-capability | Bittensor (TAO), Polkadot, Cosmos, Avalanche | Reed (exponential) | Coalition-forming design; subnets/parachains/zones enable interoperable clusters and subgroup dynamics by construction |
Empirical interpretation
The scaling regimes in Figure 8 should be interpreted as testable approximations. In practice, one can examine whether network value proxies (e.g., market capitalization, fee revenue, or composite activity indices) scale with adoption proxies (e.g., active addresses, transaction counts, or application users) in a manner consistent with linear, quadratic, or superlinear growth. Further, the transition from Metcalfe-like to Reed-like behavior can be proxied by increases in subgroup formation and interaction intensity, such as growth in distinct application clusters, cross-application composability, and the share of activity spanning multiple modules or service markets.
8.1 Single-capability paradigms: Bitcoin
Single-capability blockchains such as Bitcoin, Litecoin, or Monero exemplify Metcalfe’s law, each additional user increases the potential for peer-to-peer transactions, while residual broadcast-style reach (Sarnoff) may persist at the margin (Nakamoto, 2008; Metcalfe, 2013; Katz and Shapiro, 1985; 1994). These networks derive robustness from simplicity, with network value driven largely by transaction-web size and native-coin scarcity; fee-based congestion and connectivity effects in Bitcoin are documented in Huberman et al. (2021).
8.2 Multi-capability paradigms: Ethereum
Multi-capability platforms such as Ethereum, Solana, Avalanche, and Cardano extend beyond payments by enabling smart contracts and decentralized applications (Buterin, 2013; Yakovenko, 2018; Team Rocket, 2018; Kiayias et al., 2017). Composability across DeFi, NFTs, and Layer-2 protocols generates feedback loops between developers and users, pushing scaling from quadratic (Metcalfe) toward Reed-like subgroup dynamics (Schär, 2021; Reed, 1999; Catalini and Gans, 2020). Ethereum’s EIP-1559 fee-burn mechanism further couples usage with token scarcity, reinforcing network externalities as activity grows (Buterin et al., 2019).
8.3 Meta-capability paradigms: Bittensor
Meta-capability systems such as Bittensor (TAO), Polkadot, and Cosmos are designed from inception for Reed-style exponential scaling (Reed, 1999; Rao, 2023; Wood, 2016b; Kwon, 2016). Bittensor structures the protocol into subnets that form coalitions of miners and validators around machine-intelligence tasks (Rao, 2023); Polkadot and Cosmos enable similar coalition and interoperability dynamics via parachains and zones (Wood, 2016b; Kwon, 2016). Value creation arises from the combinatorial growth of subgroup interactions that the architecture makes first-class.
Takeaway
Figure 8 highlights divergent scaling regimes, while Table 6 situates them across blockchain paradigms. Bitcoin follows Metcalfe, Ethereum transitions toward Reed, and TAO represents Reed scaling by design.
9 Conclusion
This paper develops a capability-based framework for blockchain value and architecture. The core contribution is to link what a blockchain can deliver at consensus quality (its capability set) to how those services remain feasible and scalable through five pillars: purpose, consensus, incentives, tokenomics, and network effects.
Three findings follow. First, the single-, multi-, and meta-capability taxonomy clarifies how scope and extensibility shape growth dynamics. Second, the valuation model shows that broader capability sets and cross-capability complementarities can generate superlinear value scaling, implying a structural advantage for meta-capability systems under symmetric conditions. Third, the pillars translate this logic into design constraints: scaling capability breadth tightens security-budget, incentive, tokenomic, and coordination requirements, so economic outcomes depend directly on protocol architecture.
For managers and policymakers, the implication is practical: architectural choices (narrow vs. broad purpose, simple vs. layered incentives, closed vs. interoperable design) shape long-run sustainability and value creation.
Future research can operationalize capability breadth and composability proxies to test the model’s predictions across networks and market regimes, including stress episodes where tight coupling may transmit shocks. A complementary direction is to estimate scaling regimes (linear/quadratic/superlinear) using adoption and activity measures, and to examine how pillar-level design choices mediate these relationships.
9.1 Policy and regulatory implications
A capability-and-pillar lens supports proportional regulation by focusing on what a protocol can do and how it sustains reliability.
Proportional scope
Single-capability systems concentrate on value transfer (payments integrity, custody, disclosure). Multi-capability systems add programmable finance and tokenization (market conduct, smart-contract risk, MEV, stablecoins). Meta-capability systems add interoperability and heterogeneous service markets (operational resilience, cross-domain accountability, incident response).
Security-budget sustainability
Across paradigms, consensus security is financed by issuance and fees. Monitoring variables include validator/miner concentration and whether fees and issuance plausibly sustain security under adoption shocks.
Composability and contagion
Composability can create innovation spillovers but also transmit shocks (bridges, oracles, shared liquidity, governance exploits). Disclosure of coupling metrics (cross-contract calls, bridge exposure, shared-liquidity dependencies) can help identify high-coupling clusters.
Design-sensitive levers
Policy can target transparent issuance/burn rules, validator and slashing design, upgrade and audit standards, and fee-mechanism disclosure to improve user-cost predictability.
Author’s note
This research was conducted independently, without external funding or institutional involvement. All data used are publicly available. The views expressed are solely those of the author.
Generative AI statement
The author(s) declared that generative AI was not used in the creation of this manuscript.
Any alternative text (alt text) provided alongside figures in this article has been generated by Frontiers with the support of artificial intelligence and reasonable efforts have been made to ensure accuracy, including review by the authors wherever possible. If you identify any issues, please contact us.
Publisher’s note
All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.
Author disclaimer
This paper is intended for academic and informational purposes only. It does not constitute investment advice or a recommendation to buy or sell any financial instrument.
Footnotes
Edited by: Renjith V. Ravi, MEA Enginnering College, India
Reviewed by: Mudassir Khan, King Khalid University, Saudi Arabia
Saravanan K., Anna University College of Engineering Guindy, India
Footnotes
MEV (Maximal Extractable Value) denotes the upper-bound value that a block producer (or an actor influencing ordering) can extract from transaction ordering and inclusion, for example by reordering, inserting, or censoring transactions within a block.
The normalization scale V 0 ( u ) ensures dimensional consistency: since each v f ( u f ) has units of value, the product v f ( u f ) v g ( u g ) has units of value-squared, so dividing by V 0 ( u ) (units of value) makes the composability term comparable to the direct value terms. For example, if two capabilities each contribute v f = v g = 100 (value units) and η f g = 0.3, then choosing V 0 = 100 yields an interaction contribution 0.3 ⋅ ( 100 ⋅ 100 ) / 100 = 30, which is naturally interpreted as an additional 30 units of value from joint use. In the symmetric benchmarks below, setting V 0 ( u ) = φ u N ( u ) makes each pairwise term scale like a typical single-capability contribution, so that the total composability contribution depends primarily on the number of capability pairs.
Oracle operators provide trusted external data (e.g., asset prices, weather events) to smart contracts, enabling applications like prediction markets and DeFi protocols.
Bridge relayers facilitate cross-chain communication and asset transfers by transmitting proofs or transaction data between blockchains.
Statements
- Conflict of interest
The author(s) declared that this work was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.
- Funding
The author(s) declared that financial support was not received for this work and/or its publication.
- Data availability
All data used are publicly available. Information for existing publicly accessible datasets is contained within the article.
- Author contributions
AP: Validation, Conceptualization, Methodology, Writing – review and editing, Resources, Writing – original draft, Investigation, Formal Analysis, Visualization.
References
- Al-Bassam M. (2019). Lazyledger: a distributed data availability ledger with client-side smart contracts.
- Andreessen M. (2021). The internet computer. Available online at: (Accessed August 20, 2025).
- Biais B., Bisière C., Bouvard M., Casamatta C., Menkveld A. J. (2018). Equilibrium bitcoin pricing. J. Finance 78 (2), 967 – 1014. doi:10.1111/jofi.13206
- Biais B., Bisière C., Bouvard M., Casamatta C. (2019). The blockchain folk theorem. Rev. Financial Stud. 33 (1), 171 – 203. doi:10.1093/rfs/hhy095
- Bonneau J., Miller A., Clark J., Narayanan A., Kroll J. A., Felten E. W. (2015). “ Sok: research perspectives and challenges for bitcoin and cryptocurrencies,” in Proceedings of the IEEE symposium on security and privacy.
- Budish E. (2018). The economic limits of bitcoin and the blockchain. Working Paper 24717. Cambridge, MA: National Bureau of Economic Research.
- Buterin V. (2013). Ethereum: a next-generation smart contract and decentralized application platform. Zug, Switzerland: Ethereum Foundation. Available online at: (Accessed August 20, 2025).
- Buterin V. (2022). Proof of stake: the making of ethereum and the philosophy of blockchains. New York: Seven Stories Press.
- Buterin V., Conner E., Dudley R., Slipper MI., Norden A., Bakhta A. (2019). EIP-1559: fee market change for ETH 1.0 chain. Available online at: (Accessed August 20, 2025).
- Carlsten M., Kalodner H., Weinberg S. M., Narayanan A. (2016). On the instability of bitcoin without the block reward. IACR Cryptology ePrint Archive. Vienna, Austria: ACM SIGSAC.
- Catalini C., Gans J. S. (2016). Some simple economics of the blockchain. Cambridge, MA: National Bureau of Economic Research.
- Catalini C., Gans J. S. (2020). Some simple economics of the blockchain. Commun. ACM 63 (7), 80 – 90. doi:10.1145/3359552
- Coase R. H. (1937). The nature of the firm. Economica 4 (16), 386 – 405. doi:10.1111/j.1468-0335.1937.tb00002.x
- Cobb C. W., Douglas P. H. (1928). A theory of production. Am. Econ. Rev. 18 (1), 139 – 165.
- Cong L. W., He Z., Li J. (2021). Tokenomics: dynamic adoption and valuation. Rev. Financial Stud. 34 (3), 1105 – 1155. doi:10.1093/rfs/hhaa089
- Daian P., Goldfeder S., Kell G., Li Y., Zhao X., Bentov I. (2020). Flash boys 2.0: frontrunning, transaction reordering, and consensus instability in decentralized exchanges. 2020 IEEE Symposium on Security and Privacy (SP). doi:10.1109/SP40000.2020.00040
- Davidson S., De Filippi P., Potts J. (2018). Blockchains and the economic institutions of capitalism. J. Institutional Econ. 14 (4), 639 – 658. doi:10.1017/s1744137417000200
- Easley D., O’Hara M., Basu S. (2019). From mining to markets: the evolution of bitcoin transaction fees. J. Financial Econ. 134 (1), 91 – 109. doi:10.1016/j.jfineco.2019.03.004
- Evans D. S. (2003). The antitrust economics of two-sided markets. Yale J. Regul. 20 (2), 325 – 381.
- Eyal I. (2015). “ The miner’s dilemma,” in 2015 IEEE symposium on security and privacy (IEEE), 89 – 103.
- Farrell J., Klemperer P. (2007). “ Coordination and lock-in: competition with switching costs and network effects,” in Handbook of industrial organization. Editors Armstrong M., Porter R. (Elsevier), 3, 1967 – 2072. doi:10.1016/s1573-448x(06)03031-7
- Fisch C. (2019). Initial coin offerings (Icos) to finance new ventures. J. Bus. Ventur. 34 (1), 1 – 22. doi:10.1016/j.jbusvent.2018.09.007
- Gans J. S. (2019). The case for an ico contracting standard. Cambridge, MA: National Bureau of Economic Research.
- Garay J., Kiayias A., Leonardos N. (2015). “ The bitcoin backbone protocol: analysis and applications,” in Annual international conference on the theory and applications of cryptographic techniques (Springer), 281 – 310.
- Gilad Y., Hemo R., Micali S., Vlachos G., Zeldovich N. (2017). “ Algorand: scaling byzantine agreements for cryptocurrencies,” in Proceedings of the 26th symposium on operating systems principles (SOSP ’17) (Shanghai, China: ACM SOSP), 51 – 68.
- Gourisetti S. N. G., Mylrea M., Patangia H. (2020). Evaluation and demonstration of blockchain applicability framework. IEEE Trans. Eng. Manag. 67 (4), 1183 – 1196. doi:10.1109/tem.2019.2928280
- Harvey C. R., Ramachandran A., Santoro J. (2021). “ Defi and the future of finance,” in Journal of financial perspectives (Hoboken, NJ, USA: John Wiley & Sons, Inc.).
- Hopwood D., Bowe S., Hornby T., Wilcox N. (2016). Zcash protocol specification in Technical report 1.0, electric coin company. Version 2016.1.0.
- Howell S. T., Niessner M., Yermack D. (2020). Financing growth with cryptocurrency token sales. Rev. Financial Stud. 33 (9), 3925 – 3974. doi:10.1093/rfs/hhz131
- Huberman G., Leshno J. D., Moallemi C. C. (2021). Monopoly without a monopolist: an economic analysis of the bitcoin payment system. Rev. Econ. Stud. 88 (6), 3011 – 3040. doi:10.1093/restud/rdab014
- Katona Z., Sarvary M. (2008). Network formation and the structure of the commercial world wide web. Mark. Sci. 30 (4), 702 – 720. doi:10.1287/mksc.1070.0349
- Katz M. L., Shapiro C. (1985). Network externalities, competition, and compatibility. Am. Econ. Rev. 75 (3), 424 – 440.
- Katz M. L., Shapiro C. (1994). Systems competition and network effects. J. Econ. Perspect. 8 (2), 93 – 115. doi:10.1257/jep.8.2.93
- Kiayias A., Russell A., David B., Oliynykov R. (2017). Cardano settlement layer: a cryptocurrency with a proof-of-stake consensus protocol. Zug, Switzerland: Cardano Foundation.
- King S., Nadal S. (2012). Ppcoin: peer-to-peer crypto-currency with proof-of-stake. White paper. Available online at: (Accessed August 20, 2025).
- Klages-Mundt A., Minca A. (2019). (in)stability for the blockchain: deleveraging spirals and stablecoin attacks. arXiv Preprint arXiv:1906.02152
- Klages-Mundt A., Minca A. (2022). While stability lasts: a stochastic model of non-custodial stablecoins. Math. Finance 32 (4), 943 – 981. doi:10.1111/mafi.12357
- Klages-Mundt A., Harz D., Gudgeon L., Liu J., Minca A. (2020). “ Stablecoins 2.0: economic foundations and risk-based models,” in Proceedings of the 2nd ACM conference on advances in financial technologies (AFT ’20), 59 – 79.
- Kroll J. A., Davey I. C., Felten E. W. (2013). “ The economics of bitcoin mining, or bitcoin in the presence of adversaries,” in Proceedings of WEIS.
- Kwon J. (2016). Cosmos: a network of distributed ledgers. Tech. Report. Cosmos Project.
- Lee C. (2011). Litecoin: a peer-to-peer internet currency.
- Li J., Jiang Z., Chen S., Luo X., Wen Q. (2020). Decentralized finance: on blockchain-and smart contract-based financial markets. arXiv Preprint arXiv:2006.12567.
- Liu Y., Tsyvinski A. (2021). Risks and returns of cryptocurrency. Rev. Financial Stud. 34 (6), 2689 – 2727. doi:10.1093/rfs/hhaa113
- Malkiel B. G. (2015). A random walk Down wall street. 11 edition. New York: W. W. Norton and Company.
- Metcalfe R. M. (2013). Metcalfe’s law after 40 years of ethernet. Computer 46 (12), 26 – 31. doi:10.1109/mc.2013.374
- Milgrom P., Roberts J. (1990). The economics of modern manufacturing: technology, strategy, and organization. Am. Econ. Rev. 80 (3), 511 – 528.
- Nakamoto S. (2008). Bitcoin: a peer-to-peer electronic cash system. Available online at: (Accessed August 20, 2025).
- Narayanan A., Bonneau J., Felten E., Miller A., Goldfeder S. (2016). Bitcoin and cryptocurrency technologies. Princeton University Press.
- Pagnotta E., Buraschi A. (2018). An equilibrium valuation of bitcoin and decentralized network assets. SSRN Working Paper. doi:10.2139/ssrn.3142022
- POA Network (2018). POA network whitepaper. Available online at: (Accessed August 20, 2025).
- Poon J., Dryja T. (2016). The bitcoin lightning network: scalable off-chain instant payments. Tech. Report.
- Qin K., Zhou L., Livshits B., Gervais A. (2021). “ Attacking the defi ecosystem with flash loans for fun and profit,” in Financial cryptography and data security (FC 2021), volume 12674 of lecture notes in computer science (Springer), 3 – 32.
- Rao Y. (2023). Bittensor: a decentralized intelligence market. Available online at: (Accessed February 06, 2026).
- Reed D. P. (1999). The law of the pack. Harv. Bus. Rev. 77 (2), 23 – 24.
- Ribeiro da Silva E., Angelis J. (2019). “ Blockchain adoption: a value driver perspective,” Bus. Horizons 62. 307 – 314. doi:10.1016/j.bushor.2018.12.001
- Roughgarden T. (2020). Transaction fee mechanism design for the ethereum blockchain: an economic analysis of EIP-1559.
- Saleh F. (2021). Blockchain without waste: proof-Of-stake. Rev. Financial Stud. 34 (3), 1156 – 1190. doi:10.1093/rfs/hhaa075
- Schär F. (2021). Decentralized finance: on blockchain- and smart contract-based financial markets. Fed. Reserve Bank St. Louis Rev. 103 (2), 153 – 174. doi:10.20955/r.103.153-74
- Schilling L., Uhlig H. (2019). Some simple bitcoin economics. J. Monetary Econ. 106, 16 – 26. doi:10.1016/j.jmoneco.2019.07.002
- Team Rocket (2018). Snowflake to avalanche: a novel metastable consensus protocol family for cryptocurrencies. Tech. Report, Ava Labs. SSRN working paper.
- Topkis D. M. (1998). Supermodularity and complementarity. Princeton University Press.
- Van Saberhagen N. (2013). Cryptonote v 2.0. Available online at: (Accessed August 20, 2025).
- Wang W., Hoang D. T., Hu P., Xiong Z., Niyato D., Wang P. (2018). “ A survey on consensus mechanisms and mining strategy management in blockchain networks,” in Comprehensive review of decentralized consensus algorithms and strategic miner behavior. arXiv, abs/1805.02707.
- Williamson O. E. (1981). The economics of organization: the transaction cost approach. Am. J. Sociol. 87 (3), 548 – 577. doi:10.1086/227496
- Wood G. (2016a). Ethereum: a secure decentralised generalised transaction ledger. Ethereum Foundation. Zug, Switzerland: Ethereum Foundation. Available online at: (Accessed August 20, 2025).
- Wood G. (2016b). Polkadot: vision for a heterogeneous multi-chain framework. Zug, Switzerland: Polkadot (Parity Technologies). Available online at: (Accessed August 20, 2025).
- Xu X., Weber I., Staples M. (2019). Architecture for blockchain applications. Springer.
- Yaga D., Mell P., Roby N., Scarfone K. (2018). Blockchain technology overview. NISTIR 8202. Gaithersburg, MD, USA: National Institute of Standards and Technology.
- Yakovenko A. (2018). Solana: a new architecture for a high performance blockchain. San Francisco, CA: Solana Labs. Available online at: (Accessed February 06, 2026).
- Zamyatin A., Harz D., Lind J., Panayiotou P., Gervais A., Knottenbelt W. (2019). Xclaim: trustless, interoperable, cryptocurrency-backed assets. Preprint.
Citation
Papadogiannis, A. (2026). The architecture of blockchain value: capabilities, pillars, and growth dynamics. Frontiers in Blockchain, Volume 9. https://doi.org/
- Received
- Accepted
- Published
- Volume
- 9 - 2026
Copyright
Copyright © 2026 Papadogiannis.
License: https://creativecommons.org/licenses/by/4.0/
*Correspondence: Agisilaos Papadogiannis
Article metrics
- Views
- 0
- Downloads
- 0
- Citations
- 0
- Shares
- 0
