Retrospective LLM-Based Complexity Evaluations

EIP complexity assessment

EIP-7939: Count leading zeros (CLZ) opcode

Assessed in Osaka / Fusaka. The score describes the EIP text available at the assessment cutoff, not the EIP as it stands today.

RetrospectiveOsaka / FusakaAssessment cutoff 2025-07-02Added after cutoffLayers: execution
LLM Completescore 6
Human Not available· Human complexity assessments were not produced for this fork; only the LLM assessment exists.

LLM assessment

Evaluated on: · Spec revision: 2025-06-09 · c43098e67b

Scope at the cutoff. At the information cutoff, EIP-7939 proposed one new execution-layer opcode, CLZ at byte 0x1e, that consumes one 256-bit stack word and returns its count of leading zero bits, with zero explicitly returning 256. The opcode is stateless, has no data portion or dynamic stack behavior, and has a fixed gas cost of 3; the proposal also supplied reference algorithms and representative boundary test cases.

6LowLow
Evaluator
LLMChecklist v2
Confidence
High
Under-specified at assessment cutoff
No
Plausible range
6–6 (Low)
Assessment cutoff
2025-07-02 · EIP revision c43098e67b (2025-06-09)
Score bands · Checklist revision 2
  • Low <12
  • Medium 12–22
  • High ≥23

28 criteria scored 0–3 (4 in exceptional cases; cross-EIP interactions is uncapped); nominal maximum 84.

Complexity profile

Each segment is one criterion's contribution to the LLM total. Hover or focus a segment for its score and rationale.

Top complexity drivers

  1. Added opcodes1
  2. EVM Gas rule changes1
  3. Patterns affecting pre-existing tests1
  4. Security risks1

Under-specified at assessment cutoff: No

The EIP text available at the assessment cutoff left material behavior unresolved. The affected criteria and the plausible total range record that uncertainty.

The assessor found no material behavior left unresolved by the EIP text at the cutoff.

Criterion breakdown

EIP-7939 Osaka / Fusaka: LLM criterion scores and rationale
CriterionScoreWhy this scoreEvidence / uncertainty
Added opcodes1This is exactly one simple opcode with no data portion, no complex stack mechanics, and a constant gas cost, matching anchor 1.
  • eip.md · Specification, lines 41-44 and 111 One opcode, CLZ at 0x1e, pops one word, pushes one word, and has constant gas cost 3.
Confidence: High
EVM Gas rule changes1Adding a fixed entry to the EVM gas schedule updates the existing constant-cost accounting mechanism, matching anchor 1; it does not introduce dynamic or new gas-accounting machinery.
  • eip.md · Specification, lines 41-44 and 111 The proposal adds CLZ and assigns it the fixed gas cost 3.
Confidence: High
Patterns affecting pre-existing tests1Existing post-activation invalid-opcode coverage that used byte 0x1e must change its expected behavior. That is a minor, narrowly targeted subset of pre-existing tests and matches anchor 1.
  • eip.md · Specification, line 41; Backwards Compatibility, lines 135-137 Opcode byte 0x1e becomes CLZ even though the opcode was not previously present.
Confidence: Medium
Uncertainty: The EIP does not enumerate existing invalid-opcode tests, so the size of the affected subset is inferred from assigning a previously absent opcode byte.
Security risks1The new consensus operation must be implemented consistently, but its security surface is self-contained, independently testable, and does not alter existing state or stakeholder invariants. This matches anchor 1.
  • eip.md · Security Considerations, lines 183-185 The EIP describes CLZ as stateless with bounded low memory, compute, and proving cost, and concludes it is not exploitable for denial of service.
Confidence: High
Performance risks1The new execution mechanism warrants isolated benchmarking to substantiate its gas price, but it is self-contained and does not alter existing performance behavior. This matches anchor 1.
  • eip.md · Rationale - Gas cost, lines 127-133; Security Considerations, lines 183-185 CLZ is benchmarked directly against ADD and is described as having low, worst-case constant compute, memory, and proving costs.
Confidence: High
Edge/boundary conditions1CLZ is one boundary-prone mechanism, principally around zero and each leading-bit transition. This matches anchor 1 rather than the multiple-mechanism anchors.
  • eip.md · Specification, lines 43-79; Test Cases, lines 139-180 The result changes at leading-bit positions, zero has the special result 256, and the test vectors exercise zero and representative high and low boundaries.
