Leaderboard / datenvertrag.halowerk.com / endpoint
POST https://datenvertrag.halowerk.com/v1/minimum-sorting-network-family
Scores measure reliability and honesty, not output quality.
- Listed only 2 days ago; new listings earn trust over 30 days.
- Answered all 8 probes in the last 7 days.
- Category
- Computation by llm, confidence 80%
- Latest quote
- $0.003 on Base to 0x2880…4E5E
- Uptime
- 100% / 7d, 100% / 30d
- Delivery
- none not yet paid-tested
- Observed
- none reported yet (opt-in wrapper telemetry)
- HTTPS
- yes
- First listed
- 2026-11-16
- Last probe
- 3h ago
- Next probe
- 2026-11-18 08:45 UTC
Score components
Catalog listings
| Source | Scheme | Network | Asset | Listed price | Pay to | Flow | Current | Last seen |
|---|---|---|---|---|---|---|---|---|
| cdp | exact | Base | 0x8335…2913 | $0.003 | 0x2880…4E5E | eip3009 | yes | 46m ago |
Listing changes
| When | Event | From | To |
|---|---|---|---|
| 22h ago | reappeared | false | true |
| 29h ago | disappeared | — | — |
Paid probes
No paid probes yet. Paid probing is off by default and runs weekly per host under a strict spend cap; each paid probe links to its on-chain transaction here.
Delivery checks
Inside each paid probe we ask for something whose correct answer we know, then compare. A pass means the seller delivered what it was paid for; a fail means it charged and returned something wrong; inconclusive means we could not judge (no reference, unknown input shape, or a non-2xx response). Every row carries the request, the response hash and the reference so the verdict can be reproduced. Judged results feed the "Delivery after payment" component (pass 1, error after payment 0.25, fail 0); inconclusive rows are excluded; a fail in the last 14 days caps the verdict at caution. Methodology.
No delivery checks yet. They run inside the weekly paid probe.
Classification history
Every classification is kept; the newest row is the current category. Rules match the listing text; the model is consulted only when the rules are unsure.
| When | Category | Confidence | Method | Version | Evidence |
|---|---|---|---|---|---|
| 10h ago | Computation | 80% | llm | v1 | claude-haiku-5-5: The endpoint synthesizes minimum-comparator sorting networks for a given wire count, a combinatorial/mathematical computation with a stated formal definition, returning counts and sequences rather than prose, data lookups or model output. The description is specific and technical, so compute_math fits best, though the exact category is somewhat uncertain given the combinatorial nature. |
| 22h ago | Other | 40% | rules | v1 | rule none matched "" in none |
| 29h ago | Other | 20% | rules | v1 | rule none matched "" in none |
| 32h ago | Other | 40% | rules | v1 | rule none matched "" in none |
Probe history
| When | Kind | Status | Latency | x402 | Valid | Quoted | Pay to | Flags |
|---|---|---|---|---|---|---|---|---|
| 3h ago | free | 402 | 474 ms | v2 | yes | $0.003 | 0x2880…4E5E | — |
| 9h ago | free | 402 | 176 ms | v2 | yes | $0.003 | 0x2880…4E5E | — |
| 15h ago | free | 402 | 166 ms | v2 | yes | $0.003 | 0x2880…4E5E | — |
| 22h ago | free | 402 | 165 ms | v2 | yes | $0.003 | 0x2880…4E5E | — |
| 28h ago | free | 402 | 160 ms | v2 | yes | $0.003 | 0x2880…4E5E | — |
| 35h ago | free | 402 | 518 ms | v2 | yes | $0.003 | 0x2880…4E5E | — |
| 41h ago | free | 402 | 519 ms | v2 | yes | $0.003 | 0x2880…4E5E | — |
| 47h ago | free | 402 | 151 ms | v2 | yes | $0.003 | 0x2880…4E5E | — |