echo "Invalid argument to secure_random: infobytes='${infobytes}'" 1>&2
    return 1
  fi

  local out=""
  for (( i = 0; i < "${infobytes}"; i += 32 )); do
    # uuids have 122 random bits, sha256 sums have 256 bits, so concatenate
    # three uuids and take their sum. The sum is encoded in ASCII hex, hence the
    # 64 character cut.
    out+="$(
     (
       uuidgen --random;
       uuidgen --random;

// Tests for unmarshaling hashes that have hashed a large amount of data
// The initial hash generation is omitted from the test, because it takes a long time.
// The test contains some already-generated states, and their expected sums
// Tests a problem that is outlined in GitHub issue #29541
// The problem is triggered when an amount of data has been hashed for which
// the data length has a 1 in the 32nd bit. When casted to int, this changes

then the perpendicular velocity of any other emerging Ray CE which was AD/EF × CF, will be equal to the square Root of CD_q_ + (_MCq/NGq_ × CG_q_). And by squaring these Equals, and adding to them the Equals AD_q_ and MC_q_ - CD_q_, and dividing the Sums by the Equals CF_q_ + EF_q_ and CG_q_ + NG_q_, you will have _MCq/NGq_ equal to _ADq/EFq_. Whence AD, the Sine of Incidence, is to EF the Sine of Refraction, as MC to NG, that is, in a given _ratio_. And this Demonstration being general, without determining...