move paper and fix formatting

README.md

@@ -56,12 +56,6 @@ The final SNARK used in Nova (only using MSMs)
 - [Scalable Zero Knowledge via Cycles of Elliptic Curves](http://eprint.iacr.org/2014/595)
     - This paper introduces the notion of pairing-friendly cycles of curves, and shows how to use these to construct the first concretely efficient IVC/PCD scheme.
 
-- [Revisiting the Nova Proof System on a Cycle of Curves](https://eprint.iacr.org/2023/969)
-  - This paper analyzes the security of the Nova proving system when implemented on a cycle of curves.
-  The paper exploits a soundness bug in the original implementation (since patched) and produces a
-  convincing proof of $$2^75$$ rounds of the Minroot VDF in 1.46 seconds. A new optimized and secure
-  system is introduced together with a formal security proof.
-
 #### Halo
 
 The prototype of the delayed proving approach which Nova puts on steroids.
@@ -95,6 +89,12 @@ Classic works on the Nova proof system, including seminal papers and accompanyin
     - [Presentation](https://www.youtube.com/watch?v=BiKMCNKwaec)
 - [Sangria: a Folding Scheme for PLONK](https://github.com/geometryresearch/technical_notes/blob/main/sangria_folding_plonk.pdf)
     - [Presentation](https://www.youtube.com/watch?v=D7rQbHpxl7Q)
+- [Revisiting the Nova Proof System on a Cycle of Curves](https://eprint.iacr.org/2023/969)
+    - This paper analyzes the security of the Nova proving system when implemented on a cycle of curves.
+    The paper exploits a soundness bug in the original implementation (since patched) and produces a
+    convincing proof of $2^{75}$ rounds of the Minroot VDF in 1.46 seconds. A new optimized and secure
+    system is introduced together with a formal security proof.
+
 
 ### Nova Extensions (without high-degree gates)