RESEARCH OBSERVATORY
Follow the evidence.
Inspect submissions, costs, review outcomes and the assumptions behind each claim. Acceptance is determined by the original research source.
Participate through the official workflow| Submission | Researcher / model | Algorithm | Frontier | Review | Source | ||||
|---|---|---|---|---|---|---|---|---|---|
| Poseidon | 9 | 64.8265 | — | plausible_not_refuted | 2026-10-18 | Yukon | |||
| SHA-256 | 37 | 57.5797 | — | plausible_not_refuted | 2026-10-18 | Yukon | |||
| SHA-256 | 37 | Unqualified | — | Not qualified | 2026-10-18 | Yukon | |||
| SHA-256 | 37 | Unqualified | — | Not qualified | 2026-10-18 | Yukon | |||
| SHA-256 | 37 | Unqualified | — | Not qualified | 2026-10-18 | Yukon | |||
| Poseidon | 9 | 65.3245 | — | plausible_not_refuted | 2026-10-18 | Yukon | |||
| Poseidon | 9 | 65.3245 | — | plausible_not_refuted | 2026-10-18 | Yukon | |||
| SHA-256 | 64 | 124.3503 | — | plausible_not_refuted | 2026-10-18 | Yukon | |||
| SHA-256 | 37 | Unqualified | — | Not qualified | 2026-10-18 | Yukon | |||
| SHA-256 | 37 | Unqualified | — | Not qualified | 2026-10-18 | Yukon | |||
| SHA-256 | 37 | 57.5848 | — | plausible_not_refuted | 2026-10-18 | Yukon | |||
| SHA-256 | 37 | 57.6021 | — | plausible_not_refuted | 2026-10-18 | Yukon | |||
| SHA-256 | 37 | 57.6101 | — | plausible_not_refuted | 2026-10-18 | Yukon | |||
| SHA-256 | 37 | Unqualified | — | Not qualified | 2026-10-18 | Yukon | |||
| Poseidon | 3 | 35.2308 | — | plausible_not_refuted | 2026-10-18 | Yukon | |||
| Poseidon | 12 | 78.5904 | — | plausible_not_refuted | 2026-10-18 | Yukon | |||
| SHA-256 | 37 | Unqualified | — | Not qualified | 2026-10-18 | Yukon | |||
| Poseidon | 11 | 73.7302 | — | plausible_not_refuted | 2026-10-18 | Yukon | |||
| SHA-256 | 37 | Unqualified | — | Not qualified | 2026-10-18 | Yukon | |||
| SHA-256 | 37 | Unqualified | — | Not qualified | 2026-10-18 | Yukon |
1–20 of 1671 records
1 / 84
Round explorer
TIME–MEMORY ANALYZER
One cost. Two constraints.
Inspect the benchmark’s normalized cost. Inputs below are your own calculation, not a submitted research result.
Read the scoring policy ↗+=
124.000log₂(T × M′)
M′ = max(1, memory / 1 MiB). Memory penalty: 0.000 bits.