optimizations.md: formatting fix

1 files changed, 1 insertions, 1 deletions

diff --git a/optimizations.md b/optimizations.md
index 2e600cfc6..20ac9aaf7 100644
--- a/optimizations.md
+++ b/optimizations.md
@@ -8,4 +8,4 @@
 | Field Arithmetic      |  Precomputed Tables                          |  Not Implemented                                                                                                        |  n/a, TODO                                                                                                                                                                                                                                 |                                                                                                                                                                                                                                                  | 
 | Elliptic Curve Points |  Extended Coordinates                        |  Implemented                                                                                                            |  [ExtendedCoordinates.v#L258](https://github.com/mit-plv/fiat-crypto/blob/master/src/CompleteEdwardsCurve/ExtendedCoordinates.v#L258)                                                                                                      |  http://hyperelliptic.org/EFD/g1p/auto-edwards.html                                                                                                                                                                                              | 
 | Elliptic Curve Points |  Point Compression                           |  Implemented                                                                                                            |  [PointEncodingPre.v#L313](https://github.com/mit-plv/fiat-crypto/blob/master/src/Encoding/PointEncodingPre.v#L313) and [PointEncodingPre.v#L412](https://github.com/mit-plv/fiat-crypto/blob/master/src/Encoding/PointEncodingPre.v#L412) |  Instead of transmitting $(x,y)$ to transmit a point, transmit $y$ and a bit representing the sign of $x$. Decode $x$ by solving the curve equation for $x^2$, taking the square root, and picking the square root with the appropriate sign bit | 
-| Low-Level             |  Use Varied-size Registers, Half-Implemented |  [MapCastWithCastOp.v#L116](https://github.com/mit-plv/fiat-crypto/blob/master/src/Reflection/MapCastWithCastOp.v#L116) |  Rather than using the largest available integer size (e.g., `uint32_t` on x86_32, `uint64_t` on x86_64) for all operations, pick the smallest integer size which is guaranteed to fit the result for each arithmetic operation separately |                                                                                                                                                                                                                                                  | 
+| Low-Level             |  Use Varied-size Registers| Half-Implemented |  [MapCastWithCastOp.v#L116](https://github.com/mit-plv/fiat-crypto/blob/master/src/Reflection/MapCastWithCastOp.v#L116) |  Rather than using the largest available integer size (e.g., `uint32_t` on x86_32, `uint64_t` on x86_64) for all operations, pick the smallest integer size which is guaranteed to fit the result for each arithmetic operation separately |                                                                                                                                                                                                                                                  |