nx_auction_timed.nx

nx_auction_timed.nx -- MANHEIM-BUILD-L1: the TIMED WHOLESALE-AUCTION ENGINE, the defining marketplace primitive of a vehicle remarketing exchange (Manheim Timed Sales / OVE). Sovereign (nx_cc->nxasm, no gcc), pure integer-exact + deterministic -- the EXCEED axis vs opaque proprietary auction engines: every bid's accept/reject and the final settlement are a REPRODUCIBLE verdict (auditable), and the anti-snipe end-extension is a DETERMINISTIC fairness rule, not a human gavel. MODEL (all money in integer cents, all time in integer ticks): listing = {opening, increment, reserve, start, end, snipe_window, extension} bids = parallel arrays bidder[]/amount[]/time[], GIVEN IN TIME ORDER (the run-list is ordered). rules (at_resolve): * a bid is VALID iff start <= t <= effective_end AND amount >= required-min, where required-min = (no high bid yet ? opening : high + increment). * an accepted bid sets the new high (amount, bidder). * ANTI-SNIPE: an accepted bid landing within snipe_window of the close EXTENDS the close to t + extension (gives other dealers a fair chance -- kills last-tick sniping deterministically). * at close: SOLD to the high bidder iff high >= reserve, else NO-SALE (reserve not met). outputs via out[6]: [winner_bidder, winning_price, status(1=SOLD/0=NOSALE), final_end, accepted, rejected] main() is the SELF-VALIDATING GATE: two hand-computed scenarios with TIGHT expected values -- (A) a sale where a 195-tick bid extends the 200-tick close to 225, letting a 215-tick bid win (proves anti-snipe: WITHOUT extension that bid is after-close and a different bidder wins); (B) a no-sale where the top bid is below reserve. Plus reject controls (below-increment + after-close bids MUST be rejected). A broken rule diverges a checked value -> verdict=RED. Evidence -> knowledge/status/auction_timed.log. license_tier: ORIGINAL