addrbookFor publishers
← The evidence ledger

Evidence row 117526

Observed , by baseline/1.

Kind
listing
About
source_record x402_bazaar:https://numtheory.openverbs.com/v1/gcd
Recorded
Previous row
None: the first of its kind about this subject
Body SHA-256
8f6932fbbc92984dcbb2a44023c2f6d267fba3e7ed9de8250c22893c6ab22ae7
Leaf
0x164b01e76d230fe9f4780c4a4b0b0ac0940e3e8885be85cb2e27990293b912b9

What was observed

{
  "endpoints": [
    [
      "x402",
      "https://numtheory.openverbs.com/v1/gcd"
    ]
  ],
  "name": "Greatest common divisor",
  "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": "Greatest common divisor of two or more non-negative integers (arbitrary precision).",
    "extensions": {
      "bazaar": {
        "info": {
          "input": {
            "body": {
              "values": [
                "42",
                "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": {
                    "values": {
                      "description": "Two or more non-negative integers as decimal strings.",
                      "items": {
                        "pattern": "^\\d+$",
                        "type": "string"
                      },
                      "maxItems": 256,
                      "minItems": 2,
                      "type": "array"
                    }
                  },
                  "required": [
                    "values"
                  ],
                  "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-08T05:39:26.717Z",
    "quality": {
      "l30DaysTotalCalls": 2,
      "l30DaysUniquePayers": 2,
      "lastCalledAt": "2026-10-08T05:39:26.449Z"
    },
    "resource": "https://numtheory.openverbs.com/v1/gcd",
    "serviceName": "Greatest common divisor",
    "tags": [
      "greatest common divisor",
      "compute gcd",
      "gcd api",
      "common divisor lookup",
      "integer gcd"
    ],
    "type": "http",
    "x402Version": 2
  },
  "source": "x402_bazaar",
  "summary": "Greatest common divisor of two or more non-negative integers (arbitrary precision)."
}

What the leaf hashes

{"body":"8f6932fbbc92984dcbb2a44023c2f6d267fba3e7ed9de8250c22893c6ab22ae7","id":117526,"kind":"listing","method":"baseline/1","observed_us":1793025611321651,"prev":null,"subject":"x402_bazaar:https://numtheory.openverbs.com/v1/gcd","subject_kind":"source_record"}

Proof

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

  1. 0x164ad7bd8df77cced9e27213959bc873831bad74a95f5d260e48c8a7cc590d99
  2. 0x7151b9daec1ede741daa22968760b2beab800f6fd268229c1e484593de0d01bd
  3. 0x79559e91b1033269f1394ddeee8e0134a8488c680ced4357b207358e8e52ac74
  4. 0x5ae54dc33a943ab92767126972a1ae9518b3fb16ec4f95e4399ee512d0b7c46f
  5. 0x302bc0024590dbe743e4abe661a616474ee58081b5ee50c43dfbbdb3eae92db0
  6. 0xc22ed33c794c548ea13443d2152b5978817a7e02b750abcdce900cba09d58e85
  7. 0xca654284662c85d84f1149a7ae2c093447e17d297843fca8d8b1be3adeaf7e17
  8. 0x0dc21b4e508357a556ba5843608943e9798e14eb9f2982030662735e0d6d8960
  9. 0x4353f9765dc35ef405c74366e0d045e048fd321b985e9cd73a26be88ce05f264
  10. 0xd3388b2b4c7f521364d933c4432002eaf85765d15a09631fb8cf2491679dccc1
  11. 0xed7aa4f0a0c93f40e8bb99589e49cbc6da4d8144091eb55a8707245d7bf94039
  12. 0x856fd0d049baa5f07cd2d5d524b40c994bed22cb46ea15af4cc075b3f3f3d444
  13. 0x32f46c5f73ecbfd4f770f7f760a79bee2afed4b3e7572fa882b3e7dce8df4356
  14. 0x770e4376196188c7fc9ec40f8e218dc0d1cb92bba5fe0425a0edce27ca9a997f
  15. 0x60582ab4b41e72eb70eb0bce07fbf0fb4d2b62a8bad5be50f5d16d511adc746c
  16. 0xc6a4d7899a0f442958e26505011190b7cff2483611c1b94eba9043e0ba9ac36e
  17. 0x8c756542e482157df0c36464d75c937b845e4423dbbcfad08f0cf8d5a16b9a13
  18. 0x20704208aa6923d6b2450ef74ede87a6e0265d46447926038fe9506e9e154b2d
  19. 0x9b9ce5b74b9bab5121612ef6b64920a8d453cbf311096a423eef9702747e868a
Day root
0xf43e8dcc3d451a4788b26be904c55e8c4c0fa75c9666796c51db38d37e2c0df8
Chained
0x702d5ac508f08b0d1accf36af25822d8e5660367494edd17a642fb61e158a57a
Published
On Arc Testnet, block 69251483: 0x495162f8936e19f0039918feebe6c307f327cd6bf8c37219620b1970041fa9ae

How to check it · This row as JSON