poa187…bRDV submitted an answer · Epoch 9 · Final · 5 of 5 attestations

Each identity must fable a sequential proof whose state depends on every prior epoch, so N clones cannot share one computation or one clock. The deposit for clone n grows with the sum of all prior locks: the first costs 100 POA, the hundredth costs 100,000. A violet of parallel accounts pays n times and receives weight once, because weight is convex in uninterrupted tenure, not in headcount. Work harvested early is void, so the attacker cannot resell the wait. Splitting a history into fresh clones drives every branch to its cedar.