trial_running
std.elementwise.trial_running · Level L1Whether trial division still has a candidate divisor d with d² ≤ m somewhere, as 1 or 0. The condition factor_summary loops on.
[some d² ≤ m]
Signature
trial_running(m: i64[s], d: i64[s], last: i64[s], spf: i64[s], omega: i64[s], sqf: i64[s], phi: i64[s]) → f64[]
Structure
The function as NOVA stores it: one box per input, operation and output, and arrows that carry values. A double border marks another library function this one runs — called once, or by Scan once per element; select it to open that function.
- input
- operation
- constant
- call
- output
Verification
- Signature proven by NOVA’s shape solver, for every size.
- Equal to the reference
float(any(d*d <= m))in exact rational arithmetic, on all 40 test cases. - All 40 float64 results are exact: the error is zero.
- Interpreter and NumPy backend return bit-identical results.
- At float32 too: the 40 test cases rounded to float32, and 40 of them exact, with zero error.
Accuracy in detail
- correctly rounded (the float64 nearest the exact value)
- 100%
- bit-equal to the NumPy formula in float64
- 100%
- largest error, in units in the last place
- 0
Identity
sha256:2e4427c41547acbb45a4b32c6ac46ce2e200984b834c821773516d3d7db64c06The semantic hash of the graph. It changes when the program changes, and never when only its documentation does.
Control handle
- Symbol
- Ω:std.elementwise.trial_running · Ω:trial_running
- Pins
sha256:a5c8bf7feb13948ff3e5020ce18950de216925816abd4bc1a82214c300fb90c2this graph alone- Evidence
sha256:662a1b0930b3caa03d3bd462ce9007f1b1085482324cc6833acc9c5a3a1de1c8the hash of its verification record- Needs
- no capability: a pure function
Through NOVA’s control layer, the symbol launches this function only while the program still matches what it pins: a change to this graph, or to any graph it reaches, needs a migration first.