Building on Bitcoin

Emerging Protocols on Bitcoin: How to Evaluate Them

Emerging Bitcoin systems can be consensus proposals, software behavior, application protocols, indexed state, bridges, or experiments. Use a repeatable framework to identify enforcement, custody, data availability, exits, cryptographic and economic assumptions, implementation maturity, governance, interoperability, and evidence quality.

  • Innovation
  • Deep
  • Technical Analysis
  • 20 to 23 minutes
  • Reviewed null

Preview only. Publication records and confirmed URLs do not exist; all navigation remains inactive.

An emerging Bitcoin protocol should be evaluated by asking what it changes, who enforces it, what evidence exists, and what happens when its assumptions fail. The name of a project, the presence of transactions on Bitcoin, or the publication of a BIP does not answer those questions.

โ€œBuilt on Bitcoinโ€ can describe many different systems: a consensus proposal, a node-policy change, an application protocol using ordinary transactions, an indexer-derived ledger, a bridge, a sidechain, a wallet convention, an experimental proof system, or software that merely anchors data to Bitcoin. Bitcoin enforces different, often narrow parts of these systems. Their remaining security, custody, availability, governance, and operational properties come from other components rather than being inherited automatically from Bitcoin.

A useful evaluation therefore begins by separating layers before comparing features.

Start with the exact artifact and date

Record what is being evaluated: a paper, BIP, specification commit, software release, pull request, testnet deployment, mainnet application, hosted service, or marketing page. Record the date, version, commit, and network.

This prevents โ€œthe protocolโ€ from becoming a moving target. A paper can describe a design not yet implemented. A repository's default branch can differ from its latest release. A public demo can use signet parameters that do not exist on mainnet. A website can summarize capabilities more broadly than the code supports.

Primary evidence should be preferred. For consensus proposals, use the current BIP and implementation discussion. For software behavior, inspect release notes, source, tests, and configuration. For a deployed application, inspect its actual contracts, transactions, binaries, operator documentation, audits, and incident record.

Date every maturity or adoption statement. โ€œCurrently,โ€ โ€œsupported,โ€ and โ€œliveโ€ become unreliable without a review date and a defined environment.

Classify the layer

The first classification is what kind of rule or system is involved.

A Bitcoin consensus rule is enforced by validating nodes when they accept transactions and blocks. Changing it requires a network rule change, not merely an application release.

Bitcoin Core behavior can include consensus implementation, wallet behavior, mempool policy, relay defaults, mining interfaces, and RPCs. Not every Bitcoin Core default is a Bitcoin consensus rule. Other compatible implementations may make different policy or interface choices while enforcing the same active consensus rules.

A BIP is a proposal or standard document. BIP 3 states that BIPs do not define Bitcoin or represent community consensus. Its workflow distinguishes Draft, Complete, Deployed, and Closed. A Complete consensus proposal can remain undeployed indefinitely.

An application protocol uses active Bitcoin rules without changing them. DLCs are one example: Bitcoin validates funding and closing transactions, while DLC software interprets oracle announcements, adaptor signatures, contract messages, and payout mappings.

An application-derived system reconstructs state from Bitcoin data according to additional rules. Ordinals, Runes, and BRC-20 indexers are examples of the broader category. Bitcoin consensus validates the underlying transactions but does not maintain those application balances or identifiers.

A bridge or sidechain adds another system and a custody or verification boundary. The bridge's Bitcoin transactions may be valid even if the external state machine, operator accounting, or wrapped asset fails.

An experimental project can have papers, code, and public transactions while remaining unsuitable for production. Classification should describe what exists, not what the roadmap intends.

Identify the enforcement point

For every important rule, ask who rejects a violation.

If every fully validating Bitcoin node rejects it, it is an active consensus rule. If ordinary nodes accept the transaction but one application ignores it, the rule is application-derived. If a federation refuses a withdrawal, it is federation policy. If a wallet refuses to construct a transaction, it is wallet behavior. If a hosted API filters results, it is service behavior.

This exercise often exposes ambiguous claims. โ€œBitcoin verifies the proofโ€ may mean a Tapscript spend checks a verifier script. It does not necessarily mean Bitcoin nodes understand the external program, bridge ledger, or destination chain.

Create an enforcement table listing each claim, the enforcing component, the data it reads, the failure response, and whether another implementation can disagree while remaining Bitcoin-consensus compatible.

