nx_physics_ladder.nx
buildroot/runtime/nx_physics_ladder.nx
about
nx_physics_ladder.nx -- GENEALOGIST physics-limit grading: how close is the sovereign hash get to the
PHYSICS FLOOR? Operator telos: S-class exceed graded on ABSENT->EXISTS->EXCEEDS->NEAR-PHYSICS->PHYSICS-
OPTIMUM, not just "beats sqlite". For a key->value lookup the irreducible physics limit is MEMORY-ACCESS
LATENCY: you cannot find a value faster than touching the memory that holds it. This measures the real
floors on THIS hardware with a dependent pointer-chase (the canonical memory-latency benchmark -- each
load's address depends on the previous load, defeating prefetch/OOO so we measure latency, not bandwidth)
at two working-set sizes: cache-resident (256KB) and DRAM-resident (64MB > LLC). Then it measures the
sovereign hash get and places it on the maturity ladder vs those physics floors.
Honest: a lookup must do >=1 random memory access; being at ~1 access = PHYSICS-OPTIMUM (irreducible).
No hw writes (Rule 26). expect_exit: 0 license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_hash_index.nxnx_itoa_lib.nx
imported by: nobody (leaf or entry point)
call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown
structs
| none |
consts
| 13 | const K_MAGIC_1664525: i64 = 1664525 |
| 14 | const K_MAGIC_1013904223: i64 = 1013904223 |
| 15 | const K_MAGIC_32768: i64 = 32768 |
| 16 | const K_MAGIC_8000000: i64 = 8000000 |
| 17 | const K_MAGIC_8388608: i64 = 8388608 |
| 18 | const K_MAGIC_20000: i64 = 20000 |
| 19 | const K_MAGIC_7919: i64 = 7919 |
functions
| 21 | func pl_puts(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 26 | func pl_num(v: i64) -> i64 { nxi_out(v); return 0 } |
| 30 | func chase_latency_ns(n: i64, iters: i64) -> i64 |
| 46 | func main() -> i64 |