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,12 @@
{
"tool": "dafny",
"version": "4.11.0",
"flags": [
"verify",
"--resource-limit",
"20000000"
],
"source_sha256": "0dc08be0ccc13bef1bbad5bc4fa8efc54c39005c803c770a79fec941913ffb86",
"verdict": "verified",
"summary": "14 verified, 0 errors"
}
@@ -0,0 +1,59 @@
function Pow(x: real, n: nat): real
{
if n == 0 then 1.0 else x * Pow(x, n - 1)
}
function LJ(r: real, epsilon: real, sigma: real): real
requires r > 0.0
{
4.0 * epsilon * (Pow(sigma / r, 12) - Pow(sigma / r, 6))
}
lemma PowAdd(x: real, a: nat, b: nat)
ensures Pow(x, a + b) == Pow(x, a) * Pow(x, b)
{
if a > 0 {
PowAdd(x, a - 1, b);
assert Pow(x, a + b) == x * Pow(x, a - 1 + b);
}
}
lemma Pow2(x: real)
ensures Pow(x, 2) == x * x
{
assert Pow(x, 1) == x;
}
lemma Pow6(s: real)
ensures Pow(s, 6) == (s * s) * (s * s) * (s * s)
{
Pow2(s);
PowAdd(s, 2, 2);
PowAdd(s, 4, 2);
}
lemma Pow12(s: real)
ensures Pow(s, 12) == Pow(s, 6) * Pow(s, 6)
{
PowAdd(s, 6, 6);
}
method LennardJones(r: real, epsilon: real, sigma: real) returns (v: real)
requires r > 0.0
ensures v == LJ(r, epsilon, sigma)
{
var s := sigma / r;
var s2 := s * s;
var s6 := s2 * s2 * s2;
Pow6(s);
Pow12(s);
v := 4.0 * epsilon * (s6 * s6 - s6);
}
// The potential crosses zero at R = Sigma.
lemma ZeroAtSigma(epsilon: real, sigma: real)
requires sigma > 0.0
ensures LJ(sigma, epsilon, sigma) == 0.0
{
assert sigma / sigma == 1.0;
}
@@ -0,0 +1,5 @@
double lennard_jones(double r, double epsilon, double sigma) {
double s2 = (sigma / r) * (sigma / r);
double s6 = s2 * s2 * s2;
return 4.0 * epsilon * (s6 * s6 - s6);
}
@@ -0,0 +1,4 @@
def lennard_jones(r: Float64, epsilon: Float64, sigma: Float64) -> Float64:
var s2 = (sigma / r) * (sigma / r)
var s6 = s2 * s2 * s2
return 4.0 * epsilon * (s6 * s6 - s6)
@@ -0,0 +1,4 @@
def lennard_jones(r, epsilon, sigma):
s2 = (sigma / r) * (sigma / r)
s6 = s2 * s2 * s2
return 4.0 * epsilon * (s6 * s6 - s6)
@@ -0,0 +1,2 @@
def lennard_jones(r, epsilon, sigma):
return 4.0 * epsilon * ((sigma / r) ** 12 - (sigma / r) ** 6)
+63
View File
@@ -0,0 +1,63 @@
{
"name": "LennardJones",
"summary": "The Lennard-Jones pair potential at distance R, with well depth Epsilon and zero-crossing distance Sigma.",
"tags": [
"molecular dynamics",
"pair potential"
],
"sources": [
{
"title": "Jones, On the determination of molecular fields II, Proc. R. Soc. A 106 (1924)",
"url": "https://doi.org/10.1098/rspa.1924.0082"
},
{
"title": "Allen and Tildesley, Computer Simulation of Liquids, section 1.4"
}
],
"cases": [
{
"call": "LennardJones(1.0, 1.0, 1.0)"
},
{
"call": "LennardJones(1.122462048309373, 1.0, 1.0)"
},
{
"call": "LennardJones(2.5, 0.238, 3.4)"
},
{
"call": "LennardJones(0.9, 1.0, 1.0)"
}
],
"references": [
{
"lang": "python",
"level": "multiply",
"file": "ref/python/multiply.py",
"note": "The same multiplications."
},
{
"lang": "python",
"level": "powers",
"file": "ref/python/powers.py",
"note": "The textbook formula with ** 12 and ** 6: the same function, rounded differently, held to agree to 12 digits.",
"rel": 1e-12
},
{
"lang": "c",
"level": "multiply",
"file": "ref/c/multiply.c",
"note": "The same multiplications in C."
},
{
"lang": "mojo",
"level": "multiply",
"file": "ref/mojo/multiply.mojo",
"note": "The same multiplications in Mojo."
}
],
"proof": {
"lang": "dafny",
"file": "proof/lennard_jones.dfy",
"note": "Over real numbers the multiplications compute the textbook formula exactly, and V(Sigma) = 0."
}
}
+11
View File
@@ -0,0 +1,11 @@
// LennardJones: the Lennard-Jones pair potential at distance R,
// V(R) = 4 Epsilon ((Sigma / R)^12 - (Sigma / R)^6). Epsilon is the depth of
// the well, reached at R = 2^(1/6) Sigma, and V is 0 at R = Sigma. The powers
// are built by multiplication from (Sigma / R)^2, as simulation codes do,
// which is faster than ^ and rounds a little differently.
FUNCTION LennardJones(R : FLOAT, Epsilon : FLOAT, Sigma : FLOAT) RETURNS FLOAT
REQUIRE R > 0.0
DECLARE S2 : FLOAT <- (Sigma / R) * (Sigma / R)
DECLARE S6 : FLOAT <- S2 * S2 * S2
RETURN 4.0 * Epsilon * (S6 * S6 - S6)
ENDFUNCTION