sqdist

std.geometry.sqdist · Level L0

Squared Euclidean distance between two points. Calls norm_sq.

‖x − y‖²

Signature

sqdist(x: f64[n], y: f64[n]) → 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.

xf64[n]yf64[n]Subtractdnorm_sqssf64[]
  • input
  • operation
  • constant
  • call
  • output

Verification

  • Signature proven by NOVA’s shape solver, for every size.
  • Equal to the reference np.sum((x - y) ** 2) in exact rational arithmetic, on all 40 test cases.
  • All 40 float64 results inside the running error bound; the closest uses 63% of it.
  • Interpreter and NumPy backend return bit-identical results.
  • At float32 too: the 40 test cases rounded to float32, and 40 of them inside the running error bound at u = 2⁻²⁴; the closest uses 32% of it.
Accuracy in detail
correctly rounded (the float64 nearest the exact value)
75%
largest error, in units in the last place
1.52

Identity

Calls
Called by
sha256:115250250585ba7faa921d7af8685c87967928a6bd9569cfa9403805804763c9

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

Control handle

Symbol
Ω:std.geometry.sqdist · Ω:sqdist
Pins
sha256:ffb57acc03538f5d5b20e09391b195be470a18318b69345967918adeed2aaf15this graph and the 2 it reaches through calls
Evidence
sha256:6a0624ef7de433c05e2f6a53aacbc4f01fa14342a8949fe7bbde8733c7c05864the 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.