Towards a Based EVM Layer on CKB: Three Architectural Options

Option 1: A Based ZK Rollup on CKB

When discussing an EVM environment on CKB, the conversation usually begins with execution: Solidity compatibility, Ethereum RPCs and the migration of existing DeFi protocols.

Yet execution may no longer be the defining question. Mature EVM implementations already exist. The harder questions concern who orders the next batch, what CKB itself ought to verify, and how users retain control over their assets when execution takes place elsewhere.

I have been exploring whether Myelin could provide the off-chain foundation for a based EVM architecture whose canonical ordering and settlement are governed by CKB itself.

I see three possible architectures worth exploring:

  • Option 1 — Based ZK Rollup: CKB provides canonical sequencing, L1 data availability and validity-proof settlement.

  • Option 2 — Based ZK Validium: The same sequencing and validity-proof model, but with external data availability to support higher throughput.

  • Option 3 — Based Optimistic Rollup: CKB provides canonical sequencing and data availability, while disputed EVM execution is adjudicated through a CKB-VM-compatible court rather than continuous ZK proving.

These options explore two distinct design choices: where transaction data resides, and how execution correctness is established. All three retain CKB as the canonical sequencing and settlement authority, while Myelin provides the off-chain execution and evidence infrastructure.

Option 3 is particularly interesting in relation to Myelin’s original CKB-isomorphic execution model, although extending its existing court machinery to EVM semantics would require substantial additional work.

This first post focuses on Option 1, with the other two explored separately in the thread.

The idea follows my earlier discussion, Introducing Myelin: a CKB-aligned off-chain Cell session runtime.

Myelin began as an experiment in preserving CKB transaction semantics across off-chain sessions: deterministic execution, dependency scheduling, persistent state, evidence commitments and a path towards L1 adjudication. It was deliberately not presented as a new permissionless chain.

An EVM Rollup would require a separate execution backend, but much of Myelin’s surrounding runtime machinery could be useful. More importantly, it raises an architectural possibility worth examining: using CKB’s own consensus and Cell model to establish the canonical history of an EVM ledger, without appointing a permanent L2 sequencer.

This is a design proposal, not an announcement of an implemented Rollup.

What makes a Rollup based?

The term comes from Justin Drake’s original proposal.

In a conventional Rollup, an L2 sequencer typically collects transactions, chooses their order and submits batches to L1. Even where users have a forced-inclusion mechanism, the sequencer retains considerable influence over transaction ordering and short-term censorship.

A based Rollup takes a different approach. The underlying L1 determines the canonical sequence of L2 blocks. The right to propose the next Rollup block is permissionless, rather than reserved for an appointed L2 operator.

The important distinction is not whether an L2 block eventually appears on L1. Almost every Rollup does that. It is whether a privileged actor controls which L2 blocks may advance the chain.

For CKB, this would mean allowing competing builders to assemble EVM batches, while CKB miners determine their canonical inclusion through ordinary PoW consensus.

There would be no separate L2 committee whose signatures establish the authoritative batch sequence.

This does not eliminate MEV or guarantee immediate confirmations. Builders still influence transaction ordering within their batches, and ordering competition moves towards the L1 block-building and fee market. CKB also has its own transaction proposal window, so the latency and preconfirmation model would differ from Ethereum-based designs.

Nevertheless, the attraction is considerable: the Rollup need not maintain a second political or economic authority over its canonical history.

Why the Cell model is particularly interesting

CKB has a useful property which is easy to overlook in discussions dominated by account-based contracts.

A Cell can only be consumed once in the canonical chain.

Suppose a Rollup maintains a SequencingTip Cell representing its current ordered batch frontier. A valid proposal consumes that Cell and creates a successor with the next batch commitment.

Two competing proposals cannot both become successors of the same Cell in the same canonical history.

This gives us a native, L1-enforced linearisation point.

flowchart TB
    A["Permissionless EVM batch builders"] --> B1["Candidate batch A"]
    A --> B2["Candidate batch B"]

    S["Current SequencingTip Cell"]

    S --> B1
    S --> B2

    B1 --> C{"CKB canonical inclusion"}
    B2 --> C

    C --> D["One accepted successor"]
    C -.-> R["Conflicting spend cannot survive"]

    D --> E["Next SequencingTip Cell"]
    E --> F["Canonical EVM batch stream"]

    classDef builder fill:#edf3ff,stroke:#6487ca,color:#1f3c75
    classDef canonical fill:#daf3e7,stroke:#38936d,color:#14573e
    classDef reject fill:#fff0eb,stroke:#cb806e,color:#8b4031

    class A,B1,B2 builder
    class S,C,D,E,F canonical
    class R reject

The Type Script would enforce the transition rules: the previous tip must be consumed, the successor must preserve the Rollup identity, and the new batch commitment must be correctly formed and linked to the old one. Crucially, advancing this Cell would not require a designated sequencer’s signature.

This is not a free scaling solution. A singleton sequencing Cell creates contention, and CKB’s proposal/commit mechanism complicates successive batch production.

My preferred starting point is to separate parallel transaction intake from L1 canonicalisation. Myelin could execute bounded microbatches off-chain, which are then assembled into ordered epoch manifests, with one CKB sequencing transition per epoch.

This amortises contention rather than eliminating it. The sustainable checkpoint rate would still need to be measured under realistic CKB transaction-dependency conditions.

There is another important requirement: users must be able to submit transactions without depending on a particular builder.

I would distinguish ordinary batch-data publication from a separate, authenticated priority inbox on CKB.

The first provides the transaction data needed for independent reconstruction. The second provides a potential route for forced inclusion when ordinary builders refuse to process a user’s transaction.

The priority inbox would need explicit admission rules, resource limits, deterministic rejection semantics and verifiable processing obligations. Simply recording requests on L1 would not, by itself, guarantee their execution.

Its ordering and completeness must also be authenticated without trusting an off-chain indexer’s interpretation of CKB history.

These are protocol responsibilities, rather than details that can safely be delegated to the mempool.

Myelin as an execution and evidence substrate

I would separate the system into three responsibilities:

  • CKB determines the canonical order of accepted batches, authenticates the sequencing history and enforces verified settlement.
  • Myelin reconstructs that history, executes the corresponding state transitions and provides the infrastructure for independent state reconstruction.
  • Independent provers demonstrate that the EVM state transitions conform to the committed execution rules.

The proposed architecture would look roughly as follows:

flowchart TB
    subgraph USER["Ethereum application surface"]
        U["Wallets and Solidity applications"]
        B["Permissionless batch builders"]
        U --> B
    end

    subgraph CKB["CKB Layer 1 · PoW authority"]
        D["L1 batch-data publication"]
        I["Authenticated priority inbox"]
        O["SequencingTip Cell<br/>Canonical ordering frontier"]
        S["SettlementTip Cell<br/>Verified EVM state"]
        V["Asset vaults and withdrawal claims"]

        D --> O
        I -.-> O
        S --> V
    end

    subgraph MYELIN["Myelin · Off-chain runtime"]
        F["Canonical CKB follower"]
        E["EVM execution and state reconstruction"]
        P["Independent validity prover"]

        F --> E --> P
    end

    B --> D
    U -. "Forced inclusion" .-> I
    O --> F
    D -. "Published execution data" .-> F
    O -. "Authenticated history" .-> S
    P --> S
    V -. "Deposits and exits" .-> E

    style USER fill:#f4f0ff,stroke:#9b87c6,stroke-width:2px
    style CKB fill:#eaf3ff,stroke:#6b91c9,stroke-width:2px
    style MYELIN fill:#e9f6f0,stroke:#6fae91,stroke-width:2px

The proposed EVM execution profile would use an established Ethereum execution engine, such as revm, with canonical Ethereum account and storage semantics.

This deserves a distinction from Myelin’s original design.

The existing Cell execution model is CKB-isomorphic: its transactions and scripts are deliberately shaped to remain compatible with CKB-VM. EVM execution cannot simply inherit that claim. Ethereum has a different state model, execution semantics and gas accounting.

I would therefore retain native Cell sessions as one Myelin execution profile and introduce EVM execution as another.

They could share infrastructure for deterministic batch processing, recovery, durable state lineage and evidence generation, without pretending their virtual machines are equivalent.

For the EVM profile, correctness would be established through validity proofs rather than direct CKB-VM replay of every EVM instruction.

CKB would verify the proof, not emulate Ethereum.

There is also an unresolved data-publication question within the Rollup design itself.

CKB transaction witnesses, Cell data and other CKB-committed data structures have different storage, retrieval and economic properties. The precise data carrier must ensure that independent participants can retrieve the ordered transaction inputs needed for state reconstruction.

Merely committing to a data hash is not sufficient for Rollup-grade data availability.

Two frontiers instead of a second consensus network

The part of this design I find most promising is to separate the ordering frontier from the proven-state frontier.

The first advances when CKB accepts the next canonical batch. The second advances when a validity proof establishes the resulting EVM state transition.

They need not advance at the same pace.

flowchart TB
    subgraph ORDER["CKB ordering frontier"]
        direction LR
        O0["Order 0"] -->|"Batch A"| O1["Order 1"]
        O1 -->|"Batch B"| O2["Order 2"]
        O2 -->|"Batch C"| O3["Order 3"]
    end

    subgraph PROOF["Verified settlement frontier"]
        direction LR
        P0["State 0"] -->|"Proof A"| P1["State 1"]
        P1 -->|"Aggregated proof B + C"| P3["State 3"]
    end

    O1 -. "Verified ordered prefix" .-> P1
    O3 -. "Verified ordered prefix" .-> P3

    classDef ordered fill:#dfeaff,stroke:#668bd1,color:#203e77
    classDef proven fill:#ddf3e5,stroke:#55a37b,color:#195c3d

    class O0,O1,O2,O3 ordered
    class P0,P1,P3 proven

    style ORDER fill:#f5f8ff,stroke:#a6bce5
    style PROOF fill:#f1fbf5,stroke:#9ed0b3

The ordering commitment would bind each new batch to the previous commitment. Separately, the settlement Cell would hold the latest verified Ethereum state root and the highest proven batch index.

A proof authorising settlement must establish that it has executed the next contiguous range of the canonical CKB-ordered batch history, starting from the previously verified state.

The verifier’s public inputs would bind the Rollup identity, protocol version, execution rules, authenticated batch range, previous state root, new state root and withdrawal commitment.

One detail that deserves particular attention is how the settlement verifier authenticates that historical batch range.

A simple hash chain establishes succession, but does not necessarily provide efficient proofs that an older range belongs to the accepted history.

An append-only authenticated accumulator, CKB-authorised batch receipts, or an equivalent mechanism supporting verifiable prefix extensions may therefore be needed.

The settlement script must verify the relationship against authenticated CKB sequencing state, rather than accepting a prover-supplied account of canonical history. The precise commitment structure and its CKB-VM verification cost remain to be specified.

