68b8a2dbee
OpenPay (1 crate, 3751 LOC, 83 tests)
op-crypto-extra Extended crypto rails. Stablecoin catalog (USDC, USDT,
PYUSD, DAI, RLUSD, EURC, FDUSD — 26 deployments). L2
catalog (12 chains incl. Optimism, Arbitrum, Base,
zkSync Era, Polygon zkEVM, Linea, Scroll, Starknet).
CCTP v2 BurnMessage encode/decode + domain ids +
attestation. ERC-4337 UserOperation v0.7 +
PackedUserOperation. EIP-7702 set-EOA-code with RLP
signing preimage. Uniswap Permit2 single + batch
transfer EIP-712 hashes. EIP-2612 ERC-20 permit.
BOLT-11 bech32 invoices + LNURL decode. Bitcoin
PSBT v2 (BIP-370). Atomic-swap HTLC. Solana SPL /
Aleo / Aztec confidential-transfer sketches.
Smart Byte (1 crate, 2304 LOC, 30 tests)
smart-byte-acdc Authentic Chained Data Containers (KERI ecosystem).
Acdc + AcdcBuilder (targeted + untargeted) with SAID
derivation. JSON Schema 2020-12 validator with
oneOf partial-disclosure. TEL (RIP/VRT/ISS/REV)
with hash-chained verification. IPEX (apply/offer/
agree/grant/admit/spurn) chained by SAID. Edge
records (I2I/NI2I/DI2I) + EdgeGraph BFS traversal
with cycle detection. Selective disclosure with
full/none/subset plans + compact packing.
CredentialRegistry trait + InMemoryRegistry over
TEL. Composes with smart-byte-core + smart-byte-keri-witness.
EOC (1 crate, 1764 LOC, 16 tests)
eoc-memory Long-term memory primitives. Memory trait + MemoryKind +
EpisodeId. Episodic event log with TimeIndex range
queries. RDF-style Triple store with S/P/O indices.
Bounded attention-budget Scratchpad with
salience-weighted eviction. Rolling SummaryBuffer +
FIFO SlidingWindow. Dream-cycle consolidate()
(episodic → semantic). Ebbinghaus forgetting curve
with reinforcement. Retriever blending cosine
similarity + recency + saturating frequency.
MemGpt three-tier shape (Main/Recall/Archival).
Co-Authored-By: Claude Opus 4.7 <[email protected]>
48 lines
1.5 KiB
Rust
48 lines
1.5 KiB
Rust
//! Ebbinghaus forgetting-curve tests.
|
|
|
|
use eoc_memory::forget::{EbbinghausScorer, ForgetConfig};
|
|
|
|
#[test]
|
|
fn fresh_memory_has_full_retention() {
|
|
let scorer = EbbinghausScorer::new(ForgetConfig::default());
|
|
let r = scorer.retention(1_000, 1_000, 0);
|
|
assert!((r - 1.0).abs() < 1e-9, "retention at t=0 must be 1.0; got {r}");
|
|
}
|
|
|
|
#[test]
|
|
fn retention_decays_with_time() {
|
|
let cfg = ForgetConfig::new(1_000.0, 0.0, 0.2).expect("cfg");
|
|
let scorer = EbbinghausScorer::new(cfg);
|
|
let r_short = scorer.retention(0, 100, 0);
|
|
let r_long = scorer.retention(0, 10_000, 0);
|
|
assert!(r_short > r_long);
|
|
assert!(r_long < 0.001);
|
|
}
|
|
|
|
#[test]
|
|
fn reinforcement_slows_decay() {
|
|
let cfg = ForgetConfig::new(1_000.0, 1.0, 0.2).expect("cfg");
|
|
let scorer = EbbinghausScorer::new(cfg);
|
|
let r_unreviewed = scorer.retention(0, 5_000, 0);
|
|
let r_reviewed = scorer.retention(0, 5_000, 3);
|
|
assert!(
|
|
r_reviewed > r_unreviewed,
|
|
"reviewed retention {r_reviewed} must exceed unreviewed {r_unreviewed}"
|
|
);
|
|
}
|
|
|
|
#[test]
|
|
fn is_forgotten_at_threshold() {
|
|
let cfg = ForgetConfig::new(1_000.0, 0.0, 0.5).expect("cfg");
|
|
let scorer = EbbinghausScorer::new(cfg);
|
|
assert!(!scorer.is_forgotten(0, 0, 0));
|
|
// After enough time retention will fall below 0.5.
|
|
assert!(scorer.is_forgotten(0, 10_000, 0));
|
|
}
|
|
|
|
#[test]
|
|
fn invalid_config_is_rejected() {
|
|
assert!(ForgetConfig::new(0.0, 1.0, 0.5).is_err());
|
|
assert!(ForgetConfig::new(1.0, -0.1, 0.5).is_err());
|
|
assert!(ForgetConfig::new(1.0, 1.0, 1.5).is_err());
|
|
}
|