diff --git a/Makefile b/Makefile
index e447175..7d87057 100644
--- a/Makefile
+++ b/Makefile
@@ -1,4 +1,4 @@
-FEATURES := nightly yolocrypto avx2_backend
+FEATURES := nightly simd_backend
 
 doc:
 	cargo rustdoc --features "$(FEATURES)" -- --html-in-header docs/assets/rustdoc-include-katex-header.html
diff --git a/src/backend/serial/scalar_mul/pippenger.rs b/src/backend/serial/scalar_mul/pippenger.rs
index bffe140..575291d 100644
--- a/src/backend/serial/scalar_mul/pippenger.rs
+++ b/src/backend/serial/scalar_mul/pippenger.rs
@@ -58,7 +58,7 @@ use prelude::*;
 /// However, if `w` is too big and `n` is not too big, then `(2^w/2)*A` could dominate.
 /// Therefore, the optimal choice of `w` grows slowly as `n` grows.
 ///
-/// This algorithm is adapted from section 4 of https://eprint.iacr.org/2012/549.pdf.
+/// This algorithm is adapted from section 4 of <https://eprint.iacr.org/2012/549.pdf>.
 pub struct Pippenger;
 
 #[cfg(any(feature = "alloc", feature = "std"))]
diff --git a/src/montgomery.rs b/src/montgomery.rs
index de0f8b7..d7a20d3 100644
--- a/src/montgomery.rs
+++ b/src/montgomery.rs
@@ -159,7 +159,7 @@ impl MontgomeryPoint {
 
 /// Perform the Elligator2 mapping to a Montgomery point.
 ///
-/// See https://tools.ietf.org/html/draft-irtf-cfrg-hash-to-curve-10#section-6.7.1
+/// See <https://tools.ietf.org/html/draft-irtf-cfrg-hash-to-curve-10#section-6.7.1>
 //
 // TODO Determine how much of the hash-to-group API should be exposed after the CFRG
 //      draft gets into a more polished/accepted state.