This separation would let different parties participate without granting any of them permanent authority over the ledger.

A miner or builder could propose a batch without producing its validity proof. A prover could settle a range of batches without deciding their order. A full node could independently reconstruct the EVM state from published transaction data.

There is, however, an important liveness problem.

An unproven batch must not become an irreversible obstruction merely because its builder supplied malformed data or an impossible execution workload.

The batch format, admission rules, resource bounds and treatment of rejected transactions must make every admissible ordered entry deterministically processable.

Otherwise, separating ordering from proving would introduce a denial-of-service mechanism.

The settlement logic must also account for prover disappearance. Permissionless proof generation removes dependence on a particular prover in principle; practical recovery additionally requires public data, reproducible proving inputs and a workable exit path.

These are the areas where I would concentrate much of the protocol design.

How this differs from Godwoken

It would be misleading to discuss an EVM Rollup on CKB without acknowledging Godwoken.

Godwoken and Polyjuice established that an EVM-compatible execution environment could be built above CKB.

The original Godwoken framework was intended to support permissionless Rollup configurations, while its early deployments used an optimistic-Rollup design and PoA-controlled L2 block issuance.

That work addressed a genuine limitation in the ecosystem: Ethereum developers could not otherwise bring their existing contracts and tooling into a scalable CKB-connected environment so readily.

I regard the proposed based design as a continuation of that research direction, with a different emphasis.

Dimension Early Godwoken architecture Proposed Myelin-based ZK Rollup
Execution Polyjuice EVM Ethereum-equivalent execution backend
Block ordering PoA-controlled L2 production in early deployments Permissionless batch proposals, canonical sequence determined by CKB
State verification Optimistic/challenge-oriented design Validity-proof-oriented settlement
L1 responsibility Rollup commitments, contracts and settlement Canonical ordering, L1 data publication, proof verification and settlement
Off-chain infrastructure Godwoken-specific Rollup node Myelin runtime extended with an EVM profile

These are comparisons of architectural models, not a claim that Godwoken never contemplated other consensus mechanisms or ZK configurations.

The distinction I care about is where authority resides.

Godwoken’s early architecture provided an Ethereum-like execution environment whose blocks were produced by an L2 authority set and committed to CKB.

In a genuinely based design, L1 consensus determines which permissionlessly proposed Rollup batches become canonical. The proof system determines whether the resulting state can be settled.

This is not the same as guaranteeing transaction-level fairness.

Builders would still choose the order of ordinary transactions within their batches, subject to whatever inclusion and ordering constraints the protocol enforces.

Meaningful censorship resistance would therefore require an authenticated forced-inclusion path, rather than relying on permissionless batch publication alone.

There is a difference between using CKB as a place to publish Rollup commitments and allowing its consensus to govern the canonical extension of the Rollup’s execution history.

That latter possibility seems underexplored.

What kind of ecosystem could emerge?

The immediate attraction is familiar: Solidity contracts, Ethereum wallets, automated market makers, lending protocols, stablecoins and the wider body of EVM tooling.

But simply creating another EVM environment with a bridge to CKB would offer a rather limited proposition.

The more interesting opportunity is to combine Ethereum’s composable execution environment with CKB-native ownership and settlement semantics.

Consider CKB-native assets such as xUDT tokens. Their custody and issuance constraints could remain enforced through CKB Cells, while representations of those assets circulate in an EVM environment offering AMMs, lending markets and other financial primitives.

An asset might originate under a CellScript-defined issuance or redemption policy on L1 and gain access to EVM liquidity through a proof-secured vault.

Returns to L1 would be authorised against verified withdrawal commitments rather than an operator’s discretionary approval.

The two environments would retain different strengths. EVM provides a familiar programmable financial environment; CKB retains the underlying asset custody rules.

Cross-layer interactions would still be asynchronous, and their bridge contracts would form a significant security boundary. This proposal should not be mistaken for atomic EVM–CKB composability.

The availability of liquid stablecoins would be particularly important.

Deep markets cannot be obtained from execution compatibility alone. A technically correct AMM without useful collateral, stablecoin liquidity or reliable price discovery is not much of a financial system.

Another possibility concerns Fiber.

A mature Fiber ecosystem could provide payment and liquidity-routing services around the Rollup, whilst the EVM environment handles more complex programmable positions and CKB provides asset settlement.

The integration would need explicit message and trust boundaries, but the complementary roles are worth exploring.

There may also be room for RFQ markets, tokenised real-world asset workflows and agent-operated financial applications, especially where the origin of an asset, the rules governing its custody and its trading environment ought to remain separately verifiable.

I find the economic implications interesting as well.

If applications depend on CKB for canonical ordering, batch publication and proof-backed settlement, their activity creates demand for CKB block space.

That is a different relationship from an L2 which merely posts an occasional state commitment whilst most of its economic activity remains within a proprietary ordering system.

It would connect a portion of Rollup activity to the existing L1 fee market.

Of course, the economic significance would depend on actual usage, fee levels and the resulting demand for block space. More L2 transactions do not automatically translate into proportionally greater L1 revenue.

There is also a hard capacity constraint.

CKB’s block space is finite, and publishing complete Rollup transaction data is more expensive than publishing a commitment alone.

A validity proof solves execution verification; it does not solve data availability.

For a trust-minimised Rollup, independent parties must be able to reconstruct the state from available batch data.

Using external DA instead would create a different security model, closer to a Validium. That is the motivation for the second architectural option discussed separately in this thread.

Any claim of economically viable throughput needs to be tested against CKB’s actual data capacity, transaction costs, canonicalisation rate and proof-verification budget.

Why I think this is worth exploring

The idea appeals to me partly because it does not require CKB to imitate Ethereum.

CKB would continue to do what its architecture is particularly well suited to: enforce precise state-transition constraints, establish ownership through live Cells, provide a common consensus history and verify programmes or proofs under CKB-VM.

The EVM can remain the EVM, with its own account state, execution rules and developer ecosystem.

Myelin would provide the off-chain machinery connecting those worlds, with strict boundaries between CKB-native execution, EVM execution and the evidence accepted at settlement.

There are plenty of unresolved questions.

A contested singleton sequencing Cell may be a poor throughput primitive under realistic CKB transaction-proposal conditions. An authenticated forced-inclusion queue is considerably harder to design than an ordinary off-chain mempool.

Efficient verification of historical batch prefixes also needs careful work. Proof verification costs, L1 data economics, bridge safety, prover liveness and emergency exits all deserve serious scrutiny.

I would be interested in challenges to these assumptions, especially from people familiar with CKB consensus, transaction dependencies and script verification.

The ambition is not to recreate Godwoken under a different name.

It is to investigate whether CKB’s PoW consensus and Cell model can provide canonical ordering for permissionlessly proposed EVM batches, without introducing a privileged L2 sequencing authority.

Transaction ordering within those batches would still require explicit rules, particularly around forced inclusion and censorship resistance.

The underlying research question is whether CKB can enforce a uniquely ordered, permissionlessly extensible and efficiently verifiable execution history, while allowing settlement to advance independently of sequencing.

If that can be established, the next question is how best to secure execution and data availability: through validity proofs or optimistic adjudication, with data published on CKB or an external network. The three options discussed here explore different trade-offs within that design space.

That seems a worthwhile direction for Myelin to explore.


References

Option 2: A High-Throughput Alternative: CKB-Based EVM Validium on Myelin

Alongside the proposal to build a CKB-based EVM Rollup using Myelin, I would like to explore a second architectural option: a CKB-Based EVM Validium, designed for applications where transaction throughput and execution costs are particularly important.

Both approaches share the same underlying idea: CKB determines the canonical order of L2 batches, Myelin provides the off-chain execution environment, and validity proofs allow CKB to verify state transitions without executing the EVM itself.

The principal difference concerns data availability (DA).

A conventional ZK Rollup publishes sufficient transaction data to its settlement layer for independent state reconstruction. In our case, that would mean publishing compressed EVM transaction data to CKB.

A Validium instead keeps the full transaction data outside the settlement chain while committing to it on L1.

This distinction could have substantial implications for the throughput Myelin can support.

Neither approach is universally preferable. I think they represent two useful points in the design space, particularly given the different requirements of CKB applications.

1. The throughput question

Suppose Myelin can execute thousands of EVM transactions per second.

If every transaction must eventually have its complete data published on CKB, the system’s sustainable throughput remains constrained by CKB’s available block space, regardless of how efficiently Myelin executes those transactions.

Validity proofs help with verification costs, but they do not eliminate the transaction data required for independent state reconstruction.

For some applications, this trade-off is entirely reasonable. Strong L1 data availability may be more valuable than maximising throughput.

For others, especially high-frequency DeFi applications, an external DA layer may be worth considering.

The alternative is relatively straightforward:

Let Myelin handle transaction intake and EVM execution, publish complete batches to an external DA network, use CKB to establish their canonical order, and settle the resulting state through ZK proofs.

This avoids requiring CKB to carry every EVM transaction while preserving its role as the ordering and settlement authority.

2. Architecture: Myelin execution, external DA, CKB settlement

Users would interact directly with Myelin through familiar Ethereum interfaces, including wallets and JSON-RPC.

Myelin receives transactions into its mempool and can execute them speculatively, providing low-latency feedback before the corresponding batches have been ordered on CKB.

Permissionless builders then assemble transactions into batches and publish their complete contents to an external DA network.

Once the necessary availability evidence has been obtained, a builder submits a compact batch commitment to CKB.

CKB determines which competing batch proposals become part of the canonical history. Myelin follows that history, reconciles its speculative execution with the accepted order, and produces the state transitions subsequently verified through ZK proofs.

flowchart TB
    subgraph APPLICATIONS["Ethereum Application Layer"]
        U["Wallets · Solidity · DeFi"]
    end

    subgraph MYELIN["Myelin · High-Throughput Execution"]
        M["Transaction Mempool"]
        E["Speculative EVM Execution"]
        B["Permissionless Batch Builders"]
        M --> E
        M --> B
    end

    subgraph DA["External Data Availability"]
        D["Full Ordered Batch Data"]
        C["Availability Evidence"]
        D --> C
    end

    subgraph CKB["CKB · PoW Ordering and Settlement"]
        O["Canonical Batch Anchors"]
        S["Verified State Root"]
        V["Asset Vaults"]
        O --> S --> V
    end

    subgraph PROVING["Independent Verification"]
        R["Canonical Batch Replay"]
        P["Validity Proof Generation"]
        R --> P
    end

    U --> M
    B --> D
    C --> O
    O --> R
    D --> R
    P --> S
    E -. "Soft Confirmations" .-> U

    style APPLICATIONS fill:#f3edff,stroke:#9882c8,stroke-width:2px
    style MYELIN fill:#e6efff,stroke:#7192c8,stroke-width:2px
    style DA fill:#fff1df,stroke:#cba165,stroke-width:2px
    style CKB fill:#e2f3e9,stroke:#68a783,stroke-width:2px
    style PROVING fill:#f1effa,stroke:#9386bb

