code wiki / _hdl_build / nx_auction_realtime.nx
nx_auction_realtime.nx
buildroot/runtime/_hdl_build/nx_auction_realtime.nx
about
nx_auction_realtime.nx -- MANHEIM-BUILD-L1: LIVE SIMULCAST auction (the real-time auctioneer-driven
channel, Manheim's flagship Simulcast lane), COMPOSED on the shared nx_auction_core engine.
Sovereign (nx_cc->nxasm, no gcc), pure integer-exact + deterministic.
KEY INSIGHT (genuine composition, not a reskin): a live open-outcry lot has NO fixed clock -- it stays
open while bids keep coming and the auctioneer's HAMMER falls after a FALLOW gap ("going once, going
twice, SOLD" = no new bid for hammer_window ticks). That dynamic close is EXACTLY the core's anti-snipe
extension rule GENERALIZED: set the initial close = start + hammer_window and snipe_window = extension =
hammer_window, and every live bid pushes the close to bid_time + hammer_window, while a bid arriving
after the fallow window finds the lot already hammered (rejected). So rt_resolve is a thin wrapper that
configures at_resolve -- one settlement engine, the live channel is a parameterization of it.
EXCEED axis (honest, not yet benched): the hammer is a DETERMINISTIC fixed fallow window, removing
auctioneer discretion / uneven timing / shill-pause -- a reproducible, auditable close.
GATE (self-validating): A live ascending sale where bids keep EXTENDING the close (110->134) then a
fallow-gap bid is REJECTED (hammer already fell); neg-control C with hammer_window=0 (no live extension)
flips the outcome to NO-SALE. A broken rule diverges a checked value -> verdict=RED.
Evidence -> knowledge/status/auction_realtime.log. license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_auction_core.nx
imported by: nobody (leaf or entry point)
call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown
structs
| none |
consts
| 22 | const RT_MAGIC_900000: i64 = 900000 |
| 23 | const RT_MAGIC_925000: i64 = 925000 |
| 24 | const RT_MAGIC_950000: i64 = 950000 |
| 25 | const RT_MAGIC_1000000: i64 = 1000000 |
| 26 | const RT_MAGIC_1010000: i64 = 1010000 |
| 27 | const RT_MAGIC_25000: i64 = 25000 |
| 29 | const RT_LOG: *u8 = "knowledge/status/auction_realtime.log" |
functions
| 31 | func rt_w(fd: i64, s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(fd, s, n); return 0 } |
| 32 | func rt_wn(fd: i64, v: i64) -> i64 { let bb: *u8 = sys_mmap(28); var m: i64=v; if m<0 {m=0-m; sys_write(fd,"-" as *u8,1)}; let t: *u8 = sys_mmap(28); var k: i64=0; if m==0 {t[0]=48;k=1}; while m>0 {t[k]=(48+(m%10)) as u8; m=m/10; k=k+1}; var i: i64=0; while i<k {bb[i]=t[k-1-i]; i=i+1}; sys_write(fd, bb, k); return 0 } |
| 37 | func rt_resolve(opening: i64, increment: i64, reserve: i64, start: i64, hammer_window: i64, bidder: *i64, amount: *i64, time: *i64, n: i64, out: *i64) -> i64 |
| 42 | func main() -> i64 |