Source-derived extension: 62-bit limbs

The recovered FreeLIP V1.0 source, whose README is dated May 1, 1995,
contains ALPHA and ALPHA50 configurations with NBITS=62. This is a
documented historical source branch, not an invented contemporary layout.

Fixed targets and bounds are unchanged from HYPOTHESES.txt:
  131: 0x10134db223421eb623422888a7879682, bound 2^131
  193: 0x23daf8a23206f9c4f299d7b21a9c369137f2c84ae1aa04, bound 2^193

M=2^107-1, A=3^121 mod M. Accepted draws expose the bottom 62 bits of
the updated state. The rejected interval is [M-(2^62-1), M-1].
The source fills the large integer from high limbs to low and then reduces
it modulo the bound. Whole retained low limbs preserve the accepted draws.

The fixed certificate proves no three consecutive states can be rejected:
the exact recurrence lattice has no nonzero vector in the cube of possible
three rejected-state tail offsets. Its determinant, membership identities,
Gram-Schmidt bound, and separate inverse-basis coefficient bound are checked
with exact integer and rational arithmetic. No lattice library is needed
for verification. Therefore every accepted-to-accepted gap is 1, 2, or 3.

The 131-bit case retains two whole limbs, and the 193-bit case retains three.
Enumerate all 3 and 9 possible gap sequences respectively. An additional
reversed chronology is a separate packing hypothesis, not source behavior.
The resulting 24 timing cases all contradict necessary modular identities.

This covers every possible initial state of the specified recurrence. It
does not cover other bounds, hashing, polynomial-basis reduction of an
oversized output, external calls interleaved among limbs, altered routines,
or historically incorrect machine arithmetic. It does not recover a seed.