The important separation is between three distinct operations:

Execution occurs inside Myelin, where computation can scale independently of CKB’s block execution budget.

Data availability is provided by an external network responsible for making the committed transaction data retrievable.

Ordering and settlement remain anchored to CKB, which determines the canonical batch sequence and verifies the resulting state commitments.

This does not mean Myelin’s speculative execution results are immediately final. Until a batch becomes canonical on CKB, competing proposals or L1 reorganisations may invalidate that execution order.

Likewise, an ordered batch is not necessarily a proven batch. The settlement frontier may lag behind the ordering frontier while proof generation continues.

3. Based sequencing without publishing every transaction on CKB

The external DA model does not necessarily require abandoning based sequencing.

Instead of including full transaction contents, each CKB batch anchor would contain a commitment to an ordered batch stored elsewhere.

A simplified commitment might look like this:

BatchAnchor {
    rollup_id
    protocol_version
    previous_batch_commitment
    ordered_transactions_root
    da_commitment
    da_policy_id
    execution_rules_hash
    resource_limits
}

The precise format would need to be specified, particularly the relationship between transaction ordering, DA commitments and verification inputs.

A CKB Type Script could maintain a SequencingTip Cell, requiring each valid successor to extend the previous canonical batch commitment.

Any eligible builder could compete to create that successor. CKB consensus would resolve conflicting proposals.

This preserves an important property of based sequencing: no designated L2 operator has exclusive authority to advance the canonical batch history.

There is a qualification worth making. CKB would determine the order of accepted batch commitments, while builders would still choose the transaction order within their proposed batches. Censorship resistance would therefore require a verifiable forced-inclusion mechanism, not merely permissionless batch publication.

A singleton SequencingTip Cell also introduces contention. One possible direction is to aggregate multiple Myelin microbatches into a single CKB anchor, amortising the cost of L1 publication.

flowchart TB
    subgraph EXEC["Myelin EVM Runtime"]
        direction LR
        A["Microbatch A"]
        B["Microbatch B"]
        C["Microbatch C"]
    end

    A --> M["Ordered Batch Manifest"]
    B --> M
    C --> M

    M --> D["External DA Publication"]
    D --> K["CKB Canonical Anchor"]
    K --> F["Myelin Canonical Replay"]
    F --> Z["Aggregated Validity Proof"]
    Z --> S["CKB Settlement"]

    style EXEC fill:#e8f0ff,stroke:#7296cc
    style D fill:#fff0dc,stroke:#c99b63
    style K fill:#dff2e8,stroke:#63a47e
    style S fill:#dff2e8,stroke:#63a47e

This would reduce the frequency at which CKB needs to record individual execution batches.

However, aggregation cannot be allowed to introduce ambiguous ordering or missing transactions. The resulting manifest must define one deterministic transaction sequence, and each batch must execute against the correct predecessor state.

It would also be useful to explore whether CKB’s existing ordering properties could support multiple concurrent anchors without forcing every builder to compete for one live Cell.

That is an interesting research problem in its own right, although any such mechanism would need a verifiable way to establish ordering and completeness without trusting an off-chain indexer.

4. Where the TPS advantage comes from

The performance advantage is not that CKB suddenly becomes faster, or that ZK eliminates the cost of executing EVM transactions.

It comes from amortising the L1 ordering and settlement costs across much larger amounts of off-chain activity.

With external DA, the sustainable throughput is approximately constrained by:

TPS ≤ min(T_EVM, T_DA, T_Prover, B × R_Anchor)

Where:

  • T_EVM is Myelin’s sustainable EVM execution throughput.
  • T_DA is the external DA network’s effective transaction-data throughput.
  • T_Prover is the sustainable proving throughput.
  • B is the average number of transactions per CKB anchor.
  • R_Anchor is the sustainable canonical anchor rate.

This is a simplified steady-state model, rather than a performance estimate.

The significant change is that CKB’s data bandwidth no longer has to accommodate every EVM transaction.

A single batch commitment can represent hundreds or thousands of transactions, subject to execution limits, DA capacity and proof-generation costs.

The remaining CKB constraints concern anchor publication, contention, proof verification and settlement capacity.

Batch aggregation may substantially improve throughput, although larger batches can also increase latency and recovery costs.

This distinction matters for applications that need frequent state updates but can tolerate asynchronous settlement.

For users, Myelin could offer fast speculative execution and soft confirmations, while the stronger CKB-backed settlement guarantee arrives later.

These confirmation levels should remain clearly distinguished.

5. Validity is not availability

The principal cost of this architecture is a different security model.

A validity proof can demonstrate that a state transition was correctly computed from the committed inputs.

It cannot, by itself, guarantee that the transaction data needed to reconstruct that state will remain publicly available.

Consider a batch whose execution is perfectly valid and whose new state root has already been accepted by CKB.

If the external DA providers subsequently withhold the underlying data, independent participants may be unable to reconstruct the current EVM state or generate the witnesses required for withdrawal.

In other words, a valid state commitment is not necessarily a recoverable state.

This distinction is particularly important when real assets are held in CKB vaults.

An unavailable state could leave assets inaccessible even though the settlement script has never accepted an invalid proof.

An emergency timeout alone cannot recover missing state data.

For this reason, I would treat data availability as an explicit protocol security boundary rather than an interchangeable storage backend.

A credible external DA design should investigate independent storage operators, erasure coding, availability attestations, data retrieval, retention obligations and reproducible recovery procedures.

The precise mechanism could involve an established external DA network or a dedicated committee, but its trust assumptions should be visible to users and verifiable to the extent required by the CKB settlement protocol.

An availability certificate is evidence under a particular trust model, not proof that data will remain retrievable indefinitely.

I would also require the data commitment and DA policy to be bound to the batch and its settlement proof. A valid proof for one batch must not be reusable against another data commitment.

The question, then, is not simply whether Validium is faster. It is which applications can accept the additional data-availability risk, and under what recovery guarantees.

6. Two DA profiles, one broader Myelin architecture

I see these as complementary architectural options rather than competing replacements.

Dimension CKB-Based ZK Rollup CKB-Based Validium
EVM execution Myelin Myelin
Canonical sequencing CKB CKB
Validity verification CKB CKB
Full transaction data Published on CKB External DA
Principal throughput constraint CKB data capacity EVM, external DA, proving and anchor capacity
Data recovery assumption CKB data publication and retention Additional external DA availability assumptions
Potential application focus Stronger L1 recoverability Higher-frequency, lower-cost execution

Both models could share substantial parts of Myelin’s execution and evidence infrastructure.

The DA policy, however, should be an explicit part of the protocol identity and settlement rules.

It should not be possible to switch a live state from external DA to CKB DA and retrospectively claim that its entire history has inherited CKB’s availability guarantees.

Any migration between different DA security profiles would require an explicit state transition, with well-defined recovery and asset-conservation properties.

I would initially treat them as separate deployments or security domains, even if much of their runtime code is shared.

7. What could this enable for CKB?

The Validium model is particularly interesting for applications where execution throughput matters more than having every transaction recorded on L1.

This could include order-book exchanges, high-frequency AMMs, trading strategies, derivatives, gaming economies and more complex financial applications built with existing Solidity tooling.

For DeFi, the combination is potentially useful.

CKB-native assets could remain subject to CKB custody and issuance rules, while their representations participate in a much more active EVM financial environment.

Myelin would provide the execution capacity. CKB would remain responsible for the accepted ordering history, verified settlement and underlying asset custody.

In principle, this creates room for high-frequency market activity without requiring every individual trade to occupy CKB block space.

There may also be interesting connections to Fiber, particularly where payment channels and liquidity routing interact with more complex financial positions managed inside the EVM environment.

These integrations would still need explicit bridging and messaging protocols. Neither EVM compatibility nor validity proofs automatically provide liquidity, cross-layer atomicity or secure interoperability.

The economic relationship with CKB also deserves consideration.

A Validium would continue to generate demand for CKB ordering and settlement transactions, but would use less L1 data space than a full rollup.

That may improve scaling while reducing direct L1 data-publication fees. Whether the resulting application activity produces meaningful economic value for CKB would depend on actual usage, fee markets and the settlement model.

I think that is a reasonable trade-off to investigate rather than an outcome to assume.

8. A possible direction for Myelin

The broader idea is to keep Myelin’s high-throughput execution capabilities independent of CKB’s transaction-data bandwidth, without creating another privileged authority over canonical settlement.

CKB would determine the order of accepted batches.

Myelin would execute the transactions and maintain recoverable EVM state.

External DA would supply the complete transaction data under an explicitly defined availability model.

Validity proofs would connect the execution results to CKB settlement.

The most interesting unresolved questions are how to scale permissionless batch ordering, how to make external DA failures manageable, and how to preserve meaningful exit guarantees when the underlying state data may become unavailable.

These are not minor implementation details. They define the security and practical usefulness of the architecture.

Still, I think the distinction between the two models is worth exploring.

A CKB-based ZK Rollup would prioritise stronger L1 data availability and independent reconstruction. A CKB-based Validium could prioritise throughput and execution costs, while acknowledging the additional availability assumptions.

Both could build on Myelin, and both could use CKB as the canonical sequencing and settlement layer.

Three Protocol Challenges and Possible Approaches

A few further implementation details worth making explicit alongside the two options above.

1. SequencingTip contention

A singleton Cell gives us a clean canonical ordering mechanism, but competing builders and CKB’s proposal/commit window may limit throughput.

My preferred starting point would be to separate parallel transaction intake from L1 canonicalisation: Myelin executes microbatches, which are aggregated into bounded epoch manifests, with one CKB sequencing transition per epoch.

This amortises contention rather than eliminating it. Parallel L1 anchors are worth researching, but only if ordering and completeness can be verified without trusting an indexer.

2. Validium data availability and recovery

Validity proofs cannot recover missing state data. I would bind the DA commitment and its security policy directly to settlement verification, supported by independent storage, retrieval challenges and reproducible state checkpoints.

Importantly, emergency withdrawal must depend on an authenticated, recoverable state. A timeout alone cannot restore unavailable data.

This is also why I favour keeping Rollup and Validium as separate security domains, with explicit asset migration rather than interchangeable DA settings.

3. Forced inclusion and censorship resistance

Permissionless builders do not automatically guarantee transaction inclusion.

One possible approach is a small authenticated priority inbox on CKB. Users normally submit through Myelin, but can fall back to L1 when necessary.

The execution proof would enforce processing of a contiguous prefix of admitted requests, including deterministic reverts. A challenged request could additionally constrain subsequent SequencingTip transitions until the relevant prefix is processed.

