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
12 lines
600 B
Plaintext
12 lines
600 B
Plaintext
// 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
|