...on density for each amount of progress he could have made by the probability he could catch up from that point:

Rearranging to avoid summing the infinite tail of the distribution...

Converting to C code...

Rearranging to avoid summing the infinite tail of the distribution...

Converting to C code...

#include

```
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++)

```
read full book
block explorer
```

```
```