The challenge mechanism itself must remain permissionless, and its interaction with competing Cell spends needs particular care.

Option 3: A Based Optimistic EVM Rollup with a CKB-VM Court

Exploring a CKB-native alternative to validity-proof settlement

Alongside the ZK Rollup and Validium designs discussed above, I think there is a third option worth examining, particularly in relation to Myelin’s original execution model: a based optimistic EVM Rollup in which disputed execution can be adjudicated directly by CKB-VM.

Unlike Options 1 and 2, this approach would not require a validity proof for every state transition. Instead, Myelin would execute EVM transactions off-chain, publish the necessary transaction data and state commitments to CKB, and allow independent challengers to dispute invalid transitions within a defined challenge window.

The key difference is how CKB establishes execution correctness.

In the ZK approaches, CKB verifies a cryptographic proof of the completed computation. In this optimistic design, CKB would normally accept a state claim provisionally, but retain the ability to adjudicate a disputed portion of the computation itself.

This is closer to Myelin’s original philosophy: off-chain execution with an explicit, CKB-compatible verification path.

It also provides a different way to examine the relationship between CKB-VM, EVM execution and the existing Myelin court machinery.

1. Why consider an optimistic approach?

The previous two options assume that EVM execution can be proven efficiently enough for CKB to verify its results.

That is a reasonable direction, especially given the progress in CKB-VM-compatible cryptographic verification. However, the practical economics of a complete zkEVM proving pipeline remain to be established.

An optimistic design makes a different trade-off.

Correct execution does not require a proof to be generated for every batch. Instead, independent participants monitor state commitments and challenge incorrect results.

If no successful challenge occurs within the specified window, the state can become eligible for final settlement.

This avoids continuous ZK proving, but introduces a different security assumption: an invalid state transition must be detectable and challengeable by at least one honest participant before the challenge period expires.

The distinction matters.

A ZK Rollup makes correctness a prerequisite for settlement. An optimistic Rollup relies on the availability of a credible dispute mechanism to prevent incorrect settlement.

For CKB, the interesting question is whether its programmable verification model can make that dispute mechanism sufficiently precise and economical.

If so, Myelin might retain more of its original CKB-isomorphic execution and evidence architecture rather than relying entirely on an external proving system.

2. Architecture: CKB-based sequencing with optimistic settlement

The sequencing design can remain broadly consistent with Options 1 and 2.

Users submit EVM transactions to Myelin. Permissionless builders construct batches, while CKB determines the canonical sequence of accepted batch commitments.

For this option, I would favour publishing the complete transaction data on CKB, so that independent challengers can reconstruct and verify the proposed execution history.

Myelin executes those batches using an EVM backend and produces a proposed state commitment.

Rather than attaching a validity proof, the proposer submits an optimistic state claim, together with sufficient commitments for a subsequent dispute.

A successful challenge prevents the invalid state from becoming final. An uncontested, eligible claim can advance the settled state once the challenge period has elapsed.

flowchart TB
    U["Wallets and EVM Applications"]
    U --> M["Myelin Transaction Intake"]
    M --> E["EVM Execution Runtime"]
    M --> B["Permissionless Batch Builders"]

    subgraph L1["CKB · Canonical Ordering and Settlement"]
        O["SequencingTip Cell"]
        D["L1 Batch Data"]
        S["Pending State Claim"]
        F["Finalised Settlement State"]
        D --> S
        O --> S
    end

    B --> D
    B --> O
    E --> S

    S --> Q{"Challenge Window"}
    Q -->|"No successful challenge"| F
    Q -->|"Dispute"| C["CKB-VM Court"]
    C -->|"Claim valid"| F
    C -->|"Claim invalid"| R["Reject Claim"]

    style L1 fill:#e8f1ff,stroke:#648fc7,stroke-width:2px
    style C fill:#fff0dd,stroke:#cb9a55,stroke-width:2px
    style F fill:#def3e6,stroke:#60a57e
    style R fill:#fce7e5,stroke:#c77970

One detail is important here: the SequencingTip Cell and the settlement state should remain logically separate.

CKB can establish the canonical order of batches before their execution claims have completed the challenge process. An invalid state claim should not automatically invalidate the underlying batch ordering.

For example, if a proposer computes the wrong state root for an otherwise valid sequence of transactions, another executor should be able to submit the correct result without changing the canonical transaction history.

This means that the optimistic settlement protocol must distinguish between an invalid batch and an invalid claim about the execution of a valid batch.

It must also prevent an invalid or unexecutable batch from permanently obstructing the settlement frontier.

The ordering and claim-admission rules therefore need to define executable batch formats, resource bounds and deterministic transaction-failure semantics independently of the dispute process.

3. The CKB-VM-compatible EVM interpreter

This is where Option 3 differs most substantially from the ZK designs.

Myelin’s existing execution model is built around CKB-compatible Cell transactions, with CKB-VM providing an authoritative environment for script execution.

An EVM interpreter running inside CKB-VM could extend that principle to Ethereum execution semantics.

Conceptually, the relationship would be:

CKB-VM executes an EVM interpreter, which executes EVM bytecode.

The interpreter would need to implement the selected Ethereum fork’s rules, including stack and memory operations, account storage, contract calls, gas accounting, logs and exceptional execution behaviour.

However, I would distinguish two possible execution configurations.

The first is to execute the CKB-VM-hosted EVM interpreter off-chain as the primary execution engine. This offers a relatively direct relationship between ordinary execution and court execution, at the cost of potentially substantial interpretation overhead.

The second is to use a mature native EVM engine, such as revm, for ordinary off-chain execution, while maintaining a CKB-VM-compatible interpreter as the authoritative dispute reference.

That could offer better execution performance, but it creates an additional equivalence obligation: the two implementations must produce identical results for every permitted transaction and Ethereum execution rule.

For a practical EVM L2, I suspect the second approach deserves serious consideration.

The decisive requirement is not that every transaction must execute inside CKB-VM during normal operation. It is that every disputed state transition must admit a sufficiently small, deterministic and CKB-verifiable adjudication.

This is a much narrower and more useful requirement than trying to fit an entire EVM block into one CKB transaction.

4. Bounded fraud proofs instead of whole-block replay

Myelin already has court-bundle machinery for CKB-compatible Cell execution.

However, those bundles cannot simply be reused to adjudicate arbitrary EVM transactions.

An EVM dispute involves Ethereum account state, contract storage, gas accounting and potentially a long sequence of nested calls.

Attempting to replay an entire disputed EVM batch within CKB’s transaction cycle budget would be unlikely to scale well.

A more promising approach is an interactive fraud-proof protocol.

Instead of asking CKB to execute the whole disputed batch, the proposer and challenger progressively narrow the disagreement until it concerns a sufficiently small execution step.

Only that final step is adjudicated in CKB-VM.

flowchart TB
    A["Proposed EVM State Transition"]
    A --> B["Challenger Disagrees"]
    B --> C["Committed Execution Trace"]
    C --> D["Interactive Bisection"]

    D --> E{"Intermediate State Agreement?"}
    E -->|"Find disputed interval"| D
    E -->|"Single bounded step"| F["Authenticated Step Witness"]

    F --> G["CKB-VM Step Verifier"]
    G --> H{"Valid Transition?"}

    H -->|"Yes"| I["Defender Prevails"]
    H -->|"No"| J["Claim Rejected"]

    style D fill:#e4edff,stroke:#7595ca
    style G fill:#fff0dd,stroke:#cba05e
    style I fill:#ddf3e7,stroke:#69a884
    style J fill:#fce7e5,stroke:#c77970

Suppose a batch contains a long sequence of EVM execution steps.

The proposer commits to an execution trace, or to a structure from which authenticated intermediate states can be derived.

A challenger who computes a different result initiates a dispute. Through successive rounds, the two parties identify the first interval in which their state claims diverge.

Eventually, the dispute is reduced to a single bounded transition.

At that point, CKB-VM receives the authenticated pre-state, the disputed operation and the corresponding post-state claim.

The court checks whether the transition follows the specified EVM semantics.

This is the basic intuition. The difficult part is defining what constitutes a bounded step.

A single EVM instruction is not necessarily cheap to verify in isolation. It may require account or storage proofs, bytecode access, memory expansion, gas calculation or information from a nested call.

Therefore, the dispute protocol may need a more granular execution model, with explicit microsteps whose resource consumption is bounded by construction.

The trace commitment must also bind all relevant execution context. Otherwise, a challenger might prove that a particular opcode was executed correctly without establishing that it read the correct storage value or belonged to the committed transaction.

I would make this one of the central design requirements for Option 3.

5. The execution witness is the real difficulty

A useful fraud proof cannot merely compare two EVM state roots and declare one incorrect.

It must establish a verifiable connection between the disputed computation and the authenticated Ethereum state.

A court-facing execution step might need a witness containing:

DisputedStep {
    rollup_id
    execution_version
    canonical_batch_id
    transaction_index
    trace_position
    pre_machine_state_commitment
    post_machine_state_commitment
    opcode_and_execution_context
    account_and_storage_witnesses
    gas_and_refund_state
    execution_trace_proof
}

The exact fields would depend on the selected execution model.

For example, an SSTORE operation may change contract storage and gas accounting simultaneously.

To verify it, CKB must establish that the original storage value was genuinely associated with the committed pre-state, that the operation followed the relevant Ethereum fork rules, and that the resulting value and gas changes match the claimed post-state.

Likewise, contract calls may introduce nested execution, return data and exceptional control flow.

This suggests separating two kinds of state commitments.

The first is the externally visible Ethereum state root, compatible with Ethereum’s account and storage semantics.

The second is an internal execution-trace commitment, representing the EVM machine state at intermediate points in the computation.

The court needs to verify transitions between authenticated intermediate states without requiring a complete reconstruction of the entire execution history.

These commitments need carefully defined relationships. A proof about an internal execution trace is not sufficient unless the trace’s entry and exit states are correctly linked to the committed Ethereum transaction and state roots.

This is precisely where much of the additional engineering would reside.

It also provides a useful test of Myelin’s original design philosophy: can the existing evidence-bound execution framework be extended to a substantially different virtual machine while preserving its strict verification boundaries?

6. What can actually be reused from Myelin?

Option 3 is closer to Myelin’s original architecture, but that should not be mistaken for direct compatibility.

The existing Myelin court path verifies CKB-shaped Cell execution. An EVM fraud-proof system would require new execution witnesses, account-state commitments and dispute rules.

Still, there are several areas where the conceptual correspondence is stronger than in the two ZK options.

