From 30b40e5820bcb575f21de228425313eee83e50db Mon Sep 17 00:00:00 2001
From: Jean-Luc PONS <pons@esrf.fr>
Date: Wed, 22 Apr 2020 18:43:47 +0200
Subject: [PATCH] Update README.md

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 0a666e4..7a8a920 100644
--- a/README.md
+++ b/README.md
@@ -33,7 +33,7 @@ Here is a brief description of the algorithm:
 
 We have to solve P = k.G, we know that k lies in the range [k1,k2], G is the SecpK1 generator point.
 
-n = floor(sqrt(k2-k1))+1
+n = floor(log2(sqrt(k2-k1)))+1
 
 * Create a jump point table jP = [G,2G,4G,8G,...,2^nG], 
 * Create a jump distance table jD = [1,2,4,8,....,2^n]