You are viewing a single comment's thread from:
RE: Whitepaper Discussion on Voting Abuse
I realise I'm 2 months behind here but ...
If the curve was n.log.n then how much larger would 100k SP be compared to 1000 SP?
I realise I'm 2 months behind here but ...
If the curve was n.log.n then how much larger would 100k SP be compared to 1000 SP?
It depends a lot on the constant factors. Using log_2 and no fixed constant an example:
SP = 1 weight = 0
SP = 2 weight = 2
SP = 4 weight = 8
SP = 8 weight = 24
SP = 16 weight = 64
...
SP = 1024 weight = 10240
SP = 131072 weight = 1703936
So as you can see here doubling the SP results in "a bit more" than double the weight and increasing SP by 128x increases weight by 166x (compared to n^2 where doubling the SP results in 4x weight and 100x the SP results in 10000x the weight).
There are some technical reasons (some of which I understand and some of which I don't) that complicate implementing n log n. There are also philosophical/fairness/social reasons to want to preserve linear and not convey a programmatic advantage to the largest stakeholders in excess of their stake (even if only by a relatively modest degree).