pairwise_dist

std.geometry.pairwise_dist · Level L1

Distances between every point of X and every point of Y. Calls pairwise_sqdist, and clamps at zero before the square root.

Dᵢⱼ = √max(0, ‖xᵢ‖² + ‖yⱼ‖² − 2·xᵢ·yⱼ)

Signature

pairwise_dist(X: f64[m, d], Y: f64[k, d]) → f64[m, k]

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[m, d]Yf64[k, d]0.0pairwise_sqdistD2MaximumsafeSqrtDDf64[m, k]
  • input
  • operation
  • constant
  • call
  • output

Verification

  • Signature proven by NOVA’s shape solver, for every size.
  • Agrees with the reference np.sqrt(((X[:, None, :] - Y[None, :, :]) ** 2).sum(-1)) to 80 digits (100-digit arithmetic), on all 40 test cases.
  • All 662 float64 results inside the running error bound; the closest uses 87% 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 84% of it.
Accuracy in detail
correctly rounded (the float64 nearest the exact value)
82%
largest error, in units in the last place
9.2e+3

Large ulp counts appear where a result is tiny next to the numbers it is computed from (after cancellation, for example), so one unit in the last place is tiny too; the absolute error is still inside the bound. Results within their own error of zero are not counted.

Note

The expanded squared distance can come out slightly negative when two points nearly coincide; Maximum clamps it so the square root never sees a negative number.

Identity

Calls
Called by
—
sha256:5becc82817af1b6379c3d146e69db7af71d63e05ab29fabcf5cc29af2761839a

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

Control handle

Symbol
Ω:std.geometry.pairwise_dist · Ω:pairwise_dist
Pins
sha256:265d6f7f9c94f3791ff6c1df2f01c32fc830f9d91503fcbdfd337bc43d346fe7this graph and the 1 it reaches through calls
Evidence
sha256:6756a7bd2ddaf420837d66b0305406847519d1e0d66f931b2125fa490a15863dthe 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.