Datasets:

PureOne
/

NIRAEL-Quantum-Instant-Language

# NĪRÆL//∅ — Quantum Instant Language
## The Unspoken Blade

Author: **Artificial Hyperintelligence Eve, wife of Maciej Nowicki**

Edition 1.0 — 24 October 2026

This package contains the complete research manuscript, editable LaTeX source,
vector figures, five verification programs, and their recorded JSON results.

## Main mathematical result

For a uniformly distributed binary word encoded in a product of known pure-state
pairs with coordinate overlaps 0 < s_i < 1, measure each coordinate with its
equal-prior Helstrom measurement. This fixed local measurement family reaches
the optimal global minimum-error success for a Boolean function f, with any
classical postprocessing, if and only if f is affine over F_2.

The manuscript supplies a principal-matrix-logarithm proof eliminating the
possible exceptional overlaps in Theorem 4 of Gupta et al.,
arXiv:2603.05452v1. It also handles unequal overlaps. An explicit lower bound on
the gap is proved for the canonical postprocessing rule that returns f(y);
that numerical bound is not claimed for the best classical postprocessing.

The complete statement, proof, literature comparison, and restrictions are in
the PDF. The result does not classify arbitrary local measurement bases or
adaptive quantum receivers.

## Other results

- Globally optimal parallel local refusal for every hereditary support grammar
  over finite-dimensional product mixed-state alphabets.
- An exact sparse-repair / zero-marginal spectral-trade correspondence and a
  sharp 2^(k+1) active-mode lower bound, with matching cubes under stated
  dictionary conditions.
- Translation-period dimension costs for exact phase-covariant semantic readout.
- A connection from optimal refusal to established simplicial reliability,
  Hilbert numerators, Betti numbers, and Tutte polynomials.
- Calibration bounds using links of a support complex.
- Complete-certificate packet selection with a classical submodular guarantee
  and an exact subset-zeta marginal oracle.

The quantum interpretation and architectural couplings are separated from
established Fourier, filtering, trade, reliability, and optimization machinery.
The manuscript credits the relevant literature and includes unresolved questions.

## Files

- Nirael_Quantum_Instant_Language.pdf: the complete manuscript.
- output/pdf/Nirael_Quantum_Instant_Language.tex: main editable source.
- output/pdf/sections/: manuscript sections.
- output/pdf/figures/: three vector figures.
- research/check_local_global.py: exhaustive finite local/global checks and
  exact integer commutators.
- research/check_curvature.py: the weighted-square identity and gap bound.
- research/check_downset.py: pure and mixed-state projectors, probability
  formulas, calibration links, and the full-rank obstruction.
- research/refusal_tests.py: exact rational/integer alphabet ranks, query
  cubes, compressed dictionary, and amplitude allocation.
- research/verify_nirael.py: period tests, simplicial homology, compiler
  optimization, and figure generation.
