moved note up in file and added internal link. [skip azp] [skip actions] [skip cirrus]

Author: bmwoodruff

doc/source/reference/random/index.rst

@@ -56,6 +56,8 @@ pseudo-randomness was good for in the first place.
   or cryptographic purposes. See the :py:mod:`secrets` module from the
   standard library for such use cases.
 
+.. _recommend-secrets-randbits:
+
 Seeds should be large positive integers. `default_rng` can take positive
 integers of any size. We recommend using very large, unique numbers to ensure
 that your seed is different from anyone else's. This is good practice to ensure

doc/source/reference/random/parallel.rst

@@ -45,6 +45,10 @@ These properties together mean that we can safely mix together the usual
 user-provided seed with simple incrementing counters to get `~BitGenerator`
 states that are (to very high probability) independent of each other. We can
 wrap this together into an API that is easy to use and difficult to misuse.
+Note that while `~SeedSequence` attempts to solve many of the issues related to
+user-provided small seeds, we still :ref:`recommend<recommend-secrets-randbits>`
+using :py:func:`secrets.randbits` to generate seeds with 128 bits of entropy to
+avoid the remaining biases introduced by human-chosen seeds.
 
 .. code-block:: python
 
@@ -97,10 +101,6 @@ streams, about :math:`2^{20}`, then the probability that at least one pair of
 them are identical is about :math:`2^{-88}`, which is in solidly-ignorable
 territory ([2]_).
 
-Note that while `~SeedSequence` attempts to solve many of the issues related to
-user-provided small seeds, we still recommend using :py:func:`secrets.randbits` to generate
-seeds with 128 bits of entropy to avoid the remaining biases introduced by human-chosen seeds.
-
 .. [1] The algorithm is carefully designed to eliminate a number of possible
        ways to collide. For example, if one only does one level of spawning, it
        is guaranteed that all states will be unique. But it's easier to