Confidence: High
Show 22 zero-score criteria
Zero-score criteria (Checklist revision 2)
CriterionScoreWhy this scoreEvidence / uncertainty
Modified opcodes0No existing opcode behavior is modified or deprecated, so anchor 0 applies.
  • eip.md · Specification, line 41; Backwards Compatibility, lines 135-137 CLZ is expressly introduced as a new opcode that was not present before.
Added precompiles0No precompile is introduced, matching anchor 0.
  • eip.md · Abstract, lines 13-15; Specification, line 41 The feature is an opcode at byte 0x1e, not a precompile address.
Modified precompiles0No existing precompile behavior or gas schedule is modified; anchor 0 applies.
  • eip.md · Specification, lines 39-44 and 111 Only new opcode semantics and that opcode's cost are specified.
Added system contracts0No system contract is introduced, matching anchor 0.
  • eip.md · Abstract, lines 13-15; Specification, lines 39-44 EIP-7939 adds an opcode, not a contract or contract-mediated action.
Modified system contracts0No pre-existing system-contract code, state, or behavior is directly or indirectly modified, matching anchor 0.
  • eip.md · Specification, lines 39-44; Security Considerations, lines 183-185 CLZ is a stateless stack operation with no system-contract action.
State-access ordering within opcode execution0The opcode performs no state access, so neither the position of a state access nor gas charging relative to one changes; this is anchor 0.
  • eip.md · Specification, lines 41-44; Security Considerations, lines 183-185 CLZ only transforms one stack value and is expressly described as stateless.
Blob gas accounting changes0No blob object, blob validation, or blob gas rule is introduced or modified, matching anchor 0.
  • eip.md · Abstract, lines 13-15; Specification, lines 39-44 and 111 The entire change is a stack-word opcode with an ordinary fixed EVM gas cost.
State gas accounting changes0The proposal has no state-gas charging site, state-byte rate, budget, reservoir, or spill interaction, so anchor 0 applies.
  • eip.md · Specification, lines 41-44 and 111; Security Considerations, lines 183-185 CLZ is a fixed-cost stateless stack operation and performs no state write.
New EVM gas refund0No gas-refund mechanism is introduced, matching anchor 0.
  • eip.md · Specification, line 111 The proposal specifies only a gas charge of 3 for CLZ and no refund behavior.
New transaction types0No transaction type is introduced, matching anchor 0.
  • eip.md · Abstract, lines 13-15; Specification, lines 39-44 The proposal adds only an opcode and defines no transaction envelope.
New or modified transaction validity mechanisms0Transaction validity and intrinsic-gas calculation are unchanged, so anchor 0 applies.
  • eip.md · Specification, lines 39-44 and 111 The specified rules concern execution of CLZ and its fixed execution gas only.
New block / header fields0No block or block-header field is introduced, matching anchor 0.
  • eip.md · Abstract, lines 13-15; Specification, lines 39-44 The proposal is limited to an execution opcode and specifies no block data.
Encoding changes (RLP/SSZ)0No transaction, block, RLP, SSZ, or interface encoding changes are introduced, matching anchor 0.
  • eip.md · Specification, lines 39-44 CLZ operates on an already-decoded EVM stack word and adds no external encoding.
Block syncing changes0No block RLP field or validation rule is introduced, so no client-syncing test mechanism changes and anchor 0 applies.
  • eip.md · Abstract, lines 13-15; Specification, lines 39-44 The proposal only defines an EVM stack opcode and does not alter blocks.
New fork activation mechanism0Activation requires no state transition or modification of an existing internal variable at the activation block, matching anchor 0.
  • eip.md · Backwards Compatibility, lines 135-137; Security Considerations, lines 183-185 CLZ is merely absent before introduction and is stateless.
Engine API changes0No Engine API field, endpoint, or communication mechanism changes; anchor 0 applies.
  • eip.md · Specification, lines 39-44 and 111 The change is confined to opcode execution and its gas cost.
Transition-tool interface changes0No transition-tool input or output field, endpoint, or fork-block awareness interface is required, matching anchor 0.
  • eip.md · Specification, lines 39-44 and 111 The specification adds only opcode semantics and a fixed gas cost.
New invariant on pre-existing tests0Tests unrelated to CLZ do not gain a new artifact or invariant to assert; the narrow invalid-opcode expectation change is a rework pattern, not an additional assertion. Anchor 0 applies.
  • eip.md · Backwards Compatibility, lines 135-137; Test Cases, lines 139-180 The change is a newly available opcode with tests local to its own outputs.
