N = 10 and M = 100 then B = 64, and C = nB = 640
No, as sum(n) = N; usually we use n to count things, here I've used it (not a great choice) as a value of one utxo. To have a chance to stake 64 times (within 16h) you would have to split N = 10 into 64 chunks of n=0.15625 each (equal ns for simplicity).
commented on splitting coins, but his message is not clear to me.
Also,
- B – (time) maximum number of blocks that N coins can stake when M is a total number of staking coins
is not accurate enough
I meant
- B – (time) maximum number of blocks that N coins can stake within 16 h when M is a total number of staking coins
(now updated in the main text, thanks)
RE: CBR – The Way to Split Coins (DRAFT)