Evidence row 117530

What was observed

{
  "endpoints": [
    [
      "x402",
      "https://numtheory.openverbs.com/v1/totient"
    ]
  ],
  "name": "Euler's totient",
  "owner_address": "0xb3f4de103f34b99f0da19b4f16d6b53a14c2194a",
  "raw": {
    "accepts": [
      {
        "amount": "4000",
        "asset": "0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913",
        "extra": {
          "name": "USD Coin",
          "version": "2"
        },
        "maxTimeoutSeconds": 300,
        "network": "eip155:8453",
        "payTo": "0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A",
        "scheme": "exact"
      }
    ],
    "description": "Euler's totient φ(n) — the count of integers in [1, n] coprime to n — for a positive integer ≤ 10^15 (it is computed from the prime factorization).",
    "extensions": {
      "bazaar": {
        "info": {
          "input": {
            "body": {
              "n": "42"
            },
            "bodyType": "json",
            "method": "POST",
            "type": "http"
          }
        },
        "schema": {
          "$schema": "https://json-schema.org/draft/2020-12/schema",
          "properties": {
            "input": {
              "additionalProperties": false,
              "properties": {
                "body": {
                  "additionalProperties": false,
                  "properties": {
                    "n": {
                      "description": "Positive integer ≤ 10^15 as a decimal string.",
                      "pattern": "^\\d+$",
                      "type": "string"
                    }
                  },
                  "required": [
                    "n"
                  ],
                  "type": "object"
                },
                "bodyType": {
                  "enum": [
                    "json",
                    "form-data",
                    "text"
                  ],
                  "type": "string"
                },
                "method": {
                  "enum": [
                    "POST"
                  ],
                  "type": "string"
                },
                "type": {
                  "const": "http",
                  "type": "string"
                }
              },
              "required": [
                "type",
                "method",
                "bodyType",
                "body"
              ],
              "type": "object"
            }
          },
          "required": [
            "input"
          ],
          "type": "object"
        }
      }
    },
    "lastUpdated": "2026-10-05T12:11:01.1Z",
    "quality": {
      "l30DaysTotalCalls": 1,
      "l30DaysUniquePayers": 1,
      "lastCalledAt": "2026-10-05T12:11:00.84Z"
    },
    "resource": "https://numtheory.openverbs.com/v1/totient",
    "serviceName": "Euler's totient",
    "tags": [
      "euler totient",
      "compute phi",
      "totient function",
      "coprime count",
      "number theory totient"
    ],
    "type": "http",
    "x402Version": 2
  },
  "source": "x402_bazaar",
  "summary": "Euler's totient φ(n) — the count of integers in [1, n] coprime to n — for a positive integer ≤ 10^15 (it is computed from the prime factorization)."
}

What the leaf hashes

{"body":"2cad7f139fb6df7b8a4765e8450e731219dd6beccb66a12ce36f23047b012b5f","id":117530,"kind":"listing","method":"baseline/1","observed_us":1793025611325961,"prev":null,"subject":"x402_bazaar:https://numtheory.openverbs.com/v1/totient","subject_kind":"source_record"}

Proof

Fold these into the leaf in order, hashing each sorted pair with keccak256, to reach the root of 2026-10-26 (296695 rows).

1. 0x69f8ab051763ea8f9343a13b276f6d52b55b8dcf91557963a49bd3a8d4c369d5
2. 0xc7d74bab79d4b15203e6cd9aa69d48d1ff4e1ce16a745742949731706688baa0
3. 0x6fab4a4d8950114988eb12375331afd182a5d01bc76308d79aea9b3b54764228
4. 0xf75f1039d97a74f486d4cf13ac9d47769b6c56bcd182aa4b87bbd39e729bfa5f
5. 0xaed53cef192a794555664af56d56b78632878ef86b41968da14ef2a20851d5a9
6. 0x8a77b06e97962503ff672eb16113ca8e2b9354d8c174f2cedd9455a1b65877bd
7. 0x4fb883ca931a91b0222aa6851e86a19373651547aee679e664a06b6ba710bf68
8. 0x32de3c5d4d666a856ce1f73f01dd331d3f4f401d5ab857879a03c1dfdd425085
9. 0x11d1fc3e009ce9cbdbc644ed88dc5547619bf405e76d349e3fe60ac3ba81753d
10. 0xdeb16a4852b1c249628d0590c012fe1adebc9195ddf46ba3cbf8dcba07af7c93
11. 0xe8b20383a9232d45872f50d7c4c484b3ffe756328a5a1e2d63218cd46b95695c
12. 0x9483a0a7a066ffc2fb890c8f34dbc91bf373e546e4a3800b76064288b3cc4875
13. 0x5f350d70c252ff1169c0210fd45fce1b0ab8d7316f048741a9e90a6c8cb65dcf
14. 0x9a79c65e077cd9da9d436b3ade6f5ddc0d244510c4d5903ef2f02d81205f7666
15. 0xa2d436d488e3600b0e5c3e3ed9c9234cd52853c59830b786334fd0c4292d9f40
16. 0x47b89901b0f07938a6b9a66ddf35683903f79d756a7c7763665fd632758b08d0
17. 0x9a83be955a206deb65b995adfd92c58fa31c95fbbf926bd199d300e70b08b26d
18. 0x20704208aa6923d6b2450ef74ede87a6e0265d46447926038fe9506e9e154b2d
19. 0x9b9ce5b74b9bab5121612ef6b64920a8d453cbf311096a423eef9702747e868a

Day root

0xf43e8dcc3d451a4788b26be904c55e8c4c0fa75c9666796c51db38d37e2c0df8

Chained

0x702d5ac508f08b0d1accf36af25822d8e5660367494edd17a642fb61e158a57a

Published

On Arc Testnet, block 69251483: 0x495162f8936e19f0039918feebe6c307f327cd6bf8c37219620b1970041fa9ae