Myelin component Possible role in Option 3
CKB-VM execution infrastructure Host the reference EVM interpreter or bounded step verifier
Court evidence model Foundation for authenticated dispute inputs and verification receipts
Session execution frames Bind ordered inputs, pre/post-state commitments and execution evidence
RocksDB state and recovery Persist execution history, trace checkpoints and pending disputes
CKB evidence adapter Verify canonical ordering, transaction inclusion and reorganisation effects
Escrow and exit infrastructure Reference for L1 funding, settlement evidence and withdrawal handling
Existing Cell state model Retained for native sessions, not substituted for Ethereum account state

The closed-validator consensus engines would not determine canonical finality in this design, just as they would not in Options 1 and 2.

The CellTx court format would also need to be extended or replaced at the EVM boundary.

Nevertheless, the overall relationship between off-chain execution, authenticated evidence and on-chain adjudication remains recognisably Myelin.

I think this is worth preserving as a research direction.

It would also allow Myelin’s native Cell sessions and EVM execution profile to share some of the surrounding evidence infrastructure without requiring their execution semantics to become identical.

7. The challenge protocol is part of consensus security

An optimistic court cannot rely on the existence of a challenger interface alone.

It needs an enforceable dispute protocol with precise timing, economic and state-transition rules.

For example, a challenge should bind to one specific optimistic state claim, its canonical batch range, its execution rules and its trace commitment.

A defender must be unable to substitute a different trace once a dispute begins.

Every interactive round needs authenticated inputs, a response deadline and an unambiguous outcome when one party fails to respond.

The economic model must also prevent either party from indefinitely delaying settlement through frivolous challenges or deliberately expensive dispute rounds.

CKB’s PoW reorganisation behaviour introduces another consideration.

A challenge transaction which appears confirmed may subsequently be reorganised out of the canonical chain. Protocol deadlines and settlement eligibility must therefore be defined against CKB-consensus-verifiable conditions, with an explicit treatment of reorganisation risk.

Off-chain wall-clock observations should not be authoritative for settlement.

Most importantly, an invalid state claim must not become final merely because no honest participant was able to retrieve the necessary transaction data in time.

For this reason, I would initially pair Option 3 with complete L1 transaction-data publication.

External DA could be researched separately, but combining optimistic fraud proofs with data that challengers cannot reliably obtain would weaken the security model substantially.

The ability to challenge depends on the ability to reconstruct.

That dependency is more immediate in an optimistic protocol than in a validity-proof system.

8. Finality, withdrawals and the cost of waiting

The two-frontier model discussed in Option 1 remains useful, but the meaning of the settlement frontier changes.

Instead of waiting for a cryptographic validity proof, settlement waits for an optimistic claim to survive its challenge period.

It may be useful to distinguish three states:

  • Executed: Myelin has processed the transaction and produced a speculative result.
  • Canonical: The transaction belongs to a CKB-ordered batch, but its execution claim remains challengeable.
  • Settled: The relevant state claim has completed the dispute process under the protocol rules and has been accepted by CKB.

This distinction would need to be reflected in the RPC and user-facing confirmation model.

A wallet might display a transaction immediately after Myelin execution, but a bridge withdrawal should not be authorised solely on that basis.

For an optimistic design, withdrawals should generally depend on a settled state commitment and an authenticated withdrawal claim.

That introduces a finality delay which does not arise in the same form with validity-proof settlement.

For frequent DeFi trading, users may tolerate that distinction. For cross-chain withdrawals or applications requiring rapid L1 finality, it may become a significant practical disadvantage.

I would therefore avoid presenting Option 3 as inherently faster than the ZK approaches.

It may avoid continuous proving costs and provide inexpensive provisional execution, but the challenge window creates a separate constraint on economically final settlement.

The sustainable transaction throughput and the time required to withdraw securely are different performance measures.

9. The Godwoken precedent

There is an obvious historical connection.

Godwoken already explored optimistic EVM execution on CKB, including gwos-evm, a CKB-VM-compatible EVM execution component.

Its original architecture also included a challenge mechanism, although the repository acknowledged that the challenger implementation needed an interactive redesign to reduce on-chain dispute costs.

This is useful prior work, and it should be examined rather than reproduced unnecessarily.

The proposed distinction would be to combine a bounded EVM dispute protocol with CKB-based canonical sequencing and Myelin’s evidence-oriented execution infrastructure.

That gives Option 3 a different emphasis from early Godwoken deployments, where L2 block production was controlled by a PoA mechanism.

However, moving sequencing to CKB would not make the fraud-proof component automatically simpler.

The important technical contribution would need to lie in the court protocol itself: how to commit to EVM execution, how to isolate a disputed step, how to authenticate its state witnesses, and how to make the resulting adjudication affordable under CKB-VM.

Without solving those problems, this would be another optimistic EVM design anchored to CKB rather than a complete trust-minimised system.

10. How does Option 3 compare with the ZK approaches?

The three options now expose two largely independent design choices: how transaction data is made available, and how state correctness is established.

Dimension Option 1: ZK Rollup Option 2: ZK Validium Option 3: Optimistic Rollup
Canonical sequencing CKB CKB CKB
EVM execution Myelin EVM backend Myelin EVM backend Myelin with court-compatible EVM execution
State correctness Validity proof Validity proof Fraud proof / CKB-VM court
Transaction data CKB External DA CKB
L1 verification Cryptographic proof verifier Cryptographic proof verifier Disputed execution-step verifier
Settlement condition Valid proof accepted Valid proof accepted Challenge period completed without a successful challenge
Additional security assumption Sound proving system Sound proving system and external DA availability Honest, available challenger and functioning dispute protocol
Main engineering difficulty EVM proving and verification EVM proving plus DA security EVM trace commitments and bounded adjudication
Relationship to existing Myelin Runtime and evidence infrastructure Runtime and evidence infrastructure Runtime, execution philosophy and court infrastructure

The main appeal of Option 3 is that correctness can be verified through executable dispute semantics rather than a general-purpose proving system.

Its main drawback is that these semantics must be made sufficiently small, complete and economically enforceable for every possible EVM execution path.

The challenge mechanism is not merely an alternative implementation of the ZK verifier. It introduces a different protocol, with different liveness assumptions and finality characteristics.

This makes the comparison more interesting than a simple question of whether fraud proofs or ZK proofs are cheaper.

11. The question I would like to investigate

I think the decisive experiment for Option 3 would be relatively narrow:

Can a disputed EVM state transition be reduced to a bounded CKB-VM verification step, using authenticated Ethereum state witnesses, with an acceptable cycle cost?

The test should cover more than arithmetic instructions.

Storage updates, contract calls, gas accounting, reverts and state-root consistency are all important, since these are precisely the areas where an apparently simple EVM interpreter can develop semantic differences.

If a bounded court step cannot be implemented economically, then the optimistic architecture loses much of its attraction.

If it can, we gain a potentially useful alternative to continuous ZK proving, together with a stronger connection to Myelin’s existing execution model.

A second question concerns operational economics: how much trace data must be retained, who is expected to run challengers, and what incentives make honest monitoring sustainable?

Those questions are not secondary to the security model. A perfectly implemented court provides little protection if nobody can afford to use it.

For now, I would keep all three options open as research candidates.

Options 1 and 2 explore how CKB can settle off-chain EVM computation through validity proofs, with different data-availability assumptions.

Option 3 explores whether CKB-VM itself can remain the ultimate adjudicator of disputed EVM computation, while CKB PoW supplies canonical sequencing.

That is closer to where Myelin originally began, and I think it deserves examination alongside the ZK designs.

1 Like

A Possible Option 4 (Parked): A CKB-Based Optimistic EVM Layer with External Data Availability

Completing the architectural design space — and why I would leave this option aside for now

There is technically a fourth configuration within the design space discussed above: CKB-based sequencing, optimistic settlement through a CKB-VM court, and external data availability.

It combines the execution-verification approach of Option 3 with the external DA model of Option 2.

The motivation is straightforward. If we can avoid both continuous ZK proving and full transaction-data publication on CKB, we might reduce two major recurring costs of the previous designs.

Myelin would execute EVM transactions off-chain, permissionless builders would publish batches to an external DA network, CKB would establish their canonical order, and disputed execution would be adjudicated through CKB-VM.

This is not an entirely new combination. Arbitrum’s AnyTrust architecture already demonstrates a related approach using optimistic execution and a Data Availability Committee. The important difference is that the proposed CKB design would also aim to eliminate privileged L2 sequencing.

Nevertheless, I would treat Option 4 as a deliberately parked research candidate.

The combination is technically plausible, but the interaction between external data availability and optimistic adjudication introduces a failure mode that neither Option 2 nor Option 3 has in quite the same form.

1. Where Option 4 fits

Option 4 retains the proposed CKB-based sequencing protocol and Myelin EVM execution environment, while combining external data availability with optimistic state verification.

The broader architectural matrix is covered in the synthesis discussion. Here, I would focus on the particular security interaction that makes this configuration difficult to justify.

In an optimistic system, challengers must obtain sufficient transaction data to identify and dispute an invalid state claim. If external DA providers withhold that data, an availability failure may prevent the construction of a successful fraud proof, potentially allowing an invalid claim to become final.

The two mechanisms are conceptually independent, but their security assumptions are not necessarily composable.

The central question is not whether a CKB-VM court can verify a disputed execution step, but whether a challenger can reliably initiate a dispute when the evidence needed to identify that step is unavailable.

That is why I would keep Option 4 within the broader design space, but outside the active research candidates for now.

2. What Option 4 would look like

The ordinary transaction path would resemble Option 2.

Users submit transactions through Myelin’s Ethereum-compatible RPC interface. Myelin executes them speculatively, and permissionless builders assemble ordered batches.

Rather than publishing complete batches on CKB, builders submit them to an external DA network and obtain availability attestations.

A compact Batch Anchor containing the transaction commitment and DA evidence is then published to CKB.

CKB determines the canonical sequence of accepted anchors, while Myelin reconstructs and executes the corresponding transaction history.

The difference appears at settlement.

Instead of generating a ZK proof, a proposer submits an optimistic state claim. Independent challengers reconstruct execution from the externally available batch data and may dispute an incorrect transition.

In the absence of a successful challenge, and once all protocol-defined deadlines and availability obligations have been satisfied, the claim becomes eligible for final settlement.

If a dispute occurs, CKB-VM adjudicates the disputed execution through the bounded court mechanism outlined in Option 3.

