diff --git a/readme.md b/readme.md
--- a/readme.md
+++ b/readme.md
@@ -10,7 +10,7 @@ Can be run straight from the cloned repo
 
 ## Performance ##
 
-As it is, the code is not very fast. Splitting takes _n_ evaluations of a polynomial of order _k_ over Galois field 256, leading to _O(n\*k)_ finite field multiplications. Reconstruction of the constant parameters during joining similarly takes _O(k\*k)_ multiplications.
+As it is, the code is not very fast. Let's assume we have a secret of length _m_. For each byte, the splitting takes _n_ evaluations of a polynomial of order _k_ over Galois field 256, leading to _O(n\*k\*m)_ finite field multiplications. Reconstruction of the constant parameters during joining takes _O(k\*k + k\*m)_ multiplications.
 
 Benchmark results, all values mean _seconds per byte_ of the secret length:
 <table>
@@ -21,23 +21,23 @@ Benchmark results, all values mean _seco
     </tr>
     <tr>
         <td>2 / 3 (a Raspberry Pi 3)</td>
-        <td>7.99e-05</td>
-        <td>0.000428</td>
+        <td>8.32e-05</td>
+        <td>0.000435</td>
     </tr>
     <tr>
         <td>2 / 3 (a laptop)</td>
-        <td>1e-05</td>
-        <td>6.7e-05</td>
+        <td>1.09e-05</td>
+        <td>7.17e-05</td>
     </tr>
     <tr>
         <td>254 / 254 (a Raspberry Pi 3)</td>
-        <td>0.417</td>
-        <td>0.471</td>
+        <td>0.414</td>
+        <td>0.0314</td>
     </tr>
     <tr>
         <td>254 / 254 (a laptop)</td>
-        <td>0.0431</td>
-        <td>0.0542</td>
+        <td>0.0435</td>
+        <td>0.00347</td>
     </tr>
 </table>