Then test disagreement. What happens when two indexers compute different balances, two wallets use different policy, or a bridge operator and challenger follow different external-chain tips? The protocol needs a resolution rule beyond saying that data is โ€œon Bitcoin.โ€

Separate active features from proposals

Consensus proposals deserve especially careful language. A BIP number, reference implementation, test vectors, or Complete status is evidence of specification maturity. It is not activation.

BIP 347 illustrates the distinction. As of July 24, 2026, it is a Complete soft-fork proposal for OP_CAT in Tapscript. Current mainnet Tapscript still treats the target byte as OP_SUCCESS126, and current legacy or SegWit v0 execution keeps OP_CAT disabled. A guide should not describe OP_CAT as an available mainnet opcode unless deployment evidence changes.

The same method applies to covenant proposals, new signature hashes, peer-to-peer features, or policy changes. State the proposal identifier, exact status, implementation branch, activation design if one exists, and observed network state.

Avoid predicting inevitability. Bitcoin has no central approval body that turns a BIP into consensus. Deployment requires implementation and coordinated adoption appropriate to the proposal.

Map custody and control

For any system involving bitcoin, identify which keys or scripts control the actual UTXOs.

In self-custody, the user may hold keys satisfying the output's spending conditions. In a federation, threshold signers may control a shared output. In a bridge, operators may advance liquidity while another transaction system governs reimbursement. In a hosted account, the user may hold only a contractual claim against a custodian.

Terms such as โ€œtrustless,โ€ โ€œnon-custodial,โ€ and โ€œtrust-minimizedโ€ should be replaced or supplemented with a concrete key and failure map. List who can move funds, freeze exits, delay transactions, upgrade rules, censor requests, or recover from lost keys.

Also identify setup assumptions. Some systems depend on pre-signed transactions, key deletion, a ceremony, a common reference string, hardware security modules, or an honest threshold at initialization. A design can reduce ongoing trust while retaining significant setup trust.

Control can change over time. Emergency keys, upgrade keys, rotating federations, and recovery paths must be included, not treated as operational footnotes.

Define the state and data source

Ask what state the protocol maintains and where that state comes from.

Bitcoin-native state includes the accepted block chain and UTXO set under active consensus. An application may derive additional balances, names, inscriptions, contract records, proof commitments, or bridge liabilities. A side system may maintain accounts or smart-contract storage not visible to Bitcoin nodes.

Document the canonical data source and ordering rules. Does the protocol follow Bitcoin block order, transaction order, output order, an external sequencer, oracle timestamps, or a hosted database? How are reorganizations rolled back? How are unconfirmed replacements handled?

If state depends on an indexer, specify the parser version, database schema, rollback logic, and rebuild process. If state depends on an oracle, define the event encoding, signing key, nonce handling, measurement method, and correction policy.

โ€œOn-chainโ€ is too broad to answer these questions. Data can be included in a Bitcoin transaction while its meaning remains entirely application-defined.

Evaluate data availability

A participant must be able to obtain the data needed to verify state, challenge a claim, or exit.

A proof may demonstrate that some hidden witness exists without supplying the transaction history a user needs. A bridge may publish commitments to Bitcoin while keeping batch data elsewhere. An indexer may require old block data that a pruned node no longer serves. A rollup-like system may depend on a sequencer or data-availability network.

List the minimum data required for each safety action. Identify who publishes it, where it is retained, how long it remains accessible, and whether users can reconstruct it independently.

Then test withholding. If an operator stops publishing data, can users exit with locally retained information? Can a challenger prove fraud? Can a new node synchronize? Does the protocol become safe but unavailable, or can funds be lost?

Availability claims should distinguish Bitcoin block inclusion, archival retention, indexer access, hosted APIs, and user backups.

Examine the exit and failure paths

The normal path is rarely the security-critical path. Trace failure scenarios.

What happens if counterparties disappear? If an oracle never attests? If a bridge operator refuses a withdrawal? If a challenger is offline? If a sequencer withholds a batch? If an external chain reorganizes? If a transaction misses its timelock window? If fees rise sharply?

A credible design supplies unilateral or threshold exit procedures with concrete transactions, data, deadlines, and fee assumptions. It also states where no unilateral exit exists.

Time-sensitive paths should be evaluated under realistic confirmation uncertainty. Consensus-valid transactions can still face relay-policy rejection, pinning, low fee rates, miner policy, or congestion. Pre-signed transactions may have limited fee-bumping options.

