This page answers:How far is my network from the critical point?
How to read this table: the same formula is run at several scales; the row marked “← your input” is the value you entered, and the rest are values at other scales.
There are only two stages, and the dividing line is n_critical: N < n_critical takes the exponent α (before the critical point), N ≥ n_critical switches to β (after the critical point) — this step is the if/else at L31 of the source, not a smooth transition.
“Network value V” and “Metcalfe value” are two different formulas: V = c×N^α (independent of avg), while Metcalfe = avg×N²÷2 (independent of c and α) — do not take the two for the same number.
int(N), the α/β branching, V, Metcalfe, the integer division for max_conn, density, distance to the critical point, critical progress) and the 8 returned fields at L44-53; the default parameters are copied from L24-28 (α=1.5, β=2.3, c=0.001, n_critical=1000, avg=100.0); the rounding digits are copied too (V 4 digits / Metcalfe 2 / density 6 / progress 1), using pyRound() to match Python's round-half-to-even.V = c×N^α is a value index (about 0.001×1000^2.3 ≈ 7943 at N=1000), not money; avg_value_per_user only enters the Metcalfe formula, never V.max_conn to 1 (the else 1 at L39), so at N=0 the density is connections÷1 — this page copies that as-is and does not correct it.c×N^α comes out as a complex number in Python and round() raises a TypeError; this page rejects negative values outright and does not simulate that exception.promotion_spirit/spread_algorithms/algo_network_effect.py uses V = N×avg×(1+density), does not divide Metcalfe by 2, and adds 0.7/0.3 density bands; /opt/algorithms/network_effect_engine.py (549 lines, with the first stretch L30-58 visible) has three stages pre/critical/post, two coefficient tiers c1=0.001 and c2=0.0001, and density bands 0.01/0.1. Item 1.6 of the inventory points to the functional version, so this page aligns only with the functional version — the three versions produce different numbers, so do not mix them./opt/algorithms/functional/network_effect.py (55 lines, read-only): default parameters = lines 25-28 (α=1.5, β=2.3, c=0.001, n_critical=1000, avg=100.0); computation = lines 30-42; the 8 returned fields = lines 44-53.int(N), the α/β branching (N < n_critical uses α), V = c×N^α, Metcalfe avg×N²÷2, max_conn = N(N−1)//2, density, distance to the critical point, critical progress and the rounding digits — all checkable line by line.N=1000, connections=999, avg_value_per_user=100 → since N ≥ n_critical it takes β: V = 0.001×1000^2.3 ≈ 7943.28; Metcalfe = 100×1000²÷2 = 50,000,000; density = 999 ÷ (1000×999÷2) = 0.002. The three numbers line up with the three formulas at lines 31-42.
/opt/slices_build/build.py from the spec /_shared/slices/network-effect.json — to change this page, edit the spec and re-run the generator; never hand-edit the HTML.