Start pplus-library: 16 verified routines in six modules

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
This commit is contained in:
alexmandClaude committed 2026-10-05 11:58:22 +00:00
commit df12b2a008
103 files changed
+3025

No files matched your search

@@ -0,0 +1,10 @@
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)
@@ -0,0 +1,7 @@
import math
def pair_distance(a, b, box):
d = [x - y for x, y in zip(a, b)]
d = [v - box * math.floor(v / box + 0.5) for v in d]
return math.hypot(*d)
+40
View File
@@ -0,0 +1,40 @@
{
"name": "PairDistance",
"summary": "The distance between two points in a cubic periodic box, each coordinate difference taken by the minimum image convention.",
"tags": [
"molecular dynamics",
"periodic boundary conditions"
],
"sources": [
{
"title": "Allen and Tildesley, Computer Simulation of Liquids, section 1.5.2"
}
],
"cases": [
{
"call": "PairDistance([0.1, 0.1, 0.1], [0.9, 0.9, 0.9], 1.0)"
},
{
"call": "PairDistance([0.0, 0.0, 0.0], [3.0, 4.0, 0.0], 20.0)"
},
{
"call": "PairDistance([1.0, 2.0, 3.0], [1.0, 2.0, 3.0], 5.0)"
}
],
"references": [
{
"lang": "python",
"level": "plain",
"file": "ref/python/plain.py",
"note": "The same steps, with math.hypot of all three differences at once.",
"rel": 1e-15
},
{
"lang": "mojo",
"level": "plain",
"file": "ref/mojo/plain.mojo",
"note": "The same steps in Mojo, with the square root of the sum of squares.",
"rel": 1e-15
}
]
}
+11
View File
@@ -0,0 +1,11 @@
// PairDistance: the distance between two points in a cubic periodic box of
// side Box, each coordinate difference taken by the minimum image
// convention. HYPOT adds the squares without overflowing on the way.
USE md.MinimumImage
FUNCTION PairDistance(A : LIST OF FLOAT, B : LIST OF FLOAT, Box : FLOAT) RETURNS FLOAT
REQUIRE LENGTH(A) == 3 AND LENGTH(B) == 3 AND Box > 0.0
DECLARE Dx : FLOAT <- MinimumImage(A[0] - B[0], Box)
DECLARE Dy : FLOAT <- MinimumImage(A[1] - B[1], Box)
DECLARE Dz : FLOAT <- MinimumImage(A[2] - B[2], Box)
RETURN HYPOT(HYPOT(Dx, Dy), Dz)
ENDFUNCTION