Recovery procedures need tests. A diagram showing a refund or emergency path is weaker evidence than an implementation test that constructs, signs, broadcasts, and confirms it under the current network rules.

List cryptographic and economic assumptions

Bitcoin's proof of work and signature rules do not replace every assumption in a higher-layer protocol.

Using Bitcoin for settlement, timestamps, commitments, deposits, or data publication does not make an external state machine, bridge, indexer, sequencer, oracle, proof system, or operator set share Bitcoin's consensus security. State exactly which Bitcoin transaction or script rule is enforced and which failures remain outside that boundary.

A project may rely on collision resistance, discrete-log hardness, a proof system's soundness, a trusted setup, adaptor-signature security, threshold-signature protocols, secure enclaves, or assumptions about an external virtual machine. Name each assumption and its implementation.

Economic security adds another layer. An optimistic system may assume a challenger will monitor and can profitably respond. A bridge may require operator collateral or liquidity. A channel system may require watchtower availability. Penalties must exceed plausible gains after fees and capital costs.

Model who pays to remain honest and who profits from failure. Include fee spikes, locked capital, challenge rewards, liquidity shortages, and griefing attacks that impose costs without directly stealing funds.

โ€œCryptographically verifiedโ€ and โ€œeconomically securedโ€ are not complete descriptions unless the verified statement and incentive model are explicit.

Inspect code, tests, and release discipline

A repository is evidence of implementation effort, not security.

Check whether the code corresponds to the current paper or specification. Look for tagged releases, reproducible builds, dependency pinning, test vectors, integration tests, fuzzing, static analysis, continuous integration, and documented upgrade procedures.

Search for explicit warnings. The official BitVM implementation repository, for example, warns not to use it in production as of the review date. That warning outweighs promotional interpretations of a public demo.

Audits should be scoped precisely. Record the commit, components, assumptions, findings, remediation status, and whether the deployed binary matches the audited code. An audit of a cryptographic library is not an audit of bridge economics or operational key management.

Also review issue trackers, pull requests, and incident reports. Mature software can still be risky, but visible handling of failures is more informative than an unqualified โ€œbattle-testedโ€ label.

Test interoperability and version boundaries

Protocols with multiple implementations need shared test vectors and cross-implementation testing.

Two projects can use the same name while disagreeing on serialization, rounding, transaction ordering, fee handling, oracle formats, proof inputs, or reorganization behavior. A โ€œcompatibleโ€ claim should name the versions tested and the cases passed.

Version negotiation matters for long-lived contracts. A DLC oracle may announce an event far in advance. A bridge deposit may remain open across software upgrades. An indexer may need to reproduce historical rules after a parser change.

Ask whether upgrades are backward-compatible, opt-in, centrally imposed, or coordinated by a federation. Determine what happens to existing funds and contracts when one participant upgrades first.

Application-derived systems should preserve historical interpretation rules or document migrations. Silent reinterpretation of old transactions can change displayed balances even though Bitcoin history is unchanged.

Examine governance and upgrade authority

Every evolving system has a change process, even when it avoids the word governance.

For Bitcoin consensus, no single maintainer or repository controls activation. For an application, maintainers may release new code, but users, operators, indexers, or signers decide what to run. A hosted service can change behavior unilaterally for its customers.

Identify who can change contracts, keys, fee parameters, oracle sets, sequencers, challenge periods, parsers, or supported assets. Check whether changes require user migration or apply automatically.

Emergency authority deserves special attention. An emergency pause can reduce losses during an incident but creates censorship and custody power. An upgrade key can fix bugs but can also change rules or redirect funds.

Governance claims should be based on actual control paths and deployment procedures, not token voting pages, organizational labels, or informal community language.

Verify adoption and performance claims

Adoption is not one number. A project can count addresses, transactions, deposits, wallets, nodes, or API requests, each with different meaning.

Prefer reproducible on-chain or published operational data with a date and method. Separate testnet from mainnet, unique users from addresses, gross deposits from current liabilities, and peak throughput from sustained finalized throughput.

Performance claims need workload definitions. Transactions per second can exclude data publication, settlement, bridge exits, proof generation, or Bitcoin confirmation time. Low fees may be subsidized or depend on centralized batching.

Do not infer safety from total value, transaction count, investors, partners, or longevity. Those can show use, not correctness. Conversely, low adoption does not disprove a design; it limits the operational evidence available.

When evidence cannot be independently reproduced, label the claim as project-reported.

Use a claim-evidence matrix