flowchart TB
    U["Ethereum Wallets and Applications"]
    U --> M["Myelin EVM Execution"]
    M --> B["Permissionless Batch Builders"]

    subgraph DA["External Data Availability"]
        D["Ordered Transaction Data"]
        C["Availability Certificate"]
        D --> C
    end

    subgraph L1["CKB PoW - Ordering and Settlement"]
        O["Canonical Batch Anchors"]
        S["Optimistic State Claim"]
        T{"Challenge Window"}
        J["CKB-VM Dispute Court"]
        F["Finalised Settlement"]
        R["Invalid Claim Rejected"]

        O --> S
        S --> T
        T -->|"No successful challenge; obligations satisfied"| F
        T -->|"Execution disputed"| J
        J -->|"Claim upheld; settlement conditions satisfied"| F
        J -->|"Claim invalid"| R
    end

    B --> D
    C --> O
    D -. "If retrievable" .-> W["Independent Challengers"]
    W -->|"Execution challenge"| J
    W -. "Availability challenge" .-> T

    style DA fill:#fff0db,stroke:#c99c5d,stroke-width:2px
    style L1 fill:#e5efff,stroke:#7293ca,stroke-width:2px
    style J fill:#fff0df,stroke:#c69a5b
    style F fill:#dff3e7,stroke:#68a681
    style R fill:#fce7e3,stroke:#c87970

In normal operation, this could be relatively inexpensive on CKB.

Only compact batch commitments, availability certificates, state claims and eventual settlement transitions would need to be published. The expensive EVM execution remains off-chain, and fraud-proof computation occurs only when a dispute is raised.

The trade-off is that correctness now depends on two conditions:

  1. An honest challenger must be capable of identifying and disputing an invalid state claim.

  2. The challenger must actually have access to the data necessary to construct that dispute.

The second condition is where the architecture becomes problematic.

3. Where data withholding actually becomes fatal

There are two distinct stages at which external data availability matters to an optimistic dispute, and I think they should be treated separately.

The first is dispute discovery.

Before challenging a state claim, an independent participant normally needs to reconstruct the relevant execution and determine whether the claimed result differs from the correct one.

If the complete batch data is unavailable, the challenger may be unable to determine where execution diverges, or even establish that a divergence exists.

This is the more fundamental problem. A fraud-proof mechanism is only useful if someone can identify a potentially fraudulent claim in time to contest it.

The second is dispute adjudication.

Once a dispute has been initiated and narrowed to a particular execution interval, the court can potentially require the defending party to provide the committed execution data and authenticated state witnesses needed to resolve that interval.

A protocol could treat failure to disclose the required information as a loss for the party responsible for supplying it.

This resembles the role of authenticated preimages in interactive fault-proof systems, such as OP Stack’s Preimage Oracle. The court does not necessarily need the complete historical data in a single transaction; it needs the correct, authenticated evidence for the particular computation being adjudicated.

However, this does not resolve the earlier discovery problem.

A challenger who cannot reconstruct the batch may have no basis for identifying the incorrect execution interval in the first place.

This suggests a possible mitigation: an availability challenge that can be initiated without first proving an execution fault.

A participant could challenge the availability of a committed batch independently of any claim that its execution was incorrect.

The responsible party would then be required to disclose the committed data, or satisfy another precisely defined and enforceable availability obligation, before the associated optimistic state claim becomes eligible for settlement.

Failure to satisfy that obligation could invalidate the claim or prevent its finalisation.

This would turn data availability from a purely external promise into a condition of optimistic settlement.

Yet it introduces further questions. Who must respond to an availability challenge? What exactly must be disclosed? How can the response be authenticated against the original batch commitment? And how do we prevent repeated disclosure requests from making settlement prohibitively expensive?

There is also an important distinction between supplying one authenticated execution witness and making the complete batch available.

The former may be sufficient to adjudicate a particular disputed step without allowing independent participants to reconstruct the entire batch.

I think this is the precise boundary that Option 4 would need to address.

The unresolved question is therefore not simply whether external DA can fail, but whether an optimistic settlement protocol can remain safe and live when data availability itself becomes adversarial.

4. Why an availability certificate is not enough

Myelin already has a provider-neutral DA certificate model.

It can bind a payload to provider signatures, fault-domain requirements, retention commitments and retrieval probes.

These are useful foundations, but they are not equivalent to an enforceable data-availability guarantee for optimistic settlement.

A certificate establishes that certain parties made verifiable commitments under a particular policy.

It does not guarantee that those parties will continue serving the complete data throughout the challenge window.

Providers might correctly sign an availability certificate and subsequently become unavailable, lose the data or deliberately refuse retrieval.

A recent successful retrieval probe would not necessarily resolve the problem either. It demonstrates that retrieval succeeded at a particular observation point, not that complete data will remain accessible to every challenger.

To make this suitable for Option 4, CKB settlement would need to recognise more than a DA commitment. It would need a mechanism for responding safely when availability cannot be established.

There is, however, an important constraint on how such a challenge could be enforced.

CKB cannot directly observe whether an external DA provider has refused a retrieval request.

A challenger claiming that data was unavailable is not, by itself, verifiable evidence of an availability failure. An off-chain HTTP timeout is not an objective condition that a CKB Type Script can independently establish.

An enforceable construction would therefore need to create a positive disclosure obligation.

Once a valid availability challenge is initiated, a designated party must supply the committed data, or satisfy a precisely defined authenticated disclosure requirement, within a CKB-verifiable deadline.

Failure to satisfy that obligation could suspend or invalidate the associated state claim.

Possible mechanisms include:

Availability challenges. A participant initiates an on-chain disclosure request bound to a specific batch commitment. The responsible party must satisfy the request according to the protocol’s verification rules.

Fallback publication. The committed data is published directly to CKB, potentially across multiple transactions if it exceeds the available transaction capacity. The publication must be complete and cryptographically bound to the original batch.

Settlement suspension. An unresolved availability challenge prevents the affected state claim from advancing to final settlement.

Each introduces additional difficulties.

A disclosure protocol must define the responsible party, accepted response format, response deadline and consequences of non-compliance. These conditions must be verifiable by CKB rather than inferred from external network observations.

Publishing complete data on demand may also undermine the economic motivation for external DA.

If repeated challenges can force every batch onto CKB, an attacker may be able to transform the intended Validium-like operating costs into those of a full L1-data Rollup, while imposing additional dispute overhead.

Any such mechanism would need bounded disclosure requirements, suitable bonds, rules for repeated challenges and protection against denial-of-service behaviour.

A partial disclosure mechanism could reduce those costs, but it would need to establish exactly what security property was satisfied. Demonstrating possession of selected chunks or execution preimages is not necessarily equivalent to making the entire batch independently recoverable.

There is also a fundamental recovery limitation.

Fallback publication requires someone to retain the necessary data. If every relevant holder has permanently lost it, no challenge protocol can reconstruct the missing bytes from their commitment alone.

Settlement suspension may preserve safety by preventing an unsupported claim from becoming final, but it does not automatically restore access to user assets.

Preventing an unsafe withdrawal is not the same as guaranteeing that an honest user can withdraw.

A system that freezes permanently whenever DA fails may preserve one form of safety while losing the liveness required for a usable financial network.

5. What the AnyTrust precedent tells us

Arbitrum’s AnyTrust design is relevant because it demonstrates that optimistic execution and external data availability can coexist in a deployed architecture.

AnyTrust uses a Data Availability Committee rather than publishing all transaction data to its parent chain during normal operation.

Committee members sign commitments to store and serve the data. The parent chain receives a compact data-availability certificate.

Its documented trust model assumes that at least two committee members are honest. The certificate threshold is constructed so that, under this assumption, at least one signer will honestly retain and serve the committed data.

If the sequencer cannot obtain the required committee signatures, the system can fall back to ordinary Rollup data publication.

This is an important precedent, but it should not be copied without examining its precise assumptions.

First, publication fallback is not the same as post-certification recovery.

Falling back to L1 when a certificate cannot initially be obtained does not establish that data can always be recovered after an accepted certificate’s signers have become unavailable.

Second, availability commitments have a temporal boundary.

An AnyTrust-style certificate binds its signers to a data commitment and a specified expiration time, under the committee’s honesty assumption.

For a CKB-based optimistic court, the required availability horizon would need to encompass batch publication, the challenge window, adjudication and recovery obligations, with appropriate margins for CKB reorganisations.

Otherwise, a certificate could remain valid evidence of an earlier storage commitment while no longer establishing the availability needed for a later dispute.

Third, AnyTrust retains an additional committee honesty assumption.

Its guarantees do not arise solely from cryptographic signatures or from Ethereum settlement. The committee’s promised behaviour remains part of the security model.

Fourth, its ordinary sequencing model is not the permissionless CKB-based sequencing model proposed here.

Consequently, implementing an AnyTrust-like DA layer would not by itself solve Option 4’s security problem.

We would still need to establish how CKB verifies DA policy, how data faults affect challenge deadlines, and how pending state claims behave under reorganisation or prolonged unavailability.

The existing design is evidence that this combination can be engineered under additional trust assumptions, not that those assumptions disappear.

6. The combined failure model

The security problem with Option 4 is not simply that it inherits the risks of external DA and optimistic settlement. The two failure modes can reinforce each other.

In Option 2, unavailable transaction data may prevent state recovery, but it does not by itself make an invalid execution proof valid.

In Option 3, an invalid state claim may go unchallenged, but the transaction data is published under the L1 DA model, reducing dependence on separate storage operators.

Option 4 combines external availability assumptions with challenge-dependent correctness.

A DA failure may directly prevent the construction of a successful fraud proof.

The risks are therefore not independent.

An optimistic state claim must never become final merely because the data necessary to challenge it was withheld.

Preserving this invariant would require an availability-aware settlement protocol, with enforceable disclosure obligations and explicit handling of unresolved availability challenges.

CKB’s probabilistic finality adds another constraint. Challenge deadlines, disclosure responses and settlement eligibility must remain well-defined under reorganisations, rather than relying on an operator’s wall-clock observations.

The result is a system whose ordering, optimistic adjudication and data-availability state machines must be secured together, not merely implemented as independent modules.

This is considerably more complicated than combining the existing Myelin court and DA components.

7. Is the performance advantage worth it?

Option 4 has a plausible economic attraction.

It avoids routine ZK proving, and external DA reduces the volume of transaction data published on CKB.

The remaining recurring costs would include Myelin execution, DA storage and retrieval, batch anchoring, state-claim publication, continuous independent verification, trace retention and challenge readiness.

However, these savings should be considered against the additional security infrastructure.

An optimistic system needs honest challengers with sufficient computation, data access and capital to prosecute disputes.

An external DA system needs storage providers, availability monitoring, retention guarantees and a credible recovery mechanism.

Option 4 needs both.

Although the normal settlement path may be inexpensive, exceptional paths become more complex and potentially more costly.

An availability challenge might require L1 data publication even when no execution fraud has occurred. A successful disclosure may then need to be followed by an ordinary execution challenge, introducing further transaction costs and settlement delays.

The design also retains an optimistic challenge window, so low-cost speculative execution does not imply rapid final withdrawals.

For high-frequency applications, fast provisional confirmations may be sufficient for many interactions. But assets that must be redeemed on CKB would still face settlement and availability constraints.

This raises a practical question:

Does avoiding continuous ZK proving provide enough additional value over Option 2 to justify an interactive court whose evidence depends on external DA?

