@ncitron.eth
Why are people proposing switching the state to a starked binary merkle tree instead of a ternary merkle tree?
The total amount of hashed data should be proportional to log_a(n)*a where a is the arity of the tree. This function has a minimum at e, which is closer to 3 than 2.
This correlates to a ~5% savings in amount of hashed data by using ternary over binary.