pith. sign in
Pith Number

pith:PC6X67JX

pith:2026:PC6X67JXWHRWY2JMCTAFQBRPTI
not attested not anchored not stored refs resolved

Divergent Multi-Version Execution (DME): Canonical Instruction-Trace Fault Detection via Structural Address-Space Decorrelation

Petro Baran Yrievich

DME detects faults by comparing address-free instruction traces from independently compiled replicas with different memory layouts.

arxiv:2605.12576 v1 · 2026-05-12 · cs.PL · cs.SE

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{PC6X67JXWHRWY2JMCTAFQBRPTI}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp
2 Internet Archive
3 Author claim open · sign in to claim
4 Citations open
5 Replications open
Portable graph bundle live · download bundle · merged state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

DME is a runtime semantic consistency verifier that detects faults by comparing canonical instruction traces (opcodes, register identifiers, loaded/stored values, results) from independently compiled replicas while discarding layout-dependent addresses.

C2weakest assumption

Independent compilation produces sufficiently different memory layouts to decorrelate faults while preserving identical semantics so that address-independent traces remain comparable for consistency checking.

C3one line summary

DME detects faults via canonical instruction-trace comparison across semantically equivalent but address-space-diversified program replicas produced by independent compilation.

References

20 extracted · 20 resolved · 0 Pith anchors

[1] fetching a canonically equivalent instruction (prob- ability≤C/|S|),
[2] Thus: Pstep ≤ C |S| ·ε 2048
[3] alignment to the same logical instruction,
[4] canonical equivalence,
[5] Thus, detection follows: Pundetected(k)≤ C |S| ·ε k

Formal links

2 machine-checked theorem links

Receipt and verification
First computed 2026-05-18T03:10:01.612863Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

78bd7f7d37b1e36c692c14c058062f9a0e8ff219c29f0d8535fed5de4a5312a2

Aliases

arxiv: 2605.12576 · arxiv_version: 2605.12576v1 · doi: 10.48550/arxiv.2605.12576 · pith_short_12: PC6X67JXWHRW · pith_short_16: PC6X67JXWHRWY2JM · pith_short_8: PC6X67JX
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/PC6X67JXWHRWY2JMCTAFQBRPTI \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 78bd7f7d37b1e36c692c14c058062f9a0e8ff219c29f0d8535fed5de4a5312a2
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "d5c27d416e272f29e5074daa9b24033510179555ffe1e59b22d6415486761602",
    "cross_cats_sorted": [
      "cs.SE"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "cs.PL",
    "submitted_at": "2026-05-12T13:12:18Z",
    "title_canon_sha256": "7cd966b76bf036373279413081b07194594c541fc3983b63d794b68346899d40"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.12576",
    "kind": "arxiv",
    "version": 1
  }
}