Evidence row 117525

What was observed

{
  "endpoints": [
    [
      "x402",
      "https://numtheory.openverbs.com/v1/factorize"
    ]
  ],
  "name": "Prime factorization",
  "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": "Prime-factorize a positive integer (≤ 10^15 so the computation is always fast). Returns the prime factors with exponents, the divisor count, and whether n is prime.",
    "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-08T05:39:27.036Z",
    "quality": {
      "l30DaysTotalCalls": 2,
      "l30DaysUniquePayers": 2,
      "lastCalledAt": "2026-10-08T05:39:26.759Z"
    },
    "resource": "https://numtheory.openverbs.com/v1/factorize",
    "serviceName": "Prime factorization",
    "tags": [
      "prime factorization",
      "factor integer",
      "integer factors api",
      "prime factors lookup",
      "divisor count"
    ],
    "type": "http",
    "x402Version": 2
  },
  "source": "x402_bazaar",
  "summary": "Prime-factorize a positive integer (≤ 10^15 so the computation is always fast). Returns the prime factors with exponents, the divisor count, and whether n is prime."
}

What the leaf hashes

{"body":"70eff64b3238f4aafa25501e595707a403a9cb871fc2bc9af7a20e9f735b364d","id":117525,"kind":"listing","method":"baseline/1","observed_us":1793025611320504,"prev":null,"subject":"x402_bazaar:https://numtheory.openverbs.com/v1/factorize","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. 0xee27db0bc76e50e27ececcf55d6ec0f03c7b8e18df8020b763dd9c5e08bf226b
2. 0x3aff6264f1a615c3e433d3690a6ffeac5ef2ac9417eb192072d7bdd2ec275605
3. 0xefee0742c1541a32efcbce3cdb14ac70644cdc4023c45b6c8bc28879d0b4cfb8
4. 0xe6a68c0d1ed30c0bbc35089afbff31bad5e59f0f999d64deca9ff85af6203ffc
5. 0x698bb2f80060bdfe27230ccd08af76aedb51ef7adeb30c529b9223ca028b0795
6. 0xdcfc4d62a16a35c6d4689f884dd27de6b26cbabecfb9b314f6722702d7af1e05
7. 0xddba461a4fa74c4e046cab41249eed6ec1e2675019d75049ed01e80419abb928
8. 0x179b20654cabb651ede1aa5552d2988335b6054d38b08fb71b02b8177bd3eb2f
9. 0x61699f9f71fe0d03269fc5c4e4a906365558e9f072ac17c3790d0717e061a49f
10. 0x369a54d4fb4b5d5efccd93cfab5ea92ec0db3c689c151271b86dbcfa3a3a2a8f
11. 0x31325ab4dbdfc029b65672f927dfb6f0b046d1c4c19b63eb548ad58c295af08c
12. 0xe158f09cdbfb4f7be1bfd45fce3afcad32c2b3bb2fc2e181dadc193bbf194bfc
13. 0x746e9e5b6765727b6b96f41204cc115b0302259f6c67be0cf0efbf245601d500
14. 0x614d844c9e0509d9f9e63697aa2935555bce5f13695a8dc0047aa9e9898d70b3
15. 0x95657a7d540ed6cac0bde9995782333b2562a9a6641853269ac95148827410f0
16. 0x5fb5dda563336cd1bc1b9f44c52b76237ae72ed2145cb9290f39f304ca7dd678
17. 0x74a0a08e4e7ab9aa5bfbead33dec7e1c7e8e364cff69a63720d764bbe987aadc

Day root

0xf43e8dcc3d451a4788b26be904c55e8c4c0fa75c9666796c51db38d37e2c0df8

Chained

0x702d5ac508f08b0d1accf36af25822d8e5660367494edd17a642fb61e158a57a

Published

On Arc Testnet, block 69251483: 0x495162f8936e19f0039918feebe6c307f327cd6bf8c37219620b1970041fa9ae