Login

u/Few-Bluebird9443

Emergence-first governance with formal proofs (RF V4.0): convergent validation without ground truth, Goodhart resistance, FEP-grounded convergence
▲ 2 r/Rad_Decentralization+1 crossposts

Emergence-first governance with formal proofs (RF V4.0): convergent validation without ground truth, Goodhart resistance, FEP-grounded convergence

7-minute video walkthrough plus the 63-page paper on Academia.edu. Six theorems with proofs combining the Free Energy Principle, inverse RL, Goodhart theory, and peer prediction. Empirical validation framework with falsifiable criteria.

Paper: https://www.academia.edu/164987005

GitHub: https://github.com/00ranman/extropy-engine

Feedback welcome.

youtu.be
u/Few-Bluebird9443 — 3 days ago
▲ 0 r/theydidthemath

[Request] If every person on Earth voted on what to have for dinner and we weighted their vote by how hungry they were... how long would it take to reach a consensus and would the answer just always be pizza?

Ok hear me out...

7 billion people. Everyone gets a vote on dinner. But your vote is weighted by how hungry you are on a scale of 1 to 10. A guy who skipped breakfast and lunch gets 10x more say than someone who just ate a sandwich.

But here's where it gets stupid...

Hunger changes over time. So does the vote. Every 15 minutes someone eats a snack and their vote weight drops. Meanwhile someone else just got out of a 3 hour meeting and their weight spikes.

Is there a point where the vote ever actually converges... or does it just oscillate forever because people keep eating and getting hungry again?

And if you freeze the vote at the moment of peak global hunger... what time of day is it and what does the world actually vote for?

Bonus question... does pizza win or does it depend on timezone?

reddit.com
u/Few-Bluebird9443 — 6 days ago
▲ 9 r/GEB+1 crossposts

Built a coordination layer that treats Gödel-incompleteness as a routing problem, not a wall. Looking for people to break it.

Posted here a year ago about an early version of this and got crickets. Fair. The framing was off. I led with "survives Gödel," which reads like a crank flag. Let me try again, honestly.

What it actually is: a loop architecture that mints a token (XP) only when measurable entropy reduction is validated across a closed loop. Propositions the system can't verify internally aren't "solved." They're externalized, DAG-audited, and routed around. That's the Gödel handling. Not a defeat. A detour.

The core loop:

Xt → At → XPt → Rt+1 → Xt+1

XP formula (v3.1.2):

XP = R · F · ΔS · wE · log(1+T)

- R = rarity (property of the action-class, never the actor, which kills the reputation-laundering attack)

- F = frequency-of-decay

- ΔS = measured entropy delta across eight domains (thermodynamic, informational, semantic, epistemic, behavioral, economic, relational, temporal)

- wE = domain weighting

- T = time-to-settle

The math is invariant under actor swap. Same ΔS, same XP, regardless of who reports it. That's the property I most want stress-tested.

Not claiming this is finished. Not claiming it's correct. Claiming it's specified well enough to break.

Code: https://github.com/00ranman/extropy-engine

Context/writing: https://lladnaros.com

Two things I'd actually like feedback on:

  1. The actor-invariance argument. Is the commutativity tight, or am I missing a Goodhart vector?
  2. The externalization step for unverifiable propositions. Is routing-around genuinely Gödel-respecting, or am I smuggling in a meta-system that just pushes the problem up a level?

Tear it up.

- Randall

u/Few-Bluebird9443 — 6 days ago