diff --git a/bip-DLEQ.mediawiki b/bip-DLEQ.mediawiki
index c5412b2f..b6ed6e4a 100644
--- a/bip-DLEQ.mediawiki
+++ b/bip-DLEQ.mediawiki
@@ -41,7 +41,7 @@ The basic proof generation uses a random scalar ''k'', the secret ''a'', and the
 * Let ''e = hash(R<sub>1</sub> || R<sub>2</sub>)''.
 * Let ''s = (k + e⋅a)''.
 
-Providing only the point being proven ''C'', and ''e'' and ''s'' as a proof does not reveal ''a'' or ''k''.
+Providing only ''C'', ''e'' and ''s'' as a proof does not reveal ''a'' or ''k''.
 
 Verifying the proof involves recreating ''R<sub>1</sub>'' and ''R<sub>2</sub>'' with only ''e'' and ''s'' as follows:
 
@@ -117,10 +117,6 @@ This proposal is compatible with all older clients.
 A reference python implementation is included [./bip-DLEQ/reference.py here].
 Test vectors can be generated by running `./bip-DLEQ/gen_test_vectors.py` which will produce a CSV file of random test vectors for both generating and verifying proofs. These can be run against the reference implementation with `./bip-DLEQ/run_test_vectors.py`.
 
-== Changelog ==
-
-TBD
-
 == Footnotes ==
 
 <references />