From 55253c48b4f352e03a4490cf8399136b68cd4816 Mon Sep 17 00:00:00 2001 From: Heimdall Date: Fri, 6 Nov 2026 04:34:57 +0000 Subject: [PATCH] Estate-rule sim: stake log_weight follows heimdall-stake's log form, no cliff at unit w = max(0, 1 + log_b(x/unit)); all 14 single and 12 split golden rows now pass. Co-Authored-By: Claude Sonnet 5.5 --- .../2026-11-05-estate-rule-sim/estatesim.py | 9 ++++----- .../2026-11-05-estate-rule-sim/test_estatesim.py | 16 +++++++--------- 2 files changed, 11 insertions(+), 14 deletions(-) diff --git a/docs/research/2026-11-05-estate-rule-sim/estatesim.py b/docs/research/2026-11-05-estate-rule-sim/estatesim.py index eba9812..d4693bc 100644 --- a/docs/research/2026-11-05-estate-rule-sim/estatesim.py +++ b/docs/research/2026-11-05-estate-rule-sim/estatesim.py @@ -471,18 +471,17 @@ def stake_params(name, overrides=()): def log_weight(x, b, unit): - """w = 1 + log_b(x/unit): 1 at x = unit, 0 (not negative) below unit. + """w = max(0, 1 + log_b(x/unit)): 1 at x = unit, continuous below it, 0 (not negative) once x <= unit/b. - Equals CultLib heimdall-stake `weight` with floor 0, cap None and min_amount_per_identity = unit, which - is the cliff at unit; Libby's continuous log below unit is not used. Pinned to her golden vectors by - test_estatesim.StakeVectors (vectors/stake_golden.csv). + Equals CultLib heimdall-stake `weight` (PR #9, 84f932ec) with floor 0, cap None and no minimum: no cliff + at unit. Pinned to its golden vectors by test_estatesim.StakeVectors (vectors/stake_golden.csv). This is the weight of ONE IDENTITY. It is not sybil-safe: log is sub-linear, so the same x split over k identities weighs more (split_weight). Whether the log bounds a purchase depends on identities being scarce, which nothing in this module supplies. b and unit are PLACEHOLDER values (STAKE_BASE).""" if b <= 1 or unit <= 0: raise ValueError("log base must exceed 1 and unit must be positive") - return 0.0 if x < unit else 1.0 + math.log(x / unit, b) + return max(0.0, 1.0 + math.log(x / unit, b)) if x > 0 else 0.0 def stake_weight(name, euros=0.0, hours=0.0, overrides=()): diff --git a/docs/research/2026-11-05-estate-rule-sim/test_estatesim.py b/docs/research/2026-11-05-estate-rule-sim/test_estatesim.py index 3fb0d9f..c4e9dd0 100644 --- a/docs/research/2026-11-05-estate-rule-sim/test_estatesim.py +++ b/docs/research/2026-11-05-estate-rule-sim/test_estatesim.py @@ -297,7 +297,8 @@ class StakeTests(unittest.TestCase): c = self.cfg() b, u = c["euro_b"], c["euro_unit"] self.assertEqual(E.log_weight(u, b, u), 1.0) - self.assertEqual(E.log_weight(u * .99, b, u), 0.0) # below unit: no weight, not negative + self.assertAlmostEqual(E.log_weight(u / 2, b, u), 1 + math.log(.5, b)) # below unit: continuous, no cliff + self.assertEqual(E.log_weight(u / b ** 2, b, u), 0.0) # clamped at 0, never negative self.assertAlmostEqual(E.log_weight(u * b ** 3, b, u), 4.0) # each factor b adds one self.assertLess(E.log_weight(10 * u, b, u), 10) # sub-linear @@ -359,7 +360,9 @@ class StakeTests(unittest.TestCase): self.assertAlmostEqual(each, 1 + math.log(a / (k * u), b)) self.assertAlmostEqual(tot, k * (1 + math.log(a / (k * u), b))) self.assertGreater(tot, E.log_weight(a, b, u)) - self.assertEqual(E.split_weight(a, int(a / u) + 1, b, u)[0], 0.0) # every fake below unit: nothing + kk = int(a / u) + 1 # every fake just below unit: still ~1 each, no cliff + self.assertAlmostEqual(E.split_weight(a, kk, b, u)[0], kk * (1 + math.log(a / (kk * u), b))) + self.assertGreater(E.split_weight(a, kk, b, u)[0], 0.99 * a / u) best, bk = E.best_split(a, b, u) self.assertGreaterEqual(best, tot) self.assertAlmostEqual(best, a / u) # b > e: best is k = a/unit, weight 1 each @@ -509,9 +512,8 @@ class HarnessTests(unittest.TestCase): class StakeVectors(unittest.TestCase): """Pins the arm's log_weight / split_weight to CultLib heimdall-stake's golden vectors (PR #9, head 84f932ec, - copied unmodified to vectors/stake_golden.csv). The arm is Libby's function with min_amount_per_identity = unit, - so rows at or above the unit must match; a row below the unit must be 0 in the arm (the cliff) while the - vectors, which set no minimum, give the continuous value. Vectors are integer cents and micro-weights, the + copied unmodified to vectors/stake_golden.csv). The arm is Libby's function with no minimum, + and every row (14 single, 12 split) must match, including those below the unit: no cliff. Vectors are integer cents and micro-weights, the arm is float and unit-agnostic: tolerance is 1 micro-weight per identity (Libby rounds each identity, the arm the total).""" @staticmethod @@ -528,12 +530,8 @@ class StakeVectors(unittest.TestCase): with self.subTest(kind=kind, b=b, unit=u, amount=a, k=k): if kind == "single": got = E.log_weight(a, b, u) * 1e6 - if a < u: - self.assertEqual(got, 0.0) # arm's cliff = min_amount_per_identity = unit - continue else: got = E.split_weight(a, k, b, u)[0] * 1e6 - self.assertGreaterEqual(a // k, u) # every split row keeps each identity at or above unit self.assertLessEqual(abs(got - expected), max(1, k))