i have uploaded the example 3.23 it may help
(a)
If N is increased by 50% the new number of possible strings that can be generated is equal to (N + 50% of N) = 1.5N
Thus, the probability that it takes k+1 attempts from miners to unlock the reward, or the probability that the number of strings attempted before the reward is unlocked is equal to k is given by:
(b)
The R code for plotting the distributions is given below:
> k=0:250
> y=(1-1/100)^k*(1/100)
> z=(1-1/150)^k*(1/150)
> plot(k,y,type='p',col="red",ylab="P(X=k)")
> points(k,z,col="blue")
> legend(150,0.010,pch=1,col=c("red","blue"),legend=c("N =
100","N = 150"))
The output plot is given below:
For any queries, feel free to comment and ask.
If the solution was helpful to you, don't forget to upvote it by clicking on the 'thumbs up' button.
i have uploaded the example 3.23 it may help Policies on cryptocurrency mining typically decide which N to use in orde...