I will write a couple of mathematics posts about deriving an optimal strategy for maximising your voting value since I could not find a solid post with proofs. This post was sparked by a question of @iamstan.
On steemit you use voting power (VP) to vote. Luckily it is an infinte resource since it regenerates over time. The amount you can reward and the speed at which VP is replenished follows specific formulas. You can find an overview of them over here. In this post I will derive a formula for the VP you have left after a single vote. From this we will then derive an easy formula for the amount of VP left after n-votes at equally spaced times. Your vote value is equal to VP x Constant where the constant depends on a number of account specific properties. So using these formulas we can derive the value of casting n-votes. In a later post we can then optimise the total value of the votes cast in relation to voting value.
The intermediate calculations require some basic calculus, but you can also skip these if you are yet uninitiated to the calculus cult.
Assumptions and notations
I will just be looking at votes cast at 100% weight. Also I will be assuming that all votes are cast at equally spaced times.
vn is VP rate at the n-th vote and Δt is the time interval in minutes between two votes
VP is generated at fixed amount per time interval. I will just be working with minutes. So denote by
R the VP generated per minute
v1 and v2 : VP at the first two votes
So the first vote you cast is equal to your starting VP so v1 . So that's easy. After you voted your VP will be reduced by a value determined by your previous vote which is c 1(v1 + c 0) where c0 , c1 are two positive constants. In the time between your first vote and your second vote you regenerate VP equal to R Δt . Observe that the time between votes could be so big that our VP has already been fully replenished. So the VP directly after you cast your second vote is equal to
vn +1 : VP at the n+1-th vote
The cost of a vote on your VP is determined by your previous VP. Making it a recursive relation. After you cast your n+1-th vote your VP will be reduced by a value determined by your previous vote which is c 1(vn + c 0) where c0 , c1 are the two same positive constants as mentioned earlier. In the time between your n-th vote and your (n+1)-th vote you regenerate VP equal to R Δt . Then the equation we end up with is
Now assume that fk ≤ 1 for all k ≤ n+1. This means that there is no time interval where our VP is 1. Note that under this assumption the VP rate can equal 1 at the exact time we vote. Then, with some calculus, we obtain this cool formula for the VP after n+1-votes:
vtot : the sum of VP
Recall that the value of a vote is equal to VP x constant. So the total value of N-votes is determined by
times a constant. Let us assume that fk ≤ 1 for all k ≤ N . Then, yet again with the magic of calculus we can show that
That is all for now, all the opimisation stuff postponed to the next post.
There is a MathOwl shop which sells my artsy fartsy stuff. If you got some spare money head over there. You can learn about the colors of pi over here here. I also have really cheap stuff available like these stickers They are an absolute hoot.
#steemSTEM is a community project with the goal to promote and support Science, Technology, Engineering and Mathematics related content and activities on the STEEM blockchain. If you wish to support the #steemSTEM project you can: Contribute STEM content using the #steemstem tag | Support steemstem authors | Join our curation trail | Join our Discord community | Delegate SP to steemstem