Module court 

The complete-cost court.

Every candidate is fully serialized, then round-tripped through the normative decoder and byte-compared against the source, then priced from its actual serialized bytes. No candidate is admitted on an entropy estimate or on the plausibility of its logic.

Structs

CourtResult

The winning candidate after the court.

Functions

run

Run the court and return the strictly smallest exact candidate.