← The evidence ledger
Evidence row 2201211
Observed , by sync.x402_bazaar/1.
- Kind
- listing
- About
- source_record x402_bazaar:https://security-math.x402tookit.com/crack-time
- Recorded
- Previous row
- None: the first of its kind about this subject
- Body SHA-256
- 92d0f24c71f3eb0cc94f1a1b85dc0d10d7242b839e6af3791c16939025033153
- Leaf
- 0x313390ff7aa99b3c85ee1f96192b9f59fc62acaa1c0dc433768526213662438b
What was observed
{
"endpoints": [
[
"x402",
"https://security-math.x402tookit.com/crack-time"
]
],
"name": "Security Math",
"owner_address": "0xb531320805c5bed1d46aeadcf4f008fdf172dbda",
"raw": {
"accepts": [
{
"amount": "20000",
"asset": "0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913",
"extra": {
"name": "USD Coin",
"version": "2"
},
"maxTimeoutSeconds": 300,
"network": "eip155:8453",
"payTo": "0xb531320805C5BED1D46AEaDcF4F008FDF172DBDa",
"scheme": "exact"
},
{
"amount": "20000",
"asset": "EPjFWdd5AufqSSqeM2qN1xzybapC8G4wEGGkZwyTDt1v",
"extra": {
"feePayer": "D6ZhtNQ5nT9ZnTHUbqXZsTx5MH2rPFiBBggX4hY1WePM",
"transactionVersions": [
0
]
},
"maxTimeoutSeconds": 300,
"network": "solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp",
"payTo": "DUPiupXtuox38dcGoXUKer5mAydCzmaHjrbQ66qeEm8s",
"scheme": "exact"
},
{
"amount": "20000",
"asset": "0x3c499c542cEF5E3811e1192ce70d8cC03d5c3359",
"extra": {
"name": "USD Coin",
"version": "2"
},
"maxTimeoutSeconds": 300,
"network": "eip155:137",
"payTo": "0xb531320805C5BED1D46AEaDcF4F008FDF172DBDa",
"scheme": "exact"
},
{
"amount": "20000",
"asset": "0xaf88d065e77c8cC2239327C5EDb3A432268e5831",
"extra": {
"name": "USD Coin",
"version": "2"
},
"maxTimeoutSeconds": 300,
"network": "eip155:42161",
"payTo": "0xb531320805C5BED1D46AEaDcF4F008FDF172DBDa",
"scheme": "exact"
}
],
"description": "Time to brute-force a space of N bits (or N guesses) at a guesses-per-second rate: average, worst case, and presets.",
"extensions": {
"bazaar": {
"info": {
"input": {
"method": "GET",
"queryParams": {
"bits": 56,
"guessesPerSecond": 1000000000000
},
"type": "http"
},
"output": {
"example": {
"asOf": "2026-10-11T14:38:13.269Z",
"averageSeconds": 36028.79701896392,
"averageTime": "10.0 hours",
"bits": 56,
"degraded": false,
"disclaimer": "Screening signal computed from the named public source. Not financial, legal or investment advice; provided as is. Verify at the source before acting.",
"groverEquivalentBits": 28,
"guessesPerSecond": 1000000000000,
"log10Guesses": 16.86,
"notChecked": [
"shortcuts that beat brute force (weak randomness, side channels, structural attacks, quantum algorithms)",
"real attacker hardware or cost",
"…1 more"
],
"presets": [
{
"assumption": "online login with lockouts or rate limiting (about 1 guess per second)",
"attacker": "online-throttled",
"averageTime": "1.14e+9 years",
"guessesPerSecond": 1,
"worstCaseTime": "2.28e+9 years"
},
{
"assumption": "online login with no rate limiting (about 1,000 guesses per second)",
"attacker": "online-unthrottled",
"averageTime": "1.14e+6 years",
"guessesPerSecond": 1000,
"worstCaseTime": "2.28e+6 years"
}
],
"reasons": [
"Average = half the space (an unknown target is found on average halfway through); worst case = the whole space.",
"A quantum computer running Grover's algorithm would, in theory, search in about 2^28 steps: it halves the exponent for symmetric keys and hashes."
],
"source": "computed locally",
"summary": "2^56 guesses at 1.00e+12/s: average 10.0 hours, worst case 20.0 hours.",
"verdict": "FEASIBLE",
"worstCaseSeconds": 72057.59403792785,
"worstCaseTime": "20.0 hours"
},
"type": "json"
}
},
"schema": {
"$schema": "https://json-schema.org/draft/2020-12/schema",
"properties": {
"input": {
"additionalProperties": false,
"properties": {
"method": {
"enum": [
"GET"
],
"type": "string"
},
"queryParams": {
"properties": {
"bits": {
"description": "Size of the search space in bits of entropy, 1 to 4096 (e.g. 56 for DES, 128 for AES-128)",
"type": "number"
},
"guessesPerSecond": {
"description": "Attacker speed, 1 to 1e30 guesses per second (default: show all presets)",
"type": "number"
}
},
"required": [
"bits"
],
"type": "object"
},
"type": {
"const": "http",
"type": "string"
}
},
"required": [
"type",
"method"
],
"type": "object"
},
"output": {
"properties": {
"example": {
"properties": {
"asOf": {
"type": [
"null",
"string"
]
},
"averageSeconds": {
"type": [
"null",
"number"
]
},
"averageTime": {
"type": [
"null",
"string"
]
},
"bits": {
"type": [
"null",
"number"
]
},
"degraded": {
"type": [
"boolean",
"null"
]
},
"disclaimer": {
"type": [
"null",
"string"
]
},
"groverEquivalentBits": {
"type": [
"null",
"number"
]
},
"guessesPerSecond": {
"type": [
"null",
"number"
]
},
"log10Guesses": {
"type": [
"null",
"number"
]
},
"notChecked": {
"items": {
"type": "string"
},
"type": [
"array",
"null"
]
},
"presets": {
"items": {
"properties": {
"assumption": {
"type": [
"null",
"string"
]
},
"attacker": {
"type": [
"null",
"string"
]
},
"averageTime": {
"type": [
"null",
"string"
]
},
"guessesPerSecond": {
"type": [
"null",
"number"
]
},
"worstCaseTime": {
"type": [
"null",
"string"
]
}
},
"type": "object"
},
"type": [
"array",
"null"
]
},
"reasons": {
"items": {
"type": "string"
},
"type": [
"array",
"null"
]
},
"source": {
"type": [
"null",
"string"
]
},
"summary": {
"type": [
"null",
"string"
]
},
"verdict": {
"type": [
"null",
"string"
]
},
"worstCaseSeconds": {
"type": [
"null",
"number"
]
},
"worstCaseTime": {
"type": [
"null",
"string"
]
}
},
"type": "object"
},
"type": {
"type": "string"
}
},
"required": [
"type"
],
"type": "object"
}
},
"required": [
"input"
],
"type": "object"
}
}
},
"lastUpdated": "2026-11-02T04:08:17.966Z",
"quality": {
"l30DaysTotalCalls": 2,
"l30DaysUniquePayers": 1,
"lastCalledAt": "2026-11-02T04:08:17.805Z"
},
"resource": "https://security-math.x402tookit.com/crack-time",
"serviceName": "Security Math",
"tags": [
"brute-force",
"crack-time",
"entropy",
"keyspace"
],
"type": "http",
"x402Version": 2
},
"source": "x402_bazaar",
"summary": "Time to brute-force a space of N bits (or N guesses) at a guesses-per-second rate: average, worst case, and presets."
}What the leaf hashes
{"body":"92d0f24c71f3eb0cc94f1a1b85dc0d10d7242b839e6af3791c16939025033153","id":2201211,"kind":"listing","method":"sync.x402_bazaar/1","observed_us":1793646801289925,"prev":null,"subject":"x402_bazaar:https://security-math.x402tookit.com/crack-time","subject_kind":"source_record"}Proof
Fold these into the leaf in order, hashing each sorted pair with keccak256, to reach the root of (444186 rows).
- 0x3133a5db2576df4037de11cfc2dd9939160ddfcdee8c93cf558a5c4050a4ae85
- 0xfe0d4e7ae3955df7a532672764b53122ea603d31c4c32bf117f3f6fa05b7656a
- 0x603f3536f1992faa90be6b24669dfd940ec93ef0efdd4b7cc045a35400b5bc12
- 0xe66ad18ba473047fdd45c98747b53109299fc8f158c4f0629de9af4150da44c9
- 0x2e342502642dfaa9e14725376e7d8f0497802a6e175118b90035c4d8f5dc5bf8
- 0x8391bd6f67a2b067686f192db793cc302388b1f41719c98a0a3c1c2ab9656547
- 0x32d23a126c8b952b58498026d54e6908dd05a3bcd3768452f8b8deb3fb4199b1
- 0x60415a2dd798586aa9ad2f6b11a72c394830bedacced2896bedf5009d259ded8
- 0x347b95dff810c965ed2fecef9bf23313a7bcef7ad32321deb4f26bd7458d0aa9
- 0xcadf711437668af0c0d3d34cbcc150727cc5d18f52d42d9fbf2d651a7b0a45b8
- 0x0112e4e45eb51898ecd3ae0b872fa6de4b24a668cedd767cc9c2c13657d3f5e2
- 0x0069da835f0bdf3fac9b4da76faf3526f6622cf9f1f1db78993c2c79276ac031
- 0xe0a95aa0d153f7a034b0dbeb91c5460c64c47c22ac037e0e8cfa69f4ff734b69
- 0x74cae95d275254a9c747b603bd40b5086c5725fd3e904782e6447e4647e8b049
- 0x464ce6fe060d0a6c4e810b71501e55084086148f7daf393caa14462b1a777022
- 0xd42916b5c6441e9c8d91ff91715af1489cb83dee26d47e7da107caa4d2a68b65
- 0xa20b9be86af7d690e040c9060a373b2fc5498edf3432f43c26f74fa2febc1e9a
- 0x050f2978b537f7afb21ee1551577cdf146d1c56f4df12d24315ae5e69366b0a4
- 0x365b161a4b68d750dcc4b3ecce1154a2163c87b08762079428e68f0ebb6a754e
- Day root
- 0x78fecaabbe319e56f5c4b80fc02e2052e198ad24781da8832a475ff65f2002d1
- Chained
- 0xdc35957db5d1371ca382b9152878ffece28ec7c5cb4f98fd71ddb367f8b999b2
- Published
- On Arc Testnet, block 70432815: 0x56b814612eb2e3e544153df3e91e1f7199106d1e430c7d8c6b653feeb9ebe9af