nx_ice_recrystal_test.nx
buildroot/runtime/nx_ice_recrystal_test.nx
about
nx_ice_recrystal_test.nx -- gate for ice recrystallisation.
THE LIAR-KILL IS THE CUBE-LAW ROUND TRIP (T2/T3): recover k from a pair of
observed crystal sizes, then run the model forward and land back on the
observation it was recovered from. A wrong exponent or a wrong cube root
cannot survive that, because both directions use the full arithmetic.
THE FINDING IS T7: two storage histories with the SAME mean temperature
give different ice cream. It is measured, with a flat-history control
(T8) proving the difference comes from the cycling and not from the model
adding damage to everything it touches.
expect_exit: 0 license_tier: ORIGINAL
dependencies 3 imports · 0 importers
imports: nx_syscalls.nxnx_icecream.nxnx_ice_recrystal.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
| none |
functions
| 17 | func tw(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(1, s, n); return 0 } |
| 18 | func tn(v: i64) -> i64 { let b: *u8 = sys_mmap(24); var m: i64 = v; if m < 0 { sys_write(1, "-" as *u8, 1); m = 0 - m } let t: *u8 = sys_mmap(24); var k: i64 = 0; if m == 0 { t[0] = 48 as u8; k = 1 } while m > 0 { t[k] = (48 + (m % 10)) as u8; m = m / 10; k = k + 1 } var i: i64 = 0; while i < k { b[i] = t[k - 1 - i]; i = i + 1 } sys_write(1, b, k); return 0 } |
| 19 | func iabs(v: i64) -> i64 { if v < 0 { return 0 - v } return v } called by 1: main |
| 21 | func main() -> i64 |