diff --git a/2000/bellard/README.md b/2000/bellard/README.md
index 8ce4abc40..e953e249d 100644
--- a/2000/bellard/README.md
+++ b/2000/bellard/README.md
@@ -1,11 +1,10 @@
 # Most Specific Output
 
-    Fabrice Bellard
-    451 chemin du mas de Matour
-    34790 Grabels
-    France
-
-    http://www.enst.fr/~bellard
+Fabrice Bellard  
+451 chemin du mas de Matour  
+34790 Grabels  
+France  
+<https://bellard.org>  
 
 ## To build:
 
@@ -27,16 +26,18 @@ Do. Or do not. There is no try. :-)
 
 ## Judges' remarks:
 
-This code is an nice compact example of a Modular Fast Fourier Transform.
-While its output is very specific, the internal FFT has a wide variety
-of uses.
+This code is a nice compact example of a Modular Fast Fourier Transform.  While
+its output is very specific, the internal FFT has a wide variety of uses.
 
 Can you modify this code to produce primes such as `23523*2^70000-1,
 48594^65536+1` or `6917!-1`?
 
-### Alternate code:
+NOTE: as bigger primes are found as time goes by this program no longer prints
+the biggest prime once noted by the author below.
 
-This program printed the biggest known prime number (2^6972593-1)
+## Author's comments:
+
+This program prints the biggest known prime number (`2^6972593-1`)
 in base 10. It requires a few minutes. It uses a Modular Fast
 Fourier Transform to compute this number in a reasonable amount
 of time (the usual method would take ages !).