Topic: Game Theory question about segmented staking (Read 207 times)

I was wondering what the game theory problems are in segmenting staking into multiple segments, say 64 of them.

By a segment, I mean that each block, one of the segments would get an advantage in the earliest time they can stake. This active segment would rotate as each block arrives, so eventually all segments would have their turn at being first.

it is possible for a larger stake to win, even if not in the active segment. Let us assume a 2 second offset for each segment, so after 128 seconds, all segments would be eligible.

I think some interesting properties arise out of this. We end up with a resource allocation problem across all 64 segments. Clearly, if a segment was empty, the first one to get any coins there would have a big advantage. So the equilibrium state seems to be where all 64 segments get 1/64th the coins.

However, maybe there are some other stable equilibriums?

One example is how would someone with 51% of the stake, ensure they can get 51% of the blocks. Is that even possible with the segmenting? If not, what percentage of stake is needed to guarantee 51% of blocks?

I realize that some active management of coins in each segment is necessary and we assume this process is happening to secure the chain. The "mining" becomes more a game theoretic battle against all the other coins in each segment and maximizing the staking power of your coins