A practical review can be organized into a matrix with five columns:

  1. the exact claim;
  2. the layer or component;
  3. the primary evidence;
  4. the review date and version; and
  5. the remaining uncertainty.

For โ€œOP_CAT is available,โ€ the active-rule evidence contradicts the claim: BIP 347 is Complete but not Deployed. For โ€œBitVM runs arbitrary programs on Bitcoin,โ€ the more precise evidence says computation occurs off-chain and Bitcoin handles defined dispute verification; the implementation remains a developer preview. For โ€œDLCs are Bitcoin smart contracts,โ€ the matrix should explain that Bitcoin validates ordinary transactions while DLC software and oracles supply the contract semantics.

This format prevents a source from being stretched beyond what it supports. A paper can support the intended security model. A repository can support implementation status. A block explorer can support that transactions occurred. None alone proves the complete production claim.

Uncertainty is an output, not a failure. A good review identifies which questions remain open and what evidence would resolve them.

A repeatable evaluation sequence

Begin with classification: name the artifact, network, version, layer, and enforcement point.

Continue with control: map keys, custody, setup, upgrades, and emergency authority.

Then map state and information: identify the canonical history, parser, oracle, sequencer, data-availability path, and reorganization behavior.

Trace every exit: cooperative, unilateral, timeout, refund, challenge, recovery, and failure. Include fees and confirmation timing.

Review security evidence: cryptographic assumptions, economic incentives, code quality, tests, audits, incidents, and cross-implementation results.

Finally rewrite the project's main claims in precise language. Replace โ€œsecured by Bitcoinโ€ with the exact rules Bitcoin enforces. Replace โ€œdecentralizedโ€ with the operator and key distribution. Replace โ€œliveโ€ with the network, release, and date. Replace โ€œtrustless bridgeโ€ with its custody, challenger, setup, and data assumptions.

This process does not decide whether innovation is good or bad. It makes the system legible enough for readers to understand what is currently true, what is proposed, and what remains uncertain.

Key Terms

Consensus rule
A rule validating Bitcoin nodes enforce when accepting transactions and blocks.
Implementation behavior
The behavior of specific software, which may include consensus enforcement, wallet logic, relay policy, APIs, and defaults.
Application protocol
Rules implemented above Bitcoin consensus using valid Bitcoin transactions and additional messages or state.
Application-derived state
State reconstructed from Bitcoin data according to rules not maintained by Bitcoin consensus.
Soft-fork proposal
A proposed consensus restriction that would require activation before upgraded rules are enforced on mainnet.
Enforcement point
The component that detects a rule violation and determines the consequence.
Custody map
A record of the keys, scripts, signers, and emergency authorities that can control funds.
Data availability
Access to the information required to verify state, challenge claims, synchronize, or exit.
Unilateral exit
A recovery or settlement path a user can exercise without ongoing counterparty cooperation.
Trusted setup
An initialization process whose integrity is required for the later security claim.
Economic security
A design relying on collateral, rewards, penalties, liquidity, or monitoring incentives.
Interoperability
The ability of independently developed implementations to agree on messages, transactions, state, and outcomes.
Claim-evidence matrix
A table linking each claim to its layer, primary source, date, version, and uncertainty.
Project-reported metric
A measurement supplied by the project that has not been independently reproduced.

Sources

BIP 3: Updated BIP Process

  • author or publisher: Murch
  • url: https://github.com/bitcoin/bips/blob/master/bip-0003.md
  • supports: The purpose and limits of BIPs, author ownership, Complete and Deployed statuses, evidence expectations, and lack of a central Bitcoin adoption authority.

BIP 347: OP_CAT in Tapscript

  • author or publisher: Ethan Heilman and Armin Sabouri
  • url: https://github.com/bitcoin/bips/blob/master/bip-0347.mediawiki
  • supports: A current example of a Complete consensus soft-fork proposal that must remain separate from active mainnet rules.

BIP 341: Taproot

  • author or publisher: Pieter Wuille, Jonas Nick, and Anthony Towns
  • url: https://github.com/bitcoin/bips/blob/master/bip-0341.mediawiki
  • supports: Active Taproot consensus rules and script-path commitments used by many emerging protocols.

BIP 342: Validation of Taproot Scripts

  • author or publisher: Pieter Wuille, Jonas Nick, and Anthony Towns
  • url: https://github.com/bitcoin/bips/blob/master/bip-0342.mediawiki
  • supports: Active Tapscript rules, OP_SUCCESSx upgrade behavior, and resource limits.

