From ad56f8e5aecc7eb85ccc14d8abd0d356d0079ff0 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Gregor=20Poga=C4=8Dnik?=
 <1640719+fiksn@users.noreply.github.com>
Date: Sat, 11 Sep 2021 23:24:08 +0200
Subject: [PATCH] Minor rewording

---
 ecc101.md  | 5 +++--
 schnorr.md | 4 ++++
 2 files changed, 7 insertions(+), 2 deletions(-)

diff --git a/ecc101.md b/ecc101.md
index 3d1f53a..403f690 100644
--- a/ecc101.md
+++ b/ecc101.md
@@ -1,4 +1,3 @@
-
 ## Eliptic Curve Cryptography 101
 
 An elliptic curve is defined by formula:
@@ -9,7 +8,7 @@ An elliptic curve is defined by formula:
 
 a and b are parameters that define the curve and are carefully tuned.
 
-Secp256k1 curve used by Bitcoin (and others) has the formula
+Secp256k1 curve (defined through Standards for Efficient Cryptography) used by Bitcoin (and others) has the formula
 
 ![equation](http://www.sciweavers.org/tex2img.php?eq=y%5E2%3Dx%5E3%2B7&bc=Black&fc=White&im=jpg&fs=12&ff=arev&edit=) (a = 0, b = 7) and looks like this:
 
@@ -54,6 +53,8 @@ Usually we are given a standard curve (like Secp256k1) and some generator point
 
 Basically random integer x can be a private key, while P = x*G is the public key. And knowing P or G doesn't help in any way to find out x. This is the eliptic curve discrete logarithm problem that is believed to be computationaly hard.
 
+Private key is usually a 256 bit long integer. It appears that P would have 512 bits (256 bits for x and 256 bits for y coordinate), but it actually suffices to use just one coordinate (due to the nature of eliptic curves) and one additional bit. So the representation of P is just 257 bits long.
+
 [Previous - main page](./README.md) 
 
 [Next - Schnorr Signature Scheme](./schnorr.md)
\ No newline at end of file
diff --git a/schnorr.md b/schnorr.md
index bd3cf4e..4e4d5da 100644
--- a/schnorr.md
+++ b/schnorr.md
@@ -2,6 +2,10 @@
 
 It was invented by german mathematician Claus-Peter Schnorr. Unfortunately he patented the scheme in 1988 (it expired in February 2008). So during the creation of Bitcoin it was "free", unfortunately the space lacked good libraries. Therefore ECDSA scheme was used.
 
+### Operation
+
+
+
 [Previous - ECC](./ecc101.md) 
 
 [Next - DLC](./dlc.md)
\ No newline at end of file