Constant EDGES_PER_FACT 

pub const EDGES_PER_FACT: usize = 8;

Average relations per current fact the graph may hold before its weakest edges are pruned. Knowledge has no fact limit; this bounds edge density (an edge-producing loop cannot grow the graph faster than the facts it links), so the bound grows with the store instead of capping it.