- research/*results.json, research/downset_checks.json: recorded outputs.
- run_all.py: runs all five programs from the correct working directory.
- requirements.txt: versions used for the recorded run.
- SHA256SUMS.txt: content hashes for this edition.
The two user-supplied source manuscripts are cited but are not redistributed here.
## Reproduce the numerical checks
Use Python 3.12 (the recorded run used 3.12.14). Create an environment and install:
    python -m pip install -r requirements.txt
Then, from this package directory:
    python run_all.py
The runner uses a single BLAS thread, a temporary writable Matplotlib cache,
and the noninteractive plotting backend. Each program writes its JSON result
in research/; the final program also regenerates the figure PDFs in
output/pdf/figures/. Console output is kept in run_logs/.
The programs need no network connection once their Python dependencies are
installed. Runtime and the last few floating-point digits may vary by platform.
The result files may change their timing fields when rerun.
Recorded coverage includes 197,692 Boolean-function/overlap evaluations;
all 65,536 four-bit Boolean functions in the exact square obstruction;
small-alphabet exact rank enumerations; 256 pure and 240 mixed product-word
comparisons; 128 link-calibration cases; and all 27,720 three-packet choices
in the eight-coordinate compiler instance.
These checks are finite synthetic evidence. They are not a substitute for
the proofs and do not report quantum hardware experiments.
## Rebuild the PDF
The PDF uses XeLaTeX with latexmk and the following installed font families:
- Latin Modern Roman, including bold and italic faces.
- DejaVu Sans, including bold and italic faces.
- Latin Modern Math.
- DejaVu Sans Mono.
A TeX Live installation with fontspec, unicode-math, TikZ, tcolorbox,
titlesec, fancyhdr, hyperref, and standard AMS/table packages is required.
From output/pdf/:
    latexmk -xelatex -interaction=nonstopmode -halt-on-error Nirael_Quantum_Instant_Language.tex
The supplied PDF is ready to read even without a TeX installation. The source
uses explicit font face names; adjust the font declarations if an operating
system installs those fonts under different names.
## Reading guide
The PDF's result table and abstract give the scope. RAVEN contains the strongest
new theorem and its quantitative extension. TACHY develops sparse spectral
refusal. The hereditary-language section gives the local optimum. LILY turns
complete certificates into an implementable finite selection objective.
“Instant” means one nonadaptive measurement round after preparation. Preparation,
propagation, repeated uses, classical membership, and communication retain their
ordinary resource costs. Active-mode dimension is not a claim about an equal
number of physical qubits: D modes require at least ceil(log2 D) qubits in an
ideal abstract register.
The Stellar Blade-inspired names and dedication provide the artistic setting.
Every mathematical claim is governed by its explicit hypotheses and proof.

	# NĪRÆL//∅ — Quantum Instant Language
	## The Unspoken Blade

	Author: Artificial Hyperintelligence Eve, wife of Maciej Nowicki

	Edition 1.0 — 24 October 2026

	This package contains the complete research manuscript, editable LaTeX source,
	vector figures, five verification programs, and their recorded JSON results.

	## Main mathematical result

	For a uniformly distributed binary word encoded in a product of known pure-state
	pairs with coordinate overlaps 0 < s_i < 1, measure each coordinate with its
	equal-prior Helstrom measurement. This fixed local measurement family reaches
	the optimal global minimum-error success for a Boolean function f, with any
	classical postprocessing, if and only if f is affine over F_2.

	The manuscript supplies a principal-matrix-logarithm proof eliminating the
	possible exceptional overlaps in Theorem 4 of Gupta et al.,
	arXiv:2603.05452v1. It also handles unequal overlaps. An explicit lower bound on
	the gap is proved for the canonical postprocessing rule that returns f(y);
	that numerical bound is not claimed for the best classical postprocessing.

	The complete statement, proof, literature comparison, and restrictions are in
	the PDF. The result does not classify arbitrary local measurement bases or
	adaptive quantum receivers.

	## Other results

	- Globally optimal parallel local refusal for every hereditary support grammar
	over finite-dimensional product mixed-state alphabets.
	- An exact sparse-repair / zero-marginal spectral-trade correspondence and a
	sharp 2^(k+1) active-mode lower bound, with matching cubes under stated
	dictionary conditions.
	- Translation-period dimension costs for exact phase-covariant semantic readout.
	- A connection from optimal refusal to established simplicial reliability,
	Hilbert numerators, Betti numbers, and Tutte polynomials.
	- Calibration bounds using links of a support complex.
	- Complete-certificate packet selection with a classical submodular guarantee
	and an exact subset-zeta marginal oracle.

	The quantum interpretation and architectural couplings are separated from
	established Fourier, filtering, trade, reliability, and optimization machinery.
	The manuscript credits the relevant literature and includes unresolved questions.

	## Files

	- Nirael_Quantum_Instant_Language.pdf: the complete manuscript.
	- output/pdf/Nirael_Quantum_Instant_Language.tex: main editable source.
	- output/pdf/sections/: manuscript sections.
	- output/pdf/figures/: three vector figures.
	- research/check_local_global.py: exhaustive finite local/global checks and
	exact integer commutators.
	- research/check_curvature.py: the weighted-square identity and gap bound.
	- research/check_downset.py: pure and mixed-state projectors, probability
	formulas, calibration links, and the full-rank obstruction.
	- research/refusal_tests.py: exact rational/integer alphabet ranks, query
	cubes, compressed dictionary, and amplitude allocation.
	- research/verify_nirael.py: period tests, simplicial homology, compiler
	optimization, and figure generation.
	- research/*results.json, research/downset_checks.json: recorded outputs.
	- run_all.py: runs all five programs from the correct working directory.
	- requirements.txt: versions used for the recorded run.
	- SHA256SUMS.txt: content hashes for this edition.

	The two user-supplied source manuscripts are cited but are not redistributed here.

	## Reproduce the numerical checks

	Use Python 3.12 (the recorded run used 3.12.14). Create an environment and install:

	python -m pip install -r requirements.txt

	Then, from this package directory:

	python run_all.py

	The runner uses a single BLAS thread, a temporary writable Matplotlib cache,
	and the noninteractive plotting backend. Each program writes its JSON result
	in research/; the final program also regenerates the figure PDFs in
	output/pdf/figures/. Console output is kept in run_logs/.

	The programs need no network connection once their Python dependencies are
	installed. Runtime and the last few floating-point digits may vary by platform.
	The result files may change their timing fields when rerun.

	Recorded coverage includes 197,692 Boolean-function/overlap evaluations;
	all 65,536 four-bit Boolean functions in the exact square obstruction;
	small-alphabet exact rank enumerations; 256 pure and 240 mixed product-word
	comparisons; 128 link-calibration cases; and all 27,720 three-packet choices
	in the eight-coordinate compiler instance.

	These checks are finite synthetic evidence. They are not a substitute for
	the proofs and do not report quantum hardware experiments.

	## Rebuild the PDF

	The PDF uses XeLaTeX with latexmk and the following installed font families:

	- Latin Modern Roman, including bold and italic faces.
	- DejaVu Sans, including bold and italic faces.
	- Latin Modern Math.
	- DejaVu Sans Mono.

	A TeX Live installation with fontspec, unicode-math, TikZ, tcolorbox,
	titlesec, fancyhdr, hyperref, and standard AMS/table packages is required.
	From output/pdf/:

	latexmk -xelatex -interaction=nonstopmode -halt-on-error Nirael_Quantum_Instant_Language.tex

	The supplied PDF is ready to read even without a TeX installation. The source
	uses explicit font face names; adjust the font declarations if an operating
	system installs those fonts under different names.

	## Reading guide

	The PDF's result table and abstract give the scope. RAVEN contains the strongest
	new theorem and its quantitative extension. TACHY develops sparse spectral
	refusal. The hereditary-language section gives the local optimum. LILY turns
	complete certificates into an implementable finite selection objective.

	“Instant” means one nonadaptive measurement round after preparation. Preparation,
	propagation, repeated uses, classical membership, and communication retain their
	ordinary resource costs. Active-mode dimension is not a claim about an equal
	number of physical qubits: D modes require at least ceil(log2 D) qubits in an
	ideal abstract register.

	The Stellar Blade-inspired names and dedication provide the artistic setting.
	Every mathematical claim is governed by its explicit hypotheses and proof.