fix ecdsa384

Author: Arvolear

docs/getting-started/guides/libs/crypto/ecdsa384.md

@@ -2,9 +2,13 @@
 
 ## Introduction
 
-This library provides functionality for ECDSA verification over any 384-bit curve. Currently, this is the most efficient implementation out there, consuming ~9 million gas per call.
+This library provides functionality for ECDSA verification over any 384-bit curve. Currently,
+this is the most efficient implementation out there, consuming ~8.025 million gas per call.
 
-The approach is Strauss-Shamir double scalar multiplication with 4 bits of precompute + projective points.
+The approach is Strauss-Shamir double scalar multiplication with 6 bits of precompute + affine coordinates.
+For reference, naive implementation uses ~400 billion gas, which is 50000 times more expensive.
+
+We also tried using projective coordinates, however, the gas consumption rose to ~9 million gas.
 
 ## Functions