color_running

std.linalg.color_running · Level L1

Whether the colouring search is still running: 0 ≤ p < n, as 1 or 0. It ends with p = n when a colouring is complete, and with p = −1 when none exists. The condition k_colorable loops on.

[0 ≤ p < n]

Signature

color_running(p: f64[], col: f64[n], A: f64[n, n], k: f64[]) → 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.

pf64[]colf64[n]Af64[n, n]-1.0kf64[]SizenGreaterstartedLessbefore_endMultiplygogof64[]
  • input
  • operation
  • constant
  • call
  • output

Verification

  • Signature proven by NOVA’s shape solver, for every size.
  • Equal to the reference float(0 <= p < n) 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

Calls
—
Called by
sha256:6b70b0dcf2143c33ac0ae94aa83cbeac6b41ffa40134e89417350b00a8e0c8cc

The semantic hash of the graph. It changes when the program changes, and never when only its documentation does.

Control handle

Symbol
Ω:std.linalg.color_running · Ω:color_running
Pins
sha256:7ff16346898153c248a80ebe55ae90f121df8e66c7a46bb5b9a6a06bfcc63d91this graph alone
Evidence
sha256:5c9af3700ebd5ff14edf770bc4f78fc68976dae8ac2f9d6b9555668aa97bd19ethe 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.

ΣEML 2026

Efficient New Language — a high-density semantic overlay for humans and AI agents.

This site’s demos run on the real EML toolchain, in your browser.

© 2026 EveMissLab (一言諾科技有限公司) / Neo.K. All rights reserved.