Routines written once in pseudo and checked at every level, so programs can use them by name instead of rewriting and re-verifying them: - stats: Mean, Variance (two-pass) - numerics: KahanSum, LinearInterp, Trapezoid - align: LinearGapPenalty, AffineGapPenalty, MatchScore, NeedlemanWunschScore - md: LennardJones, LennardJonesForce, MinimumImage, PairDistance - seq: GCContent, HammingDistance - special: ErfApprox (Abramowitz and Stegun 7.1.26) Each has contracts, cases, reference implementations in Python, Mojo and (for the numerical ones) C at more than one level, and nine have a Dafny proof over exact numbers. status.json and STATUS.md are written by pplus-core's library-check: every check passes or is open/unverified as listed there. The Mojo references still need the pinned compiler's answers (library-verify-mojo, network). Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01FgvbRdoEheAHqsRmr2WuKZ
11 lines
291 B
Mojo
11 lines
291 B
Mojo
from std.math import floor, sqrt
|
|
|
|
|
|
def pair_distance(a: List[Float64], b: List[Float64], box: Float64) -> Float64:
|
|
var total: Float64 = 0.0
|
|
for i in range(3):
|
|
var d = a[i] - b[i]
|
|
d = d - box * floor(d / box + 0.5)
|
|
total = total + d * d
|
|
return sqrt(total)
|