Skip to content

docs: classify contract-readable anchor state as a hard requirement#45

Merged
iret77 merged 1 commit into
mainfrom
docs/dlt-eval-hard-requirements
Jun 13, 2026
Merged

docs: classify contract-readable anchor state as a hard requirement#45
iret77 merged 1 commit into
mainfrom
docs/dlt-eval-hard-requirements

Conversation

@iret77

@iret77 iret77 commented Jun 13, 2026

Copy link
Copy Markdown
Contributor

What & why

Second-pass review fix. After the consistency PR (#44) merged, a fresh grounded Codex pass over the v0.3 draft surfaced one remaining inconsistency in the companion evaluation doc:

DLT_EVALUATION.md listed "programmable escrow with time-window logic and contract-readable anchor state" under graded criteria — but SPEC §13.1 makes programmable smart contracts (req 3) and contract-readable dispute/enforcement state (req 6) MUST-level requirements. The doc's own Hedera row already treats "HCS not smart-contract-readable" as an outright disqualifier (it "independently breaks the §6.2.1 uncontested path"), not a low score — so the "graded" classification contradicted both SPEC §13.1 and the file's own verdict logic.

Fix: split the methodology note into

  • hard requirements (SPEC §13.1 MUSTs): programmable contracts (req 3), programmatic wallets (req 4), contract-readable dispute/enforcement state (req 6), anchor discoverability (req 7) — pass/fail, non-discriminating only because every shortlisted chain clears them; contract-readable state explicitly flagged as the MUST that disqualifies HCS-style anchoring; and
  • genuinely graded criteria: native randomness (conditional on VRF use), sponsored tx, native stablecoins, maturity, quantum resistance.

No chain's verdict changes — this aligns the methodology text with how the table already scores.

Affected spec section(s)

DLT_EVALUATION.md "Method and hard filters"; cross-references SPEC §13.1 (req 3/4/6/7), §6.2.1, §13.4 (Hedera).

Trust impact

None. Documentation-only; classifies existing requirements correctly. No normative SPEC change, no trust root moves.

Checklist

  • One logical change, conventional PR title
  • Cited the affected spec section(s)
  • Stated the trust impact (or "none")
  • Normative language uses RFC 2119 keywords correctly
  • docs-check passes

…not graded)

Second Codex pass on the v0.3 draft caught a genuine inconsistency: the
DLT_EVALUATION methodology listed 'programmable escrow ... and
contract-readable anchor state' under *graded* criteria, but SPEC §13.1
makes programmable smart contracts (req 3) and contract-readable
dispute/enforcement state (req 6) MUST-level requirements — and the
file's own Hedera row already uses 'HCS not smart-contract-readable' as
an outright disqualifier, not a low score.

Split the methodology note: programmable contracts, programmatic
wallets, contract-readable dispute/enforcement state, and anchor
discoverability are now stated as SPEC §13.1 MUSTs (pass/fail,
non-discriminating because the shortlist all clears them), with
contract-readable state called out as the one that disqualifies
HCS-style anchoring. Native randomness (conditional on VRF use),
sponsored tx, stablecoins, maturity, and quantum resistance remain
genuinely graded. No change to any chain's verdict.
@iret77 iret77 merged commit 88b4299 into main Jun 13, 2026
2 checks passed
@iret77 iret77 deleted the docs/dlt-eval-hard-requirements branch June 13, 2026 15:58
iret77 added a commit that referenced this pull request Jun 13, 2026
Third Codex pass: the README 'Hard selection criteria' summary listed 5
of SPEC §13.1's 7 MUST requirements, omitting req 6 (contract-readable
dispute/enforcement state) and req 7 (anchor discoverability) — the very
requirements PR #45 just clarified are hard, not graded. Added both, and
noted contract-readable state as the one that rules out event-log-only
anchoring (Hedera HCS). Summary now matches §13.1.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant