Documentation

Complexitylib.Algebraic.LowerBound.Cutwidth.Extractor.Strong.Block.Recursion.NearHalving.Codec.Defs

Flat seed words for the near-halving recursion #

The trivial initial seed occupies no bits. Fresh field seeds follow in increasing level order, then the final condenser and hash seeds. Each field uses its canonical coefficient word, and the final concatenation is grouped as (prefix ++ condenser) ++ hash.

Decoding is total on arbitrary words. Exact inverse laws apply to words of the prescribed length. These semantic codecs use no field enumeration.

Total width of the first i fresh field seeds, with an empty initial prefix.

Equations
Instances For

    Encode fresh seeds in level order; the initial Unit seed contributes no bits.

    Equations
    Instances For

      Decode a prefix by splitting off its last fresh field word at the prior width.

      Equations
      Instances For

        Encode the recursive seed prefix, final condenser seed, then final hash seed.

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For

          Decode the recursive prefix and final two field words at their fixed offsets.

          Equations
          • One or more equations did not get rendered due to their size.
          Instances For