nx_solve_steps_gate.nx
buildroot/runtime/nx_solve_steps_gate.nx
about
nx_solve_steps_gate.nx -- AM10: DOES THE WORKED SOLUTION ACTUALLY SOLVE, AND DOES IT TELL THE TRUTH?
The teeth check the ANSWER by substitution, not by string comparison. A step list that looks plausible
and produces a wrong root would pass any test that only inspects the text, so the load-bearing teeth
take the root the steps arrive at and put it BACK into the original equation. That is an oracle the
implementation cannot talk its way past.
license_tier: ORIGINAL expect_exit: 0
dependencies 3 imports · 0 importers
imports: syscalls.nxnx_solve_steps_lib.nxnx_gate_verdict.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 SG_CAP: i64 = 16384 |
functions
| 15 | func sg_slen(s: *u8) -> i64 { var i: i64 = 0; while s[i] != (0 as u8) { i = i + 1 } return i } called by 1: sg_has |
| 17 | func sg_has(buf: *u8, n: i64, pat: *u8) -> i64 |
| 31 | func sg_lines(buf: *u8, n: i64) -> i64 called by 1: main |
| 38 | func main() -> i64 |