Bitcoin Core v31.1 Script Interpreter

  • author or publisher: Bitcoin Core contributors
  • url: https://github.com/bitcoin/bitcoin/blob/v31.1/src/script/interpreter.cpp
  • supports: A dated implementation source used to distinguish active script behavior from proposed opcodes.

Bitcoin Core v31.1 Policy Source

  • author or publisher: Bitcoin Core contributors
  • url: https://github.com/bitcoin/bitcoin/tree/v31.1/src/policy
  • supports: A dated example of implementation relay and standardness policy separate from consensus.

Bitcoin Core v31.1 Release Notes

  • author or publisher: Bitcoin Core contributors
  • url: https://github.com/bitcoin/bitcoin/blob/master/doc/release-notes/release-notes-31.1.md
  • supports: The current implementation release used to date Bitcoin Core behavior in this batch.

BitVM: Compute Anything on Bitcoin

  • author or publisher: Robin Linus
  • url: https://bitvm.org/bitvm.pdf
  • supports: An example of a paper specifying off-chain computation and Bitcoin dispute verification without consensus changes.

BitVM2: Bridging Bitcoin to Second Layers

  • author or publisher: Robin Linus and coauthors
  • url: https://bitvm.org/bitvm_bridge.pdf
  • supports: An example of an evolving bridge and optimistic verification design with operators, challengers, proofs, setup, and liveness assumptions.

BitVM Repository

  • author or publisher: BitVM contributors
  • url: https://github.com/BitVM/BitVM
  • supports: An example of implementation evidence and an explicit production warning reviewed on 2026-07-24.

BitVM Developer Preview

  • author or publisher: BitVM contributors
  • url: https://bitvm.org/demo/
  • supports: An example of public test transactions and developer-preview evidence that should not be equated with production deployment.

DLC Specifications README

  • author or publisher: DLC specification contributors
  • url: https://github.com/discreetlogcontracts/dlcspecs/blob/master/README.md
  • supports: An example of an application-protocol specification that remains self-described as work in progress while implementations exist.

DLC Specifications Introduction

  • author or publisher: DLC specification contributors
  • url: https://github.com/discreetlogcontracts/dlcspecs/blob/master/Introduction.md
  • supports: An example of separating Bitcoin transaction enforcement from oracle, adaptor-signature, refund, and collusion assumptions.

DLC Peer Protocol

  • author or publisher: DLC specification contributors
  • url: https://github.com/discreetlogcontracts/dlcspecs/blob/master/Protocol.md
  • supports: An example of versioned application messages, transaction construction, validation requirements, fees, and locktimes.

BIP 141: Segregated Witness

  • author or publisher: Eric Lombrozo, Johnson Lau, and Pieter Wuille
  • url: https://github.com/bitcoin/bips/blob/master/bip-0141.mediawiki
  • supports: Transaction identifiers, witness data, weight, and versioning background for evaluating application transaction designs.

Bitcoin Developer Guide: P2P Network

  • author or publisher: Bitcoin Core project documentation contributors
  • url: https://developer.bitcoin.org/devguide/p2p_network.html
  • supports: Background for separating peer behavior and network relay from application protocols.

Bitcoin Developer Guide: Block Chain

  • author or publisher: Bitcoin Core project documentation contributors
  • url: https://developer.bitcoin.org/devguide/block_chain.html
  • supports: Accepted-chain, confirmation, and reorganization background for evaluating derived state.

Ordinal Theory Handbook

  • author or publisher: Ord project contributors
  • url: https://docs.ordinals.com/
  • supports: An example of application-derived identifiers, indexing, wallet handling, and interpretation above Bitcoin consensus.

Runes Specification

  • author or publisher: Ord project contributors
  • url: https://docs.ordinals.com/runes.html
  • supports: An example of application-derived fungible state interpreted from Bitcoin transactions.

BRC-20 Experiment Documentation

  • author or publisher: domo-2k
  • url: https://domo-2.gitbook.io/brc-20-experiment/
  • supports: An example of an experimental indexed protocol whose balance rules are not Bitcoin consensus.

NIST Secure Software Development Framework

  • author or publisher: National Institute of Standards and Technology
  • url: https://csrc.nist.gov/pubs/sp/800/218/final
  • supports: Primary software-security guidance supporting review of releases, dependencies, testing, provenance, and vulnerability handling.