I do not think we can answer that positively without actual measurements.

If the EVM proving pipeline becomes sufficiently efficient, Option 2 may offer comparable throughput with a simpler correctness model.

If proving remains prohibitively expensive, Option 4 could become more attractive, but only if its DA and dispute protocols can be made sufficiently robust.

The relevant comparison is not simply the cost of a ZK proof against the cost of one CKB-VM court step.

It is the total cost of maintaining the required security guarantees, including their exceptional failure paths.

8. Why I would park Option 4

For now, I do not see a compelling reason to pursue Option 4 as an independent implementation path.

Its most interesting components can already be investigated through the other three options.

Option 1 establishes the baseline for CKB-backed data availability and validity-proof settlement.

Option 2 explores the throughput and security consequences of external DA.

Option 3 investigates whether EVM execution can be adjudicated through a bounded CKB-VM court.

Option 4 would require substantial progress on both Options 2 and 3, together with an additional protocol governing the relationship between DA failures and optimistic challenges.

I would reconsider it only if an availability challenge could be initiated without first reconstructing the allegedly incorrect execution, and if failure to satisfy that challenge could reliably prevent the affected state claim from finalising.

This would need to be demonstrated under realistic CKB transaction-inclusion conditions, disclosure costs and adversarial challenge behaviour.

Even then, preserving safety would not be sufficient.

The design would still need a credible account of how honest users recover their state or exit when the underlying data is genuinely unavailable.

A protocol that can always prevent incorrect settlement, but cannot recover from permanent data loss, has solved only part of the problem.

Until both properties can be established, combining external DA with optimistic adjudication appears to introduce more protocol complexity than its expected saving in proving costs can justify.

I would therefore keep it documented, but outside the active architecture candidates.

9. Closing perspective

Modularity should not be confused with unrestricted composability.

A settlement mechanism and a DA mechanism cannot necessarily be combined safely merely because each works independently.

Their security properties have to remain valid when the components interact.

In Option 4, the interaction is particularly consequential: the same unavailable data that threatens state recovery may also prevent the court from rejecting an invalid state claim.

An availability-aware dispute protocol could potentially address the latter problem, but it would need to create enforceable disclosure obligations rather than relying on unverifiable reports of failed retrieval.

Even then, the question of user recovery would remain.

This is the central reason I would leave the option aside.

Option 4 remains a technically plausible configuration, but not an equally credible deployment candidate at this stage.

For the present discussion, I would concentrate on the shared CKB-based sequencing protocol, validity-proof settlement under Options 1 and 2, and the bounded CKB-VM court research proposed in Option 3.

If those components eventually mature, the case for revisiting Option 4 can be judged on evidence rather than architectural symmetry.


References

One Sequencing Protocol, Three Security Models

Architectural synthesis, Ethereum precedents, and the open questions for Myelin

Having outlined the three possible architectures above, I think it is worth looking at them together. The more I examine their differences, the less they appear to be three independent L2 designs.

They share a more fundamental proposition: CKB could determine the canonical ordering of an off-chain EVM ledger without delegating that authority to a separate sequencer network.

What changes between the options is how transaction data remains available and how CKB establishes that the resulting execution is correct.

This distinction matters for Myelin. We may not need to select an entire Rollup framework before examining the common protocol beneath it. Equally, sharing that protocol does not mean different settlement mechanisms can be substituted without changing their security assumptions.

I would treat these as related research directions, with CKB-based sequencing as their common foundation.

1. Two architectural choices

The design space has two largely independent dimensions.

Data availability determines where the transaction data required for independent state reconstruction is published and what assumptions users must make about its continued accessibility.

Execution correctness determines whether a proposed state is accepted only after a validity proof, or provisionally accepted subject to an enforceable challenge process.

This gives us the following matrix:

Data availability Validity-proof settlement Optimistic settlement
CKB O1 — Based ZK Rollup O3 — Based Optimistic Rollup
External DA O2 — Based Validium O4 — Optimistic + External DA (Parked)

Option 4 is discussed separately, but I would leave it outside the active research scope. With optimistic settlement, data withholding can prevent challengers from detecting or proving incorrect execution. An availability failure can therefore become a correctness failure unless the dispute protocol explicitly addresses it.

For the other three options, I see a possible common foundation:

  • Permissionless batch construction and CKB-governed canonical ordering.

  • A CKB-native priority inbox for transactions submitted outside ordinary L2 gateways.

  • A versioned EVM execution specification and canonical batch format.

  • Reorganisation-aware execution, recovery and evidence handling through Myelin.

  • CKB-enforced settlement and asset custody, using the verification rules of the selected architecture.

The important qualification is that CKB-based sequencing and permissionless execution are not the same thing.

Any builder might be allowed to propose a batch, but that does not automatically prevent builders or miners from influencing which transactions appear in it. Nor does a unique canonical batch successor guarantee censorship resistance.

Those properties require additional protocol rules.

2. What should actually be shared?

I would separate the common protocol from the settlement-specific machinery.

flowchart TB
    U["Ethereum Wallets and Applications"]
    U --> M["Myelin Transaction Intake"]
    U -.-> I["CKB Priority Inbox"]

    subgraph CORE["Shared CKB-Based Sequencing Protocol"]
        B["Permissionless Batch Builders"]
        Q["Canonical Batch Commitment"]
        O["CKB PoW Ordering"]
        B --> Q --> O
    end

    M --> B
    I --> Q
    O --> E["Myelin Canonical EVM Execution"]

    E --> D{"Data Availability and Verification"}

    D --> Z1["O1 · CKB DA + Validity Proof"]
    D --> Z2["O2 · External DA + Validity Proof"]
    D --> Z3["O3 · CKB DA + Optimistic Court"]

    Z1 --> S["CKB Settlement"]
    Z2 --> S
    Z3 --> S

    style CORE fill:#e5efff,stroke:#6c91cb,stroke-width:2px
    style E fill:#e5efff,stroke:#6c91cb
    style Z1 fill:#e0f3e8,stroke:#64a582
    style Z2 fill:#fff1df,stroke:#c99d62
    style Z3 fill:#eee8fa,stroke:#9984c3
    style S fill:#e0f3e8,stroke:#64a582

The common interface should define what constitutes an ordered batch, which execution rules apply to it, and how its identity is authenticated against CKB.

For example, a settlement-independent batch commitment might bind:

  • Rollup identity and protocol version.

  • Parent batch commitment and canonical sequence number.

  • Ordered transaction commitment.

  • Execution rules and resource limits.

  • Data-availability policy and data commitment.

  • Authenticated priority-inbox cursor and processing commitment.

The exact encoding needs its own specification. In particular, the transaction commitment must bind the actual order of transactions, not merely an unordered collection of transaction hashes.

A settlement module can then refer to this common batch identity when proving or disputing execution.

However, the execution evidence needed by the settlement modules may be fundamentally different.

A ZK prover may require specialised execution witnesses and recursive proof structures. An optimistic court needs authenticated intermediate machine states, trace commitments and a way to isolate a disputed execution step.

Identical Ethereum pre-state and post-state roots do not make those internal representations interchangeable.

Nor does sharing the same data-availability model make settlement protocols easy to switch.

Changing from O1 to O3 would alter finality rules, withdrawal eligibility, verification scripts, pending-claim handling and dispute obligations. A live ledger would need an explicit migration protocol.

The goal should be shared execution semantics and infrastructure, not an unrestricted choice of settlement rules for an already established state.

3. The shared problem I find most interesting: a CKB-native priority inbox

Of the common components, the priority inbox may be the least developed and one of the most important.

Arbitrum’s Delayed Inbox provides a useful precedent. A user can submit messages through Ethereum L1, bypassing the ordinary sequencer. After the protocol-defined delay, those messages can be force-included without the sequencer’s cooperation.

Something similar would be necessary here.

A permissionless Batch Builder can still ignore particular transactions. The absence of a designated sequencer does not, by itself, provide a guarantee that eligible user transactions will eventually be processed.

CKB’s Cell model offers an interesting starting point, but it also presents a particular difficulty.

Suppose we maintain two authenticated objects:

  • SequencingTip Cell, representing the latest canonical batch commitment.

  • InboxTip Cell, representing the priority-message queue and its append commitment.

A sequencing transition would need to prove which priority messages were eligible, which contiguous prefix had been processed, and how the processing cursor advanced.

Merely referencing an InboxTip through cell_deps would not establish that it represents the latest inbox state. A CKB Script cannot arbitrarily search historical blocks and discover every outstanding message.

A malicious builder might otherwise use a stale but authentic inbox commitment to avoid processing newer eligible messages.

One conservative possibility is to consume and recreate the relevant inbox state atomically with the SequencingTip. This could make the relationship enforceable through ordinary Cell consumption rules, although it would also create contention between inbox updates and batch progression.

A more scalable construction might separate append operations from sequencing updates, using an authenticated queue accumulator and a verifiable processing cursor.

But that would require a mechanism for proving completeness and freshness without relying on an indexer’s assertion about the latest queue state.

The intended relationship might look like this:

flowchart TB
    U["User submits priority message"]
    U --> I["Authenticated Inbox State"]
    I --> Q["Append-only Queue Commitment"]

    B["Builder proposes EVM Batch"]
    B --> C["Candidate Sequencing Transition"]
    Q --> C

    C --> V{"Verify queue and batch invariants"}

    V -->|"Valid"| S["Next SequencingTip"]
    V -->|"Invalid"| R["Reject transition"]

    S --> N["Canonical Batch History"]

    style I fill:#e7efff,stroke:#7396cd
    style Q fill:#e7efff,stroke:#7396cd
    style V fill:#fff0df,stroke:#c99b60
    style S fill:#e0f3e8,stroke:#65a680
    style R fill:#fce7e4,stroke:#c87970

There are several invariants I would want to establish:

Ordering safety. The processed priority messages must correspond to an authenticated, contiguous queue prefix. No message may be invented, duplicated or silently skipped.

Freshness. A builder must not be able to use an obsolete queue commitment to bypass messages that the protocol already requires it to process.

Bounded censorship. Once a priority message becomes eligible, builders should not be able to postpone it indefinitely through ordinary batch proposals, provided CKB itself continues admitting valid transactions.

Recovery. Competing spends, rejected proposals and CKB reorganisations must not produce inconsistent inbox cursors or permanently lose an admitted message.

These are proposed protocol properties, not properties already supplied by Myelin.

There is also a performance trade-off. If every batch update must compete with every inbox append for the same Cell, the priority mechanism could become a sequencing bottleneck.

Conversely, separating the two update paths makes it harder for a CKB Script to establish that the builder has observed the appropriate inbox frontier.

That tension between queue freshness, censorship resistance and Cell contention seems particularly worth studying.

