Anchor batch 20261107

Merkle root

0xa89d0736d5aeec786f502db7c8097cae68a7e22b359d0bc7c3a2e98e99b185bb

Network

Arbitrum One

Anchored

Nov 7, 2026 04:30 UTC

Contract

0xceacc40cf7b7c797d990dce7164fcccd87dad693

Written by

0x57c89Be59322a75E3B7C116d9A2e7B0332A257D1

Transaction

0x6a094efda96e6f77da65b27cbe34a92e2a1053120c8c04ab5467d530e2e34399

Last re-checked against the chain

Nov 7, 2026 — the root on chain was read back and rebuilt from our rows that day

curl -s https://arb1.arbitrum.io/rpc -X POST -H 'Content-Type: application/json' \
  --data '{"jsonrpc":"2.0","id":1,"method":"eth_call","params":[{"to":"0xceacc40cf7b7c797d990dce7164fcccd87dad693","data":"0xc2b40ae400000000000000000000000000000000000000000000000000000000013528f3"},"latest"]}'

Leaves are numbered from zero in tree order. Each one is computed here by hashing that signal's stored snapshot — not copied out of a column — so a row whose bytes changed after the anchor shows up as a mismatch. Open a signal to see those bytes and the branch that carries it to the root.

Rebuild the root yourself

Take the leaves above in this order and fold them pairwise. The specification is published word for word on the verification page; the short version is below, and the rule that catches most reimplementations is the odd node — it is carried up unchanged, never paired with itself.

import hashlib

level = [bytes.fromhex(h) for h in leaves]      # in the order listed above
while len(level) > 1:
    nxt = [hashlib.sha256(level[i] + level[i + 1]).digest()
           for i in range(0, len(level) - 1, 2)]
    if len(level) % 2:
        nxt.append(level[-1])                   # promoted, never duplicated
    level = nxt

print('0x' + level[0].hex())