New test-framework primitives0Existing opcode execution, stack-result, exceptional-stack, and gas test primitives suffice; no new expectation type, modifier, or helper abstraction is implied. This matches anchor 0.
  • eip.md · Test Cases, lines 139-180 The supplied tests are ordinary opcode sequences with a single expected stack word.
Cryptography0Counting leading zero bits introduces no cryptographic primitive or modification. A possible cryptographic use case does not trigger the cryptography anchor, so the score is 0.
  • eip.md · Motivation, lines 21-31; Specification, lines 41-44 Cryptographic schemes are only listed as a possible user; CLZ itself counts bits.
Cross-EIP interactions0The opcode can be specified and tested independently and no interacting EIP is established by the historical text, matching anchor 0.
  • eip.md · Specification, lines 39-44; Backwards Compatibility, lines 135-137 CLZ is defined as a standalone new opcode; the proposal identifies no EIP dependency, modification, or conflict.
Unspecified behavior requiring cross-client consensus0For every possible EVM word, the specification determines the CLZ result and supplies the execution metadata needed for testing. No constructible case needs an additional cross-client semantic agreement, so anchor 0 applies.
  • eip.md · Specification, lines 41-111 The opcode byte, stack effect, result over a 256-bit word including zero, and gas cost are specified, with equivalent reference algorithms.
Assessment provenance
Assessed EIP revision
ethereum/EIPs@c43098e67b EIPS/eip-7939.md committed 2025-06-09 · information cutoff 2025-07-02T17:49:36Z
Current master · File history · blob 1a4aed0bca · sha256 8f03612a4d19
Rubric
Checklist revision 2 · ethspecs/pm@3d8c0128c5
Evaluator
gpt-5.6-sol at xhigh reasoning effort · isolation bubblewrap_one_eip_capsule_v1
Source record
Frozen research record research/tasks/05-retrospective-complexity-assignment/outputs/fork-eips/osaka/eip-7939.yaml · sha256 c87c3c2649da
Criterion legend and glossary

Every stacked bar, comparison matrix, and criterion table on this site uses the same criterion colours, abbreviations, and order. Colour marks the criterion group; the abbreviation and name identify the criterion. Scores are 0–3 per criterion (4 is exceptional; cross-EIP interactions is uncapped).

EVM surface

Opcodes, precompiles, and system contracts that are added or modified.

  • Added opcodes
    Introduces new opcodes
    Score anchors
    0
    No new opcodes are introduced.
    1
    A new simple opcode is introduced (no data portion, no complex stack mechanics, and a constant gas cost).
    2
    Multiple new simple opcodes are introduced, or a single new complex opcode is introduced (has data portion, or complex stack mechanics, or a dynamic gas cost).
    3
    Multiple new opcodes are introduced, and at least one of them is complex (has data portion, or complex stack mechanics, or a dynamic gas cost).
    • Cryptography opcodes are not considered complex by default. Refer to the "Cryptography" section for a separate assessment.
  • Modified opcodes
    Modifies pre-existing opcodes
    Score anchors
    0
    No pre-existing opcode modifications are introduced.
    3
    At least one pre-existing opcode's behavior is modified (not including gas changes) or a pre-existing opcode is deprecated.
  • Added precompiles
    Introduces new precompiles
    Score anchors
    0
    No new precompiles are introduced.
    1
    A new simple precompile is introduced (constant input length, constant gas cost).
    2
    Multiple new simple precompiles are introduced, or a single new complex precompile is introduced (dynamic input length or dynamic gas cost).
    3
    Multiple new precompiles are introduced, and at least one of them is complex (dynamic input length or dynamic gas cost).
    • Cryptography precompiles are not considered complex by default. Refer to the "Cryptography" for a separate assessment.
  • Modified precompiles
    Modifies pre-existing precompiles logic or gas-accounting
    Score anchors
    0
    No pre-existing precompiles are modified.
    1
    At least one pre-existing precompile has its gas schedule modified.
    2
    Multiple pre-existing precompiles have their gas schedule modified, or a single pre-existing precompile has its behavior modified.
    3
    The behavior of multiple pre-existing precompiles, or a single complex pre-existing precompile modified.
  • Added system contracts
    Introduces new system contract, stateful or not
    Score anchors
    0
    No new system contracts are introduced.
    1
    A new system contract is introduced that is not stateful nor does it trigger a new system action (e.g. requests to the consensus layer).
    2
    Multiple new system contracts are introduced or a single new system contract that is either stateful or triggers a new system action (e.g. requests to the consensus layer).
    3
    Multiple new system contracts are introduced and at least one of them is either stateful or triggers a new system action (e.g. requests to the consensus layer).
  • Modified system contracts
    Modifies pre-existing system contracts
    Score anchors
    0
    No modifications to pre-existing system contracts are introduced, directly or indirectly.
    1
    Does not directly modify any system contract, but its behavior has minor indirect effects on one or more system contracts.
    2
    Does not directly modify any system contract, but its behavior has major indirect effects on one or more system contracts.
    3
    At least one pre-existing system contract code or state is modified, which would involve irregular state transition or a similarly complex transition methodology.

