Keep the stones
Everyone keeps their own stones. They can shield themselves from attacks, but we assume some danger remains.
A thought experiment / Research note
Hand them to one person. Hope they destroy them. Now suppose the factories can make more.
We proved a small but surprising result: the average time until the stones return cannot, by itself, guarantee that a risky handover is worth it.
Try the three worldsThe scenario belongs to CYBRDELIC (@cybrdelic) ↗
31 August 2026. The model and its assumptions are ours.
The rules we added
Everyone keeps their own stones. They can shield themselves from attacks, but we assume some danger remains.
One person gets all the stones. They might use that power against everyone. If they destroy the stones instead, the world is safe for a while.
Factories eventually make more stones. You face the same choice again. Every handover is a fresh gamble: a past success does not make the next one safe.
What “better” means here: more safe time, on average. These are made-up risks for a thought experiment.
Experiment 01 / Change the pattern
Every world below has the same 20-year average pause. Move the risk, then change how often the uneven world returns early. The other assumptions stay the same.
The example starts with about a 2% yearly danger while keeping the stones, and gives nearer safe years extra weight. Try changing either.
Always returns after 20 years.
The chance of returning stays the same each year. Average: 20 years.
90% return after 1 year; 10% after 191 years.
Same average, opposite answers: handover helps in the reliable world but hurts in the uneven one.
90% × 1 + 10% × 191 = 20 years
For the uneven world, multiply each pause by its chance, then add. Rare long pauses can hide lots of early returns.
How to read this: if the black line is inside the purple bar, handover is worth its risk. The safety score adds up the safe years you can expect, giving nearer years extra weight if you chose that above. Higher is better; the green box shows the score for keeping the stones. Each card assumes you repeat the handover whenever new stones appear.
Experiment 02 / Change what you know
The average is still 20 years. Now imagine you do not know the pattern—only how early or late the stones could return. Is that enough information to make a decision?
This uses the risk and safety settings you chose above.
The known limits still allow opposite decisions.
The worst pattern mixes the earliest and latest returns. The best returns after exactly 20 years every time. Other patterns can give any answer between these two.
Green: handover is worth it for every pattern allowed by your settings. Stripes: you need more information. Beyond the stripes: keeping wins. Exactly at a boundary, a tie may be possible.
The proved result / Within this model
If you give any extra weight to safety soon, an average pause alone cannot justify even a tiny handover risk. Some pattern with that same average will make keeping the stones better.
Make early returns very common. Offset them with rare, very long pauses. The average stays fixed while the tolerable handover risk approaches zero.
Knowing the stones cannot return for a certain time changes that. So does permanent removal of production. The theorem identifies the missing information; it does not say disarmament always fails.
Read the complete proof ↗One more twist
Count a safe year far in the future just as much as a safe year today, and the average becomes enough. All three cards agree. Move “How much nearer years matter” to zero to see it.
Give even a little extra weight to nearer years, and some extremely uneven pattern can still spoil that guarantee. As you become more patient, that troublesome pattern becomes more extreme. No single world suddenly jumps from one answer to another.
Show the work
The written proof covers every comeback pattern allowed by the model. We also checked the calculator a different way: follow the world through time, adding up safe years and tracking failed handovers.
Verification record ↗Read before generalizing
This is not one immortal person's hidden good-or-evil personality. If a successful first handover proves that the person is permanently trustworthy, the comeback pattern stops mattering. The proof explains that alternative too.
We do not price freedom, inequality, useful applications, or the incentives of an elite. The note addresses a narrower question than the original three-way dilemma.
We assume each round starts fresh, with the same rules. Factories and handovers do not influence each other's luck. Learning, better technology, or people deliberately rebuilding weapons could change the answer.
This note pins down exactly what an average and time limits can tell us in this scenario. The underlying maths and the problem of trusting someone during disarmament are older ideas. We have not established that nobody has derived this result before. External peer review is still pending.
Credit where it belongs
31 August 2026. Original scenario credit; no coauthorship or endorsement implied. The follow-up invitation ↗
1997. Losing the ability to protect yourself during disarmament was already a serious research problem.
2006. Agreements that change future power can undermine their own enforcement.
MIT notes, Chapter 4. The mathematical machinery for a system that starts again.
1959. The endpoint bound is classical; we use it rather than claim to have invented it.