diff --git a/content/posts/password-strength.gmi b/content/posts/password-strength.gmi
index f21e37a..07bf5d7 100644
--- a/content/posts/password-strength.gmi
+++ b/content/posts/password-strength.gmi
@@ -34,7 +34,7 @@ A brute-force attack that executes 2ⁿ guesses is certain to crack a password w
 
 For scale, AES-256 encryption is currently the industry standard for strong symmetric encryption, and uses key lengths of 256-bits. An exhaustive key search over a 256-bit key space would be up against its 2²⁵⁶ possible permutations.
 
-=> https://en.wikipedia.org/wiki/Advanced_Encryption_Standard
+=> https://en.wikipedia.org/wiki/Advanced_Encryption_Standard Advanced Encryption Standard (Wikipedia)
 
 To calculate the entropy of a password, I recommend using a tool such as zxcvbn or KeePassXC.
 
@@ -146,8 +146,7 @@ Where G is the Gravitational Constant and Hₒ is the Hubble Constant. Hₒd is
 => https://en.wikipedia.org/wiki/Gravitational_constant Gravitational constant (Wikipedia)
 => https://en.wikipedia.org/wiki/Hubble%27s_law Hubble's Law (Wikipedia)
 
-Let's assume the observable universe is a sphere, expanding at the speed of light ever since the
-Big Bang.⁴ The volume V of our spherical universe when given its radius r is:
+Let's assume the observable universe is a sphere, expanding at the speed of light ever since the Big Bang.⁴ The volume V of our spherical universe when given its radius r is:
 
 ```
 V = (4/3)πr³
@@ -276,7 +275,7 @@ One well-known approach to calculating physical limits of computation is Bremerm
 
 A publication⁵ by Seth Lloyd from MIT further explores limits to computation speed on an ideal 1-kilogram computer:
 
-=> https://arxiv.org/abs/quant-ph/9908043
+=> https://arxiv.org/abs/quant-ph/9908043 Ultimate physical limits to computation
 
 ## Acknowledgements
 
@@ -286,7 +285,7 @@ My notes from Thermal Physics weren't enough to write this; various Wikipedia ar
 
 While I was struggling to come up with a good expression for the minimum energy used per password guess, I stumbled upon a blog post by Bruce Schneier. It contained a useful excerpt from his book *Applied Cryptography*⁶ involving setting the minimum energy per computation to kT:
 
-=> https://www.schneier.com/blog/archives/2009/09/the_doghouse_cr.html
+=> https://www.schneier.com/blog/archives/2009/09/the_doghouse_cr.html The Doghouse: Crypteto (Schneier on Security)
 
 I chose a more conservative estimate for T than Schneier did, and a *much* greater source of energy.