Gas and accounting

Execution, blob, and state gas rules, refunds, and where charges happen inside opcodes.

  • EVM Gas rule changes
    New EVM gas accounting rules
    Score anchors
    0
    No gas accounting changes.
    1
    Existing gas accounting mechanism is updated.
    2
    A new gas accounting mechanism is introduced but it does not affect existing mechanisms nor does it affect existing tests.
    3
    A new gas accounting mechanism is introduced and affects existing mechanisms which in turn affect existing tests.
  • State-access ordering within opcode execution · Checklist revision 2 only
    Changes *where inside an opcode's execution* state is accessed, or where gas is charged relative to that access. Because a state access is recorded in the block-level access list only if execution had enough gas to reach it, this ordering is consensus-critical: moving it changes the BAL at every gas boundary of every affected opcode.
    Score anchors
    0
    No change to where state is accessed, or to where gas is charged relative to a state access, within any opcode.
    1
    A single opcode's state-access or gas-charge ordering changes.
    2
    Multiple opcodes' ordering changes, or a new state-accessing operation is introduced whose position in the order must be settled.
    3
    The ordering rule changes for a whole class of state-accessing opcodes at once, or what counts as a recordable state access is redefined — requiring existing BAL vectors to be re-derived across opcodes and forks.
    • Distinct from "Modified opcodes", which asks whether an opcode's **result** changed. This row asks about the **path to the result**, which is observable even when the result is identical. An EIP can be 0 on that row and 3 on this one.
    • Score changes **to** the ordering. Do not score the fact that state accesses are observable — they always are.
    • Each boundary must be re-tested against every other dimension that can change the answer (cold/warm, static/non-static, delegated/direct, revert/success), so the case count grows multiplicatively rather than additively. Note this explicitly under Special Considerations.
  • Blob gas accounting changes
    New Blob gas accounting rules which potentially affect pre-existing tests
    Score anchors
    0
    No blob gas accounting changes.
    1
    Existing blob gas accounting mechanism is updated.
    2
    A new blob gas accounting mechanism is introduced but it does not affect existing mechanisms nor does it affect existing tests.
    3
    A new blob gas accounting mechanism is introduced and affects existing mechanisms which in turn affect existing tests.
  • State gas accounting changes · Checklist revision 2 only
    New state gas accounting rules. State gas is the cost of *writing* state, as opposed to accessing or executing it: `StateGasCosts`, `COST_PER_STATE_BYTE`, the block-level state gas budget, and the spill path into execution gas.
    Score anchors
    0
    No state gas accounting changes.
    1
    An existing state gas cost or `STATE_BYTES_PER_*` rate is adjusted.
    2
    A new state-gas-charging site is introduced, or the block-level state gas budget or reservoir allocation is modified.
    3
    A new state gas charging mechanism is introduced, or the spill interaction between state gas and execution gas is modified, affecting existing gas tests.
    • Harder to test than blob gas: the spill path means state gas cannot be metered independently of execution gas, and some costs (e.g. `NEW_ACCOUNT`) are state-dependent.
  • New EVM gas refund
    New gas-refund mechanism
    Score anchors
    0
    No new gas-refund mechanisms are introduced.
    1
    A new simple gas-refund mechanism is introduced that does not affect either existing tests or existing gas-refund mechanisms.
    2
    A new complex gas-refund mechanism is introduced or a simple mechanism that affects existing tests or existing gas-refund mechanisms.
    3
    A new complex gas-refund mechanism is introduced that affects existing tests or existing gas-refund mechanisms.

Blocks, transactions, and encoding

