nx_parquet_gate.nx

nx_parquet_gate.nx -- GATE for the sovereign parquet reader (nx_parquet_lib), driven IN-PROCESS. Every wire rule the reader relies on is proven on PLANTED bytes with a known answer and a neg-control that must refuse: thrift varints and zigzag (a 150, a -1, an eleven-byte overrun, a truncated one), field headers (short and long form, delta accumulation, STOP), list headers (short and long form), the container skipper (a nested struct, a map, and a nesting deeper than the bound), the RLE and bit-packed hybrid (an RLE run, a bit-packed group, a mixed stream, width zero, a truncated run, a count over capacity), snappy (literal plus copies of all three offset widths, an overlapping copy, an offset before the buffer, a declared length the stream does not produce, an output that does not fit), and pq_open (not a parquet file, a footer length past the file, a truncated tail, a footer length bumped by five bytes). Then the REAL bytes: the BRIGHT pony examples and documents files (search.refs brightds26, pinned in knowledge/fetched) must reproduce the counts the dataset card declares (112 examples, 7894 documents), resolve a list column by its column name and not by its element name, reconstruct 2219 gold_ids over 112 rows with repetition levels, decode the first query and the first ids to their known bytes, refuse an out-of-range leaf or row group, and write the documents TSV deterministically (two writes byte-identical, 7894 rows, no null rows, the first row starting with the first document id). The real-file teeth SKIP, never acquit, when the fixtures are absent. license_tier: ORIGINAL No hw writes (Rule 26).