M README.md → README.md

@@ -24,14 +24,14 @@ We use the zero-knowledge sum-check protocol from [Libra](https://eprint.iacr.org/2019/317.pdf) to transform the Spartan PIOP into a zero-knowledge PIOP. And use a technique from [BCG+17](https://eprint.iacr.org/2017/872.pdf) to make the polynomial commitment scheme zero-knowledge.
 
 
 ## Benchmarks
-
 | R1CS constraints | Proof gen | Proving key gen |
 | --- | --- | --- |
 | 2^12 | 60ms | 83ms |
 | 2^15 | 477ms | 85ms |
 | 2^18 | 4s | 169ms |
 
-_Measured on a M1 MacBook Pro_
+- On the secp256k1 base field
+- Measured on a M1 MacBook Pro
 
 ## Future work
 - [ ]  Employ *self-recursion* techniques from [Vortex](https://eprint.iacr.org/2022/1633.pdf)/[Orion](https://eprint.iacr.org/2022/1010.pdf) to make the proofs smaller.