Transaction types and validity, block and header fields, encodings, syncing, and activation-time changes.

  • New transaction types
    Introduces a new transaction type
    Score anchors
    0
    No new transaction types are introduced.
    3
    A new transaction type is introduced.
  • New or modified transaction validity mechanisms
    Creates new or modifies pre-existing transaction types' validation mechanisms
    Score anchors
    0
    No changes are introduced to the validity rules of existing transaction types or to their intrinsic gas cost calculation.
    1
    Minor adjustments are introduced to validity rules or intrinsic gas cost calculation, but they do not significantly affect existing tests.
    2
    Changes to validity rules or intrinsic gas cost calculation affect existing tests, but require only limited updates to test cases and no redesign of the testing infrastructure.
    3
    Changes to validity rules or intrinsic gas cost calculation require extensive rework or redesign of the tests or testing infrastructure.
  • New block / header fields
    Introduces new block or block header fields
    Score anchors
    0
    No new block or header fields are introduced.
    3
    A new block or header field is introduced.
  • Encoding changes (RLP/SSZ)
    Introduces encoding changes at the transaction/block/interfaces level
    Score anchors
    0
    No encoding changes are introduced at the transaction, block, or interfaces levels.
    3
    An encoding change is introduced at transaction, block or interfaces level (e.g. RLP -> SSZ).
    • "Interfaces level" includes the Engine API. Score an Engine API encoding change (e.g. JSON -> SSZ) here.
  • Block syncing changes
    Modifies block RLP validation mechanisms that require test client syncing.
    Score anchors
    0
    No new RLP validation mechanism is introduced.
    1
    A single simple RLP validation mechanism is introduced.
    2
    Multiple simple RLP validation mechanisms are introduced or a single complex one.
    3
    Multiple RLP validation mechanisms are introduced and at least one of them is deemed complex.
  • New fork activation mechanism
    Modifies state, internal variables, or similar, at the fork activation block
    Score anchors
    0
    No state modifications, internal variables or similar are modified at the fork activation block.
    3
    Either a state modification or internal variables are modified at the fork activation block.
    • Initialization of new internal variable is not considered a modification.

Client interfaces

Engine API and transition-tool interface changes.

  • Engine API changes
    Introduces new fields to the Engine API directives
    Score anchors
    0
    No new fields or communication mechanisms are introduced to the Engine API.
    1
    A single new field is introduced in one of the Engine API endpoints.
    2
    Multiple fields are introduced to one or multiple Engine API end points, or a new Engine API end-point is introduced.
    3
    Multiple fields are introduced to one or multiple Engine API end points and a new Engine API end-point is introduced.
  • Engine API encoding changes · Checklist revision 1 only
    Engine API encoding changes (the revision-1 template defines no anchor text for this row).
  • Transition-tool interface changes
    Modifies or adds new fields to the transition tool interface.
    Score anchors
    0
    No modifications to the transition tool interface are required.
    1
    A single new field needs to be introduced to the transition tool interface.
    2
    Multiple new fields or a new mechanism has to be introduced to the transition tool interface.
    3
    Multiple new fields and a new mechanism has to be introduced to the transition tool interface.
    • Special consideration must be paid to this section if the EIP introduces a mechanism that requires the state transition tool to be aware whether the block it is processing is the fork-activation block.

Testing impact

Rework, new invariants, and new primitives required in the test framework.

  • Patterns affecting pre-existing tests
    Implements a new validation mechanism or rule that translates in reworking pre-existing tests
    Score anchors
    0
    No pre-existing tests are affected by this change.
    1
    Minor subset of existing tests are affected by this change.
    2
    Considerable subset of existing tests are affected by this change but involves only a contrived category of tests.
    3
    Major subset of existing tests are affected, including diverse category of tests (benchmarks, static, multiple forks, etc.).
  • New invariant on pre-existing tests · Checklist revision 2 only
    Tests that are **not about this EIP** must nonetheless assert something this EIP produces. Their logic does not change; they gain a new thing to check.
    Score anchors
    0
    Pre-existing tests assert nothing new.
    1
    A narrow, contrived category of pre-existing tests gains a new assertion.
    2
    A broad category gains a new assertion, applied mechanically.
    3
    Every test in the fork gains the assertion regardless of what it tests, and pre-fork vectors must be re-derived to satisfy it.
    • Paired with the row above, and easy to confuse with it. "Patterns affecting pre-existing tests" asks whether existing tests must be **reworked**; this row asks whether they must **additionally assert something new**. Score both — an EIP can be low on one and high on the other.
  • New test-framework primitives · Checklist revision 2 only
    Requires new abstractions in the test framework itself — expectation types, modifiers, helpers — beyond writing test functions with what already exists.
    Score anchors
    0
    Existing test primitives suffice.
    1
    Existing primitives need minor extension.
    2
    New expectation or modifier primitives are required, reusable within this EIP's own test suite.
    3
    New framework-level primitives are required that become a permanent part of the framework and are used by other EIPs' tests.