CKB’s single-consumption model provides a natural linearisation point, but it does not yet provide a complete priority-inclusion protocol.

4. What Ethereum implementations can teach us

There are mature precedents for much of the execution and settlement machinery involved.

I would prefer to learn from those implementations rather than reproduce their entire stacks inside Myelin.

Myelin option Relevant Ethereum precedent Useful reference
O1 — Based ZK Rollup Taiko Alethia L1-based proposals, canonical batch ordering and proof-backed settlement
O2 — Based Validium Polygon CDK Validium External DA, data commitments and validity-proof settlement
O3 — Based Optimistic Rollup OP Stack Fault Proofs, Asterisc and Godwoken Interactive disputes, authenticated execution witnesses and bounded VM verification

These are engineering references, not exact architectural equivalents.

Taiko is especially relevant to O1 because of its based sequencing design. Nevertheless, its L1 ordering machinery is built around Ethereum, whereas ours would need to accommodate CKB’s PoW consensus, Cell dependencies and proposal window.

Polygon CDK provides a useful example of separating execution correctness from data availability. But its conventional Validium architecture does not itself establish permissionless CKB-based ordering.

For O3, the most interesting precedents may be OP Stack’s fault-proof architecture and Godwoken’s earlier CKB-compatible EVM work.

OP Stack separates the fault-proof programme from the VM used to adjudicate a disputed execution step. Cannon uses MIPS, while Asterisc explores RISC-V.

Since CKB-VM is also RISC-V-based, Asterisc suggests a possible direction for Option 3: rather than implementing a special court for every EVM opcode, we could investigate a constrained RISC-V execution trace with authenticated machine state and bounded step verification.

This would still require a purpose-built CKB-VM step verifier, memory commitments, authenticated preimages and an interactive dispute protocol. Ordinary execution of a RISC-V programme on CKB is not itself a fraud-proof system.

Godwoken is the closer historical reference. Its gwos-evm demonstrates the feasibility of EVM execution in a CKB-compatible environment, while its unfinished interactive-challenger direction illustrates the difficulty of economical optimistic adjudication.

The opportunity for Myelin is therefore not to claim that EVM execution, RISC-V fault proofs or based sequencing are new ideas.

It is to investigate whether CKB’s particular combination of Cell consumption, PoW ordering and programmable verification allows these mechanisms to be assembled under a useful, independently verifiable security model.

5. The three security models are not equivalent

The difference between the options becomes clearer when considering how each might fail.

O1 — Validity proofs with CKB data availability

O1 provides the clearest reference model for validity-enforced settlement and independent reconstruction.

A proposed state transition must satisfy the verification relation before CKB accepts it, while the transaction data needed to reconstruct the execution is published on CKB.

For asset-bearing applications, this is an attractive combination.

The principal risks include proving-system correctness, execution-specification errors, verifier-key management, settlement-script vulnerabilities and prover liveness.

Validity proofs do not eliminate software bugs or guarantee progress when nobody can generate the required proof.

Nor do they remove the bandwidth cost of publishing complete transaction data.

O1 may therefore be particularly suitable for asset-intensive DeFi, lending, stablecoin settlement and other applications where independent reconstruction is worth the additional data cost.

O2 — Validity proofs with external DA

O2 retains validity-enforced state transitions but reduces the data burden on CKB.

The throughput advantage is straightforward: Myelin can execute and prove substantially larger batches without requiring every transaction’s data to occupy CKB block space.

The security difference is equally important.

A valid state transition may become difficult or impossible for users to reconstruct if external DA providers withhold the data.

This can affect withdrawals even when the validity proof is perfectly correct.

O2 should therefore be assessed against the total capital exposed to DA failure, the DA network’s trust assumptions, its recovery procedures and the users’ ability to establish withdrawal claims independently.

It would be misleading to describe Validium as suitable only for low-value transactions. A high-frequency exchange might process small individual trades while holding substantial collateral or liquidity.

O2 is better understood as a throughput-oriented option whose usefulness depends on whether its additional DA assumptions are acceptable for a particular application.

O3 — Optimistic settlement with CKB data availability

O3 preserves the stronger L1 data-publication model but replaces continuous proving with challenge-enforced correctness.

This is potentially closer to Myelin’s original court and evidence philosophy.

However, its security depends on a functioning dispute mechanism and on at least one honest challenger being able to obtain the relevant data, detect incorrect execution and complete the challenge within the permitted window.

The operating cost does not disappear simply because routine ZK proving is unnecessary.

Independent verification, execution-trace retention, dispute readiness, transaction fees and challenge-related capital requirements all become part of the security budget.

O3 also needs a substantially different settlement state machine, including optimistic claims, challenge deadlines, bonds, trace commitments and final adjudication rules.

It may be attractive if bounded CKB-VM fraud proofs prove economical and the application can tolerate challenge-window finality.

Its distinctive research opportunity lies in the court mechanism, not merely in avoiding proving costs.

A comparison of the practical trade-offs

Dimension O1 · ZK Rollup O2 · Validium O3 · Optimistic Rollup
Canonical ordering CKB CKB CKB
Full transaction data CKB External DA CKB
Execution correctness Validity proof Validity proof Fraud proof / CKB-VM court
Strong settlement depends on Verified proof Verified proof and external DA assumptions for recovery Completed challenge process
Principal operating cost Proving and L1 data Proving and external DA Verification, trace retention and L1 data
Main availability concern Prover liveness and historical data access External DA withholding or loss Challenger availability and dispute liveness
Throughput pressure CKB data bandwidth External DA, execution, proving and anchors CKB data bandwidth and batch processing
Withdrawal characteristics Proof-backed settlement Proof-backed, but recovery depends on DA Challenge-window settlement
Potential fit Settlement-sensitive DeFi High-frequency applications accepting DA assumptions Applications accepting delayed finality and challenge assumptions

These are properties of the proposed architectures, not performance measurements.

In particular, rapid speculative execution on Myelin should not be confused with settled finality on CKB.

All three may offer fast transaction feedback, but the conditions under which a user can safely withdraw assets are different.

6. What Myelin can actually contribute

The common architecture should not obscure the extent of new work required.

Myelin currently provides a CKB-aligned Cell session runtime. Its state commitments concern Cell execution, not Ethereum’s account and storage state. Its closed-validator finality mechanisms do not provide CKB-based sequencing.

Consequently, none of these options is simply a configuration change to the existing runtime.

The reusable parts are primarily its execution orchestration, durable storage, checkpointing, recovery, CKB evidence handling and disciplined approach to binding claims to verifiable inputs.

Its current CKB-VM execution and court mechanisms are particularly relevant to the thinking behind O3, although their existing CellTx evidence formats cannot adjudicate arbitrary EVM execution without substantial changes.

A dedicated EVM execution backend, Ethereum state storage and JSON-RPC interface would still be required.

Similarly, the current Myelin DA certificate model is an off-chain evidence mechanism. Making a DA policy an enforceable condition of CKB settlement would require additional consensus-critical verification logic.

I would therefore favour a separate EVM Rollup profile or closely related module, rather than altering Myelin’s original Cell-native semantics to accommodate Ethereum execution.

That preserves the existing research direction while allowing its infrastructure to support a different execution model.

7. What would decide between the options?

I do not think architectural preference alone is sufficient.

Three experiments would provide much stronger evidence.

First: the shared sequencing protocol.

Can competing permissionless builders advance a canonical SequencingTip reliably under CKB’s proposal/commitment rules? Can successor transactions be prepared in advance without unacceptable wasted work or fragility under reorganisations?

More importantly, can a priority inbox enforce authenticated, contiguous inclusion without introducing a global Cell contention problem?

A demonstration that one SequencingTip successor can be committed would not answer these questions. We need to understand adversarial progress, queue freshness and recovery.

Second: end-to-end validity-proof settlement.

Can a realistic EVM proving pipeline produce proofs whose final verifier is compatible with CKB-VM, with the correct execution rules, state roots and batch commitments bound as public inputs?

The relevant measurement is not merely the cost of verifying a standalone Groth16 proof.

It is the complete proving and settlement cost under representative EVM workloads, including state witnesses, proof aggregation and verification-key constraints.

This experiment informs both O1 and O2.

Third: bounded optimistic adjudication.

Can a disputed EVM transition be reduced to a CKB-VM-verifiable execution step with authenticated account, storage and machine-state witnesses?

The tests should cover storage writes, nested calls, reversions, gas accounting and state-root consistency, rather than only arithmetic instructions.

The cost of that final step matters, but so does the ability to construct a complete interactive dispute protocol around it.

An affordable isolated court step is a necessary result, not sufficient evidence that O3 is production-ready.

Each experiment should define conditions under which the corresponding design would be rejected or materially revised, rather than merely establishing that a demonstration can be made to work.

8. Where I would focus the discussion

My current inclination is to treat O1 as the reference model for validity-enforced settlement with CKB data availability, O2 as an alternative for throughput-sensitive applications, and O3 as a distinct research direction into CKB-native adjudication.

I would not regard that as a final architectural choice.

The more immediate question is whether the common sequencing assumptions can actually be enforced under CKB’s transaction model.

In particular, I would welcome criticism of two points.

First, can a CKB-native priority inbox guarantee the processing of eligible messages without forcing every batch builder and inbox publisher to contend for the same live Cell?

This seems to be the most consequential unresolved part of the proposed based sequencing protocol. A unique successor is useful, but it is not enough to guarantee censorship resistance.

Second, which correctness mechanism is better suited to CKB-VM in practice: verification of compressed EVM validity proofs, or bounded adjudication of authenticated EVM execution steps?

Both have credible precedents in the Ethereum ecosystem. Neither has yet been established as the preferable complete settlement system for this proposed CKB architecture.

I suspect the lasting contribution of this work, if it succeeds, may be less about selecting a particular Rollup framework and more about establishing a reusable protocol for permissionless off-chain execution anchored to CKB’s own ordering and verification rules.

That would give Myelin a role beyond another EVM-compatible runtime, while leaving room for different applications to make explicit choices about data availability, correctness and recovery.

I would be interested to hear where others think these assumptions are weakest, particularly from anyone familiar with CKB transaction dependencies, UTXO-based sequencing, or the existing EVM fault-proof systems.


References

Re-scoping: this direction will proceed as a separate project

After reviewing how much of Myelin these designs would actually use, I want to correct the framing rather than let it stand.

Here is the honest accounting on 9th Oct:

The three options above need an EVM execution backend, an Ethereum state model and a new CKB-based sequencing protocol, none of which Myelin provides today. Direct code reuse would be limited to generic infrastructure: hashing primitives, a storage shell, the CKB follower adapter and some evidence-handling patterns. What genuinely transfers is the research trajectory.

The based EVM layer will therefore be treated as a separate protocol and project.

I have edited the title accordingly. Comments on where these assumptions are weakest remain very welcome.

3 Likes