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
511 B
Plaintext
11 lines
511 B
Plaintext
// LennardJonesForce: the force between two particles at distance R under
|
|
// the Lennard-Jones potential, F(R) = -dV/dR
|
|
// = 24 Epsilon / R (2 (Sigma / R)^12 - (Sigma / R)^6).
|
|
// Positive pushes the particles apart; it is 0 at the bottom of the well.
|
|
FUNCTION LennardJonesForce(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 24.0 * Epsilon * (2.0 * S6 * S6 - S6) / R
|
|
ENDFUNCTION
|