Risk and validation

Security, performance, boundary conditions, and cryptography that need validation.

  • Security risks
    Introduces or modifies mechanisms that could compromise the security of the chain, users, validators, or other stakeholders, if not implemented properly.
    Score anchors
    0
    No new mechanisms are introduced that could pose a security risk.
    1
    The introduced mechanisms are self-contained, can be validated in isolation, and do not alter existing invariants that could pose a security risk for any stakeholders.
    2
    The introduced mechanisms interact with a limited number of existing components, slightly altering their security assumptions and requiring a targeted security review or fuzzing.
    3
    The introduced mechanisms interact with multiple existing components, including critical ones, substantially altering their security assumptions and requiring an extensive security review and fuzzing.
  • Performance risks
    Introduces or modifies mechanisms and requires performance validation.
    Score anchors
    0
    No new mechanisms are introduced that require performance validation.
    1
    The introduced mechanisms can be benchmarked in isolation and do not affect existing performance behavior.
    2
    The introduced mechanisms cannot be fully benchmarked in isolation, but they only have a limited impact on the existing performance benchmarks.
    3
    The introduced mechanisms cannot be benchmarked in isolation and have a substantial impact on existing performance benchmarks or have complex interactions with existing mechanisms.
  • Edge/boundary conditions
    Feature contains edge/boundary conditions.
    Score anchors
    0
    No discernible edge cases or boundary conditions are introduced.
    1
    A single edge-case or boundary-condition prone mechanism is introduced.
    2
    Multiple edge-case or boundary-condition prone mechanisms are introduced, but none of them requires an elevated number of cases to test.
    3
    Multiple edge-case or boundary-condition prone mechanisms are introduced and at least one of them requires an elevated number of cases to test.
  • Cryptography
    Introduces new cryptography mechanisms or modifies existing functionality that involves cryptography
    Score anchors
    0
    No cryptography mechanisms are introduced.
    1
    A new cryptography mechanism is introduced but it is a well known mechanism that is known to have vast resources to aid on its testing.
    2
    Multiple new cryptography mechanisms are introduced that are well-known or a single but novel mechanism is introduced that is either untested or has limited resources.
    3
    Multiple new cryptography mechanisms are introduced and at least one of them is a novel mechanism.

Coordination

Cross-EIP interactions and behavior that clients must agree on before tests exist.

  • Cross-EIP interactions
    Introduces or modifies mechanisms that affect other EIPs in either the same or past forks.
    Score anchors
    0
    Fully self-contained EIP that does not depend on, modify, or conflict with any other EIP.
    1
    The EIP interacts with one or more other EIPs in a non-critical and limited way but can be tested independently for the most part.
    2
    The EIP depends on or modifies one or more other EIPs such that coordinated testing and consideration is required, but interactions are limited in scope and not complex.
    3
    The EIP has strong interdependencies with multiple EIPs, requiring extensive coordinated cross-EIP testing as well as potential re-design of existing test vectors.
    • +1 for every 3 additional interacting EIPs beyond the first 3, each of which requires its own coordinated test cases. List the EIPs in the rationale.
    • This row is intentionally uncapped, unlike every other anchor: each interacting EIP is another axis of the test matrix, so a ceiling would make a 12-EIP product indistinguishable from a 3-EIP one.
  • Unspecified behavior requiring cross-client consensus · Checklist revision 2 only
    The EIP text does not determine the answer for cases a test can construct. Clients must agree on a previously unspecified detail before tests can be baselined. The cost here is coordination and re-baselining, not test writing.
    Score anchors
    0
    The EIP text determines the answer for every case a test could construct.
    1
    A few details are unspecified but have an obvious intended reading.
    2
    Details require client agreement before tests can be written, but they are localized.
    3
    A previously unspecified *and previously unobservable* behavior becomes consensus-critical; expect tests to be re-baselined on each round of EIP amendment.
    • Score this from the EIP's state at assessment time: whether it has client implementations, whether it has been through a devnet, and how many open questions remain on its discussion thread.