AttackerSuccessProbability
1234567891011121314151617181920212223242526272829
#include<stdio.h>
#include<math.h>
double AttackerSuccessProbability(double q, int z)
{
double p = 1.0 - q;
double lambda = z * (q / p);
double sum = 1.0;
int i, k;
for (k = 0; k <= z; k++)
{
double poisson = exp(-lambda);
for (i = 1; i <= k; i++)
poisson *= lambda / i;
sum -= poisson * (1 - pow(q / p, z - k));
}
return sum;
}
int main() {
//If the attacker is one block behind and there is 49% of dishonest nodes
double prob = AttackerSuccessProbability(0.49, 1);
puts("The probability of the success of the attacker when they are 1 block behind the honest 51% majority of nodes:");
printf("%f\n", prob);
return 0;
}
C
INFO