update pep with ruling by GvR on randbelow, link to bitbucket repo

pep-0506.txt

@@ -129,7 +129,7 @@ have been suggested:
 
   - A function for choosing items from a sequence, ``secrets.choice``.
   - A function for generating an integer within some range, such as
-    ``secrets.randrange`` or ``secrets.randint``.
+    ``secrets.randrange`` or ``secrets.randint`` [#]_.
   - A function for generating a given number of random bits and/or bytes
     as an integer.
   - A similar function which returns the value as a hex digit string.
@@ -176,7 +176,7 @@ implementation::
 
 The ``secrets`` module itself will be pure Python, and other Python
 implementations can easily make use of it unchanged, or adapt it as
-necessary.
+necessary. An implementation can be found on BitBucket [#]_.
 
 Default arguments
 ~~~~~~~~~~~~~~~~~
@@ -377,12 +377,18 @@ References
        module.  Words do not begin to express how much I am looking forward to
        this.
 
+.. [#] After considerable discussion, Guido ruled that the module will instead
+       provide a function, ``randbelow``. See
+       http://code.activestate.com/lists/python-dev/138375/
+
 .. [#] https://mail.python.org/pipermail/python-ideas/2015-September/036271.html
 
 .. [#] https://mail.python.org/pipermail/python-ideas/2015-September/036350.html
 
 .. [#] https://github.com/pyca/cryptography/issues/2347
 
+.. [#] https://bitbucket.org/sdaprano/secrets
+
 .. [#] https://mail.python.org/pipermail/python-ideas/2015-September/036517.html
        https://mail.python.org/pipermail/python-ideas/2015-September/036515.html