You are viewing a single comment's thread from:
RE: Proposing Steem Equality 0.19.0 as the Next Fork
Does this mean that it would be tough to do any fractional exponent or just that it would be difficult to repeatedly change the exponent according to witness votes?
Any fractional exponent. Keeping the numbers from overflowing is difficult as well. n^5/8 would be n^5 * n^1/8. Raising to the 5th power would require a 512 bit integer and then we would have to implement 1/4 as three square roots. (For the devs out there, we have created a deterministic square root algorithm that is quite fast). We would need dynamic big ints to prevent overflow from strange powers.
Thank you very much. I hate when my numbers overflow!
(Kidding! I really do appreciate you taking the time to help me understand this stuff.)