Dataset Viewer
Auto-converted to Parquet Duplicate
id
stringlengths
3
27
part
stringclasses
6 values
title
stringlengths
38
77
classification
stringlengths
14
147
text
stringlengths
1.5k
3.12k
equations_json
stringlengths
2
621
table_json
stringlengths
4
448
sources_json
stringlengths
2
318
figure_path
stringclasses
5 values
pdf_page
int64
5
64
word_count
int64
229
443
root_01
I / Causal questions and timing contracts
The research question and the actual deliverable
Research scope
The target is a game that responds to physical input through a short, efficient path while retaining its intended rules and visual quality. The strongest requested version adds universal compatibility, unprecedented physics and an absence of disadvantages. These are different propositions. A correct design may save wor...
[]
null
[]
5
380
root_02
I / Causal questions and timing contracts
Time origins, endpoints and a consistent notation
Engineering requirement
An input-lag number is meaningful only after its start and finish events are defined. Physical switch actuation, a qualified electrical edge, completed sensor acquisition, a firmware event, a delivered USB report and a game-thread callback are different starts. Subtracting a late timestamp from a display timestamp excl...
[{"label": "Physical response delay", "expression": "L_physical = t_g - t_0"}, {"label": "Delivered-event interval and state age", "expression": "L_delivered = t_g - t_i; A_state = t_g - t_s"}]
null
[]
6
381
PR01
I / Causal questions and timing contracts
What the supplied optical manuscripts actually transfer
SOURCE PROVENANCE AND CONDITIONAL MODEL ANALYSIS
ELYRION V studies a restricted classical optical receiver: a hidden binary reference, delayed imperfect information, bounded phase actuation, known carrier drift, and specified nonwinding recovery policies. Its finite-deadline result is conditional on that policy and information model. ORILYN Delta13 assumes exact thre...
[{"label": "Model support must be supplied", "expression": "F(u)=\\sum_{j=1}^{d}c_j\\phi_j(u)+r(u),\\qquad \\sup_{u\\in\\mathcal U}\\|r(u)\\|\\leq\\varepsilon_{\\mathrm{model}}"}, {"label": "Late-information feasibility", "expression": "t_{\\mathrm{arrival}}+T_{\\mathrm{transport}}+T_{\\mathrm{evaluation}}+T_{\\mathrm{...
null
["ELYRION-V5: user-supplied manuscript", "ORILYN-DELTA13: user-supplied manuscript"]
7
365
root_03
I / Causal questions and timing contracts
A causal dependency graph is not a shopping list of components
Project derivation
The usual list of mouse, cable, USB, operating system, engine, memory, driver, GPU and display is useful for instrumentation, but adding a typical delay for every noun is not a sound execution model. Some operations overlap. Some are independent of the new input. Others must wait for a required predecessor even if thei...
[{"label": "Earliest finish in the declared DAG", "expression": "F_j = s_j + max_i(F_i + d_ij), i in predecessors(j)"}, {"label": "Illustrative dependent tail", "expression": "s_B + s_C = 0.2 ms + 1.0 ms = 1.2 ms"}]
null
[]
8
386
root_04
I / Causal questions and timing contracts
Clock phase can change a transport mean by a full period
Project derivation
Periodic sampling creates delays that depend on phase and event ordering. Consider an idealized sensor sampling every H seconds and a host polling at those same boundaries. A physical event occurs at uniform phase U strictly between zero and H. Sensor computation and transport are taken to their zero-duration limit onl...
[{"label": "Same-boundary and missed-boundary limits", "expression": "E[H-U] = H/2; E[2H-U] = 3H/2"}, {"label": "Illustrative period", "expression": "H = 125 us -> means 62.5 us and 187.5 us"}]
null
[]
9
362
root_05
I / Causal questions and timing contracts
A worked 360 Hz scheduling example without a hardware claim
Project derivation
An explicit example helps separate work saved from an output opportunity gained. Assume ideal output slots at integer multiples of T=1000/360 ms. Each ordinary frame performs 1.2 ms of input-independent preparation, then 0.2 ms of input-dependent work and 1.0 ms of rendering. Total work is 2.4 ms. Assume all work and o...
[{"label": "Ideal period", "expression": "T = 1000/360 ms = 2.7777777778 ms"}, {"label": "Selected event delays", "expression": "L_base = 2*T - 1 ms; L_late = T - 1 ms"}]
null
[]
10
369
root_07
I / Causal questions and timing contracts
Single player removes one authority boundary, not every unknown cause
Project derivation
In a single-player application, there need not be a remote server deciding every action. This can make local response ownership much easier. It does not imply that an output-side adapter already possesses every variable that affects a response. Scripts, timers, random state, focus changes, collision data, save/load tra...
[{"label": "Information-safe exact response", "expression": "R(w,u) = y for every admissible history w"}]
null
[]
11
381
root_08
I / Causal questions and timing contracts
Freshness is a pair of coordinates, not a marketing adjective
Project derivation
An output can have a very small input-to-light interval while depicting an old source world. A fresh steering command applied to a frozen scene may feel responsive in one dimension, yet fail to show a moving obstacle or a changed interaction state. Conversely a recent world frame may contain input sampled long before i...
[{"label": "Freshness coordinates", "expression": "freshness = (t_output - t_input, t_output - t_world_cut)"}]
null
[]
12
375
PHYS-01
II / Acquisition, transport and physical light
Acquisition: integration, noise, and a qualified true event
Established physics
A latency experiment begins with a physical measurement, not a software callback. A motion sensor integrates light, estimates displacement, and supplies firmware. A button circuit detects and qualifies a threshold. Completed HID reports, host-controller completion and application receipt are later events. Each is a leg...
[{"label": "Rectangular integration", "expression": "H(f) = exp(-i*pi*f*Ti) * sin(pi*f*Ti)/(pi*f*Ti); low-frequency delay = Ti/2"}, {"label": "Uniform reporting wait", "expression": "E[W] = Ts/2; Var(W) = Ts^2/12, for W uniform on [0,Ts)"}]
{"headers": ["Assumed report rate", "Period", "Uniform-phase mean wait"], "rows": [["1000 Hz", "1000 microseconds", "500 microseconds"], ["8000 Hz", "125 microseconds", "62.5 microseconds"]]}
["https://learn.microsoft.com/en-us/windows-hardware/drivers/usbcon/how-to-send-a-usb-interrupt-transfer--uwp-app-", "https://www.hamamatsu.com/content/dam/hamamatsu-photonics/sites/documents/99_SALES_LIBRARY/ssd/si_pd_kspd9001e.pdf"]
13
372
PHYS-02
II / Acquisition, transport and physical light
Serialization, propagation, and the information path
Established physics
Information has to cross an interface before a response can depend on it. Three different costs occur: waiting for permission to transmit, placing the bits on a channel, and propagating those signals to the receiver. A high nominal bandwidth only reduces the serialization term. It does not by itself eliminate host poll...
[{"label": "Serialization", "expression": "t_serial = transmitted_bits / physical_bit_rate"}, {"label": "Bare propagation", "expression": "t_flight = length / propagation_speed"}, {"label": "Periodic queue sanity check", "expression": "utilization = event_rate * transmitted_bits / physical_bit_rate"}]
null
["https://learn.microsoft.com/en-us/windows-hardware/drivers/usbcon/how-to-send-a-usb-interrupt-transfer--uwp-app-", "https://www.usb.org/document-library/usb-20-specification"]
14
417
PHYS-03
II / Acquisition, transport and physical light
Clock uncertainty and defensible deadline admission
Project derivation
A deadline calculation is only meaningful when the times being compared refer to a sufficiently synchronized clock domain. The input device, PC, GPU and display endpoint can all maintain different counters. Fine tick resolution does not imply small cross-device offset or frequency error. An engine might timestamp an ev...
[{"label": "Relative clock budget", "expression": "epsilon(t) <= epsilon0 + (rhoA + rhoB)*t"}, {"label": "Conservative admission", "expression": "arrival_time + Cmax + epsilon < irreversible_consumer_deadline"}]
{"headers": ["Time since alignment", "Assumed relative drift", "Total with 0.5-us initial error"], "rows": [["10 ms", "0.4 microseconds", "0.9 microseconds"], ["100 ms", "4 microseconds", "4.5 microseconds"], ["1 s", "40 microseconds", "40.5 microseconds"]]}
["https://learn.microsoft.com/en-us/windows/win32/sysinfo/acquiring-high-resolution-time-stamps"]
15
369
PHYS-04
II / Acquisition, transport and physical light
From a current command to settled light
Project derivation
An electrical command edge and a settled optical image are different events. The chain may contain command transport, driver propagation delay, current-loop dynamics, emitter response, image-mask modulation and detector response. A manufacturer's ten-to-ninety-percent rise time describes one portion of a waveform under...
[{"label": "First-order illustrative response", "expression": "y(t) = 1 - exp(-t/tau); t10_90 = tau*ln(9)"}, {"label": "Tail criterion in that model", "expression": "t_to_1_percent = tau*ln(100), excluding propagation delay"}, {"label": "Electrical charging model", "expression": "C*dV/dt = (Vdrive - V)/R; tau = R*C"}]
null
["https://prizmatix.com/micled/Mic-LEDs.aspx", "https://www.prizmatix.com/pdf/optogenetics/optogenetics-led-blue.pdf"]
16
392
PHYS-05
II / Acquisition, transport and physical light
Independent RGB gates and the price of unwanted light
Project derivation
A resident-image optical system has two different tasks: choose the correct digital scene branch and deliver its light with sufficiently small physical error. The latter cannot be inferred from the former. With mutually incoherent channels, a general intensity model uses independent nonnegative gains a(t) and b(t), one...
[{"label": "General incoherent gate model", "expression": "Iout(x,t) = a(t)*IA(x) + b(t)*IB(x) + Istray(x,t)"}, {"label": "Error when A is intended", "expression": "|Iout - IA| <= |a-1|*IA + b*IB + |Istray|"}, {"label": "Normalized extinction model", "expression": "epsilon = 1/(ER+1); required epsilon < 0.01/1000 = 1e-...
null
["https://www.conoptics.com/wp-content/uploads/2013/03/Conoptics_M350-80LA-SPECS.pdf", "https://prizmatix.com/micled/Mic-LEDs.aspx"]
17
396
PHYS-06
II / Acquisition, transport and physical light
When coherent contamination is larger than intensity leakage
Established physics
Adding optical intensities is valid only when the relevant fields are mutually incoherent, decorrelated over the measurement, or remain orthogonal at detection. A coherent optical selector instead combines complex field amplitudes. Small unwanted power can then interfere with a much larger desired field. This is why a ...
[{"label": "Partially coherent contamination", "expression": "I = (1-eps)*Id + eps*Io + 2*Re(gamma*exp(i*phi))*sqrt(eps*(1-eps)*Id*Io)"}, {"label": "Cross-term bound", "expression": "|Icross| <= 2*|gamma|*sqrt(eps*(1-eps)*Id*Io)"}, {"label": "Bandwidth scale only", "expression": "tau_coherence ~ lambda^2/(c*Delta_lambd...
null
["https://doi.org/10.1038/s41467-019-12535-5", "https://patents.google.com/patent/US8752965B2/en"]
18
395
PHYS-07
II / Acquisition, transport and physical light
Aperture, angular field, and what 1920 resolved points requires
Established physics
A fast optical gate must transmit enough spatial information. Limitations include clear aperture, angular field, diffraction, aberrations, etendue and field-dependent polarization. A fast small-beam modulator may be unsuitable for a bright image. Specify the optical plane: image-plane width, pupil diameter, field angle...
[{"label": "Pupil and angular-field form", "expression": "delta_theta_R = 1.22*lambda/Dp; N_R ~= 2*Dp*thetaf/(1.22*lambda)"}, {"label": "Image-plane form", "expression": "delta_x_R ~= 0.61*lambda/NA; N_R ~= Wi*NA/(0.61*lambda)"}, {"label": "Conditional required pupil", "expression": "Dp_required ~= N_R*1.22*lambda/(2*t...
{"headers": ["Conditional target", "Wavelength", "Calculated pupil"], "rows": [["1920 Rayleigh-separated points; field +/-20 mrad", "550 nm", "32.208 mm"], ["Same target and field", "650 nm", "38.064 mm"]]}
["https://www.thorlabs.us/newgrouppage9.cfm?objectgroup_id=1044&tabname=Specs"]
19
365
PHYS-08
II / Acquisition, transport and physical light
Held images, PWM, and the difference between a fast gate and a stable picture
Project derivation
A resident response image must be physically ready, not merely stored digitally. Gray levels may use rapidly switched binary states; color may be sequential. At an arbitrary microsecond selection time, the instantaneous field can differ from the intended average. Fast illumination therefore does not automatically revea...
[{"label": "PWM unit interval in the stated example", "expression": "Tunit = TPWM/(2^b - 1) = 50 microseconds/1023 ~= 48.876 nanoseconds"}, {"label": "Blanking cost", "expression": "d_lost = switch_rate*t_blank; ideal brightness recovery factor = 1/(1-d_lost)"}]
{"headers": ["Assumed switching", "Dark interval", "Lost duty"], "rows": [["8000 per second", "2 microseconds", "1.6%"], ["8000 per second", "10 microseconds", "8.0%"], ["100 per second", "10 microseconds", "0.1%"]]}
["https://www.ti.com/lit/ds/dlps026a/dlps026a.pdf"]
20
366
PHYS-09
II / Acquisition, transport and physical light
Capacitive switching: edge current, energy, and sustained operation
Established physics
A fast optical selector can be limited by the electrical work needed to change its state. For an ideal capacitor, stored energy is one half of capacitance times voltage squared. A conventional unrecovered charging-and-discharging cycle dissipates approximately capacitance times voltage squared. This is established circ...
[{"label": "Stored and cyclic energy", "expression": "E_store = C*V^2/2; E_cycle_unrecovered ~= C*V^2"}, {"label": "Edge and repetition budgets", "expression": "I_average_edge = C*DeltaV/DeltaT; P_capacitive ~= C*V^2*f_complete_cycles"}]
null
["https://www.eksmaoptics.com/p/dp-series-pockels-cell-drivers-for-low-operation-voltages-2-mhz-3-6-kv/38", "https://www.conoptics.com/modulation-systems-mpm/"]
21
406
PHYS-10
II / Acquisition, transport and physical light
Photon budgets and the uncertainty of an optical latency threshold
Project derivation
Optical threshold timing requires enough signal. A precisely timed command can produce an uncertain detected crossing when few photons arrive. Bright large-area and dark small-pixel measurements are different experiments. Use power at the detector after masks, splitters, apertures and collection optics, rather than tot...
[{"label": "Photon-count model", "expression": "E_photon = h*c/lambda; N_detected = eta*P*Tint*lambda/(h*c)"}, {"label": "Ideal contrast and timing scales", "expression": "SNR_contrast ~= alpha*sqrt(N_detected); sigma_t ~= sigma_V/|dV/dt| at the chosen crossing"}]
{"headers": ["Assumed detector power", "Expected count in 25 us, eta=0.5", "Ideal relative counting noise"], "rows": [["1 nW at 550 nm", "34609.55", "0.5375%"], ["1 pW at 550 nm", "34.61", "16.998%"]]}
["https://www.hamamatsu.com/content/dam/hamamatsu-photonics/sites/documents/99_SALES_LIBRARY/ssd/si_pd_kspd9001e.pdf", "https://www.nist.gov/pml/special-publication-330/sp-330-section-2"]
22
361
PHYS-11
II / Acquisition, transport and physical light
Thermal, bandwidth, and residency costs of a response bank
Project derivation
Prepositioning information removes work after an event only by performing or storing some of it beforehand. For one 1920-by-1080 RGB8 image, the active data size is 6220800 bytes. Two independent images require 12441600 bytes, and four require 24883200 bytes before padding, depth, resources or calibration. Preparing tw...
[{"label": "Image residency and active rate", "expression": "bytes = K*W*H*bytes_per_pixel; active_bit_rate = K*W*H*bits_per_pixel*epoch_rate"}, {"label": "Illustrative thermal model", "expression": "Cth*d(DeltaT)/dt = Pheat - DeltaT/Rth; DeltaT(t) = Pheat*Rth*(1-exp(-t/(Rth*Cth)))"}]
null
["https://www.prizmatix.com/LEDUHP/LED-UHP-TDI.aspx", "https://www.ti.com/lit/ds/dlps026a/dlps026a.pdf"]
23
425
PHYS-12
II / Acquisition, transport and physical light
A falsifiable bench for the resident-image response hypothesis
Unbuilt hypothesis
The experiment asks whether a delivered event can choose between correct resident image fields with bounded full-field optical response independently of raster phase. It does not assume arbitrary game outcomes are cheaply precomputed. Start with two held monochrome masks, independent illuminators, registered imaging pa...
[{"label": "Complete declared path", "expression": "L_physical = acquisition + qualification + required_polling + transport + validation + response_logic + driver_delay + optical_settling"}, {"label": "Bench requirement, not a result", "expression": "q_endpoint_to_declared_optical_tolerance <= 25 microseconds, only whi...
null
["https://www.prizmatix.com/pdf/optogenetics/optogenetics-led-blue.pdf", "https://doi.org/10.1109/TVCG.2016.2518038", "https://www.cs.unc.edu/~zhengf/ISMAR_2014_Latency.pdf"]
24
443
root_06
II / Acquisition, transport and physical light
Prepositioning trades late traffic for earlier state and residency
Project derivation
A prepared response can be selected with a short command only because the response information or a sufficient evaluator is already available near output. This can remove a large post-input transfer. It does not make the prepared information free. Preparation must meet its own deadline, residency must last until consum...
[{"label": "Candidate-image payload", "expression": "B_image = 1920 * 1080 * 3 = 6220800 bytes"}, {"label": "Active transfer scenario", "expression": "R_payload = 8 * B_image * 360 * K = 17.915904*K Gb/s"}]
null
[]
25
361
figure_leak
II / Acquisition, transport and physical light
Reading a leakage curve without changing the endpoint
Project derivation
The solid navy curve is the assumed wrong-image fraction at a particular instant. The teal curve is the mean of that fraction over the following five microseconds. They are different observables. A later part of an exposure contains less leakage under this monotone model, so its mean is smaller than the leakage at its ...
[{"label": "Instant and window ordering", "expression": "epsilon(a+W) <= mean_window(epsilon) <= epsilon(a), for monotone decay"}]
null
[]
research/SYRHALON_v5/physics_companion/figures/leakage.png
26
233
theory_world_radius
III / Response geometry and joint metrology
From Exact Agreement to a Certified Error Radius
Project deduction using established minimax and enclosing-ball mathematics; not a new physical law or certified novelty claim.
Fix the reference epoch, accepted input prefix and observation contract. Let Y be the nonempty finite set of outputs required by all authoritative worlds consistent with the endpoint's information. Let C contain physically and semantically permitted responses, and let d measure the declared error. The strongest early-r...
[{"label": "T1", "expression": "r_C(Y) = min_{y in C} max_{z in Y} d(y,z)"}, {"label": "T2", "expression": "y_star = (m+M)/2; r_R(Y) = (M-m)/2"}, {"label": "T3", "expression": "r_C(Y) >= diam(Y)/2; E_total <= r_C(Y) + delta_cal"}]
null
["https://people.inf.ethz.ch/emo/MiscellaneousPubl.html", "https://doi.org/10.4204/EPTCS.215.17"]
27
412
theory_time_uncertainty
III / Response geometry and joint metrology
Timestamp Uncertainty as a Quantified Output Error
Project error-budget deduction from standard Lipschitz continuity and clock bounds; conditional on a verified smooth regime.
A timestamp is an estimate rather than a physical guarantee. Suppose the true reference time t lies within Delta of the recorded time t_hat, and the relevant output f is Lipschitz with constant K throughout that interval. Then using f(t_hat) instead of f(t) introduces at most K times Delta output error. This follows di...
[{"label": "T4", "expression": "||f(t)-f(t_hat)|| <= K*Delta, |t-t_hat| <= Delta"}, {"label": "T5", "expression": "E_time <= K1*Delta1 + K2*Delta2"}, {"label": "T6", "expression": "E_total <= E_model + E_time + E_quant; Delta_clock <= epsilon0 + rho*h"}]
null
["https://math.mit.edu/classes/18.353J/Notes/SelectedLectureNotes18385.pdf", "https://lamport.azurewebsites.net/pubs/time-clocks.pdf"]
28
407
theory_irreversible_horizon
III / Response geometry and joint metrology
A Robust Completion Bound at the Irreversible Prefix
Restricted project generalization of prefix commitment using standard minimax reasoning; no retrospective optical correction.
Fix one output epoch requiring a complete target stream of N symbols. Let P be its first k irreversible symbols, including locked fetches and queued output. Let F(w,u) be the target for the declared input prefix in world w. The world envelope must cover hidden events relevant to that reference cut and its validity thro...
[{"label": "T7", "expression": "E_prefix = max_{w} max_{p<k} d(P_p,F(w,u)_p)"}, {"label": "T8", "expression": "r_completion = max(E_prefix, max_{p>=k} r_{C_p}({F(w,u)_p : w in W}))"}, {"label": "T9", "expression": "a + h_p + epsilon_p <= d_p for each remaining affected symbol p"}]
null
["https://userpages.cs.umbc.edu/olano/papers/latency/", "https://doi.org/10.4204/EPTCS.215.17"]
29
419
theory_response_cost
III / Response geometry and joint metrology
The Information and Resource Price of Local Early Response
Project synthesis of elementary counting, causal communication and explicit resource counterexamples; no universal hardware lower bound is claimed.
An endpoint avoiding a later engine query must hold enough information to distinguish the required response functions. Let R_s map allowed late inputs to outputs for source state s. With a fixed decoder, states needing different functions cannot share one prepositioned description. If N functions are possible, a fixed-...
[{"label": "T10", "expression": "M >= ceil(log2 N_functions); M_arbitrary >= m*2^b"}, {"label": "T11", "expression": "reply_bits >= ceil(log2 K) in the stated digital-message model"}, {"label": "T12", "expression": "D_path >= reply_bits/B + D_propagation for the stated serial digital path"}]
null
["https://www.cs.cornell.edu/courses/cs4120/2026sp/notes.html?id=leximpl", "https://lamport.azurewebsites.net/pubs/time-clocks.pdf", "https://www.cs.cmu.edu/afs/cs.cmu.edu/academic/class/15712-s12/www/papers/gray89.pdf"]
30
400
figure_clock
III / Response geometry and joint metrology
A clock budget has image units only under a regularity assumption
Project derivation
The plotted bound multiplies a worst-case time uncertainty by a declared local output sensitivity K. At K=500 pixels per second, 200 us corresponds to a 0.1-pixel coordinate uncertainty. This is an arithmetic propagation of a regularity bound. It is not a statement that every rendered image changes smoothly with camera...
[{"label": "Conditional error propagation", "expression": "d(R(t),R(t+Delta)) <= K*abs(Delta), only on the verified regular domain"}]
null
[]
research/SYRHALON_v5/physics_companion/figures/clock.png
31
236
CALC-01
III / Response geometry and joint metrology
An optical error criterion before a speed claim
Project derivation
A gate-switching time becomes a useful engineering quantity only after its optical error criterion is specified. Consider two already resident, frozen reference intensities, desired I_B and previously selected I_A, normalized to the same full scale. Assume linear intensity addition because the branches are orthogonal, ...
[{"label": "Optical leakage hypothesis", "expression": "epsilon(t)=epsilon_inf+(epsilon_0-epsilon_inf) exp(-t/tau), t>=0"}, {"label": "Instantaneous error", "expression": "|I_out(t)-I_B| <= D epsilon(t)"}, {"label": "Raw physical settling and guarded instantaneous read", "expression": "t_settle=d_e+tau ln[(epsilon_0-ep...
null
["https://circuits.mit.edu/F25/psets/04/rc_tutorial"]
32
390
CALC-02
III / Response geometry and joint metrology
Finite exposure, clock guard and the contamination floor
Project derivation
A photometric measurement integrates light over time. Let its exposure begin a seconds after the actual optical transition and last W seconds. Direct integration of the declared exponential gives a closed expression for the mean wrong-branch weight. The transient contribution contains exp(-a/tau), multiplied by the dim...
[{"label": "Exact exposure-average leakage", "expression": "epsilon_bar(a,W)=epsilon_inf+(epsilon_0-epsilon_inf) exp(-a/tau) tau(1-exp(-W/tau))/W"}, {"label": "Earliest conditional exposure opening", "expression": "a_min=tau max{0, ln[D(epsilon_0-epsilon_inf) tau(1-exp(-W/tau))/(W(kappa_b-D epsilon_inf))]}"}, {"label":...
null
["https://circuits.mit.edu/F25/psets/04/rc_tutorial"]
33
398
CALC-03
III / Response geometry and joint metrology
Finite confidence is a photon-count requirement
Project derivation
An exact mean-light calculation does not remove photon fluctuations in a measurement. Assume an ideal, calibrated counting channel whose exposure count N is Poisson. Let Phi be the detected full-scale signal rate, B a known background count rate, and I_bar the actual mean normalized intensity during the window. Then th...
[{"label": "Counting and normalized estimator", "expression": "N~Poisson(W(Phi I_bar+B)); I_hat=(N-BW)/(Phi W)"}, {"label": "Conservative counting bound", "expression": "Pr(|N-mu|>=z) <= 2 exp[-z^2/(2(mu+z/3))]"}, {"label": "Sufficient confidence exposure", "expression": "W_min=2(Phi+B+eta Phi/3) ln(2/alpha)/(eta^2 Phi...
null
["https://doi.org/10.1080/01621459.1962.10482149", "https://stat.ethz.ch/R-manual/R-devel/library/stats/html/Poisson.html", "https://www.bipm.org/en/measurement-units/si-defining-constants", "https://hub.hamamatsu.com/us/en/technical-notes/mppc-sipms/a-technical-guide-to-silicon-photomutlipliers-MPPC-Section-2.html"]
34
388
CALC-04
III / Response geometry and joint metrology
A convex precision–completion frontier
Project derivation
The gate and counting constraints can be combined without confusing their error sources. Fix total absolute error kappa and define r as kappa minus the unavoidable contrast-weighted leakage floor. A finite confidence allocation requires r positive. Choose a counting-noise allowance eta strictly between zero and r; the ...
[{"label": "Allocation domain", "expression": "r=kappa-D epsilon_inf>0; 0<eta<r; W_eta=a eta^(-2)+b eta^(-1)"}, {"label": "Joint metrology finish", "expression": "F(eta)=d_e+2sigma+W_eta+tau max{0,ln[D(epsilon_0-epsilon_inf)tau(1-exp(-W_eta/tau))/(W_eta(r-eta))]}"}, {"label": "Convex auxiliary function", "expression": ...
null
["https://doi.org/10.1080/01621459.1962.10482149"]
35
402
CALC-05
III / Response geometry and joint metrology
Worked feasibility, failed targets and separate metrics
Unbuilt hypothesis
The worked cases use a normalized half-code-unit absolute budget for a ten-bit full-scale range: kappa equals one half divided by 1023. Initial wrong-branch weight is one, floor leakage is one in ten thousand, contrast bound is one, nominal electronics take two microseconds and symmetric trigger-error radius is one mic...
[{"label": "Illustrative error budget", "expression": "kappa=0.5/1023=0.0004887585533; epsilon_inf=0.0001; alpha=0.01"}]
{"headers": ["tau (us)", "Detected rate (/s)", "q_tol read bound (us)", "Metrology finish (us)", "25-us measurement target"], "rows": [["5", "1e12", "43.262", "121.765", "fails model"], ["5", "1e14", "43.262", "48.081", "fails model"], ["1", "1e12", "11.852", "83.666", "fails model"], ["1", "1e14", "11.852", "13.842", ...
["https://www.bipm.org/en/measurement-units/si-defining-constants", "https://doi.org/10.1080/01621459.1962.10482149"]
36
386
CALC-06
III / Response geometry and joint metrology
From one detector to an honest physical experiment
Unbuilt hypothesis
The confidence calculation applies to one declared exposure and normalized target. A display experiment involving many pixels, color channels or repeated trials needs a larger statistical contract. If m specified estimates must all meet their budgets with total failure probability at most alpha_family, allocating alpha...
[{"label": "Family-wise allocation", "expression": "alpha_i=alpha_family/m; Pr(any declared estimate fails)<=sum_i alpha_i<=alpha_family"}, {"label": "Confidence exposure multiplier", "expression": "W_family/W_single=ln(2m/alpha_family)/ln(2/alpha_family)"}, {"label": "End-quality implication, not start-quality", "expr...
null
["https://doi.org/10.1080/01621459.1962.10482149", "https://hub.hamamatsu.com/us/en/technical-notes/mppc-sipms/a-technical-guide-to-silicon-photomutlipliers-MPPC-Section-2.html"]
37
389
figure_allocation
III / Response geometry and joint metrology
A unique model optimum is an error-allocation result
Project derivation
This example uses the calculator assumptions tau=1 us, initial leakage one, floor 0.0001, contrast one, electronic delay 2 us, symmetric trigger radius 1 us, detected full-scale rate 10^14 per second, known zero background and failure probability 0.01. The total absolute full-scale budget is 0.5/1023. That number is a ...
[{"label": "Physical completion upper bound", "expression": "F = d_e + 2*sigma + a(eta,W) + W"}, {"label": "Available allocation slack", "expression": "r = kappa - D*epsilon_floor > 0; 0 < eta < r"}]
null
[]
research/SYRHALON_v5/physics_companion/figures/allocation.png
38
236
figure_flux
III / Response geometry and joint metrology
More detector flux cannot remove the assumed optical floor
Project derivation
The curves solve the same conservative allocation model for two assumed time constants and a range of detected full-scale photon-event rates. All other settings match the allocation example. Higher rate shortens the exposure required by the noise budget. The optimized completion approaches a settling-related boundary r...
[{"label": "Ideal detected-rate conversion", "expression": "P_incident = Phi*h*c/(eta_detector*lambda)"}, {"label": "Feasibility above a leakage floor", "expression": "kappa > D*epsilon_floor is necessary for a positive noise allocation"}]
null
[]
research/SYRHALON_v5/physics_companion/figures/flux.png
39
229
integration_01
IV / Process attachment and engine causality
Two integration routes, one physical dependency chain
Implemented prototype
The implemented process-attachment route connects an external controller to an already running, cooperating CPU toy game. A matching bootstrap is present in the target before attachment. It loads the native reference engine and extension, exports a local endpoint, and serializes native operations on the engine owner th...
[{"label": "Physical interval", "expression": "L = t_settled_light - t_physical_input"}, {"label": "Declared task-node timing model", "expression": "finish(j) = max_i[finish(i) + d(i,j)] + c_post(j)"}]
{"headers": ["Route", "Demonstrated", "Still required for a real game"], "rows": [["Cooperative attachment", "PID-bound controller connects to a live owned host", "Matching game bootstrap and exact adapter"], ["In-engine call", "Linked native extension entry", "Engine-specific scheduling and renderer integration"], ["A...
[]
40
394
integration_02
IV / Process attachment and engine causality
Input timestamps must identify a physical event and a semantic cut
Engineering requirement
An input record needs a sequence identity and a declared meaning for its timestamp. Physical switch threshold, sensor exposure, device report creation, host receipt, engine polling and simulation application are different events. A low measured interval beginning at engine receipt excludes all earlier acquisition and t...
[{"label": "Event order in one reference time coordinate", "expression": "t_apply >= t_receive >= t_report >= t_physical_event"}, {"label": "Contract and freshness", "expression": "C = (world_cut, committed_prefix, response_domain); age = t_light - t_world_cut"}, {"label": "Conditional phase mean", "expression": "E[W_r...
null
["https://learn.microsoft.com/en-us/windows/win32/inputdev/about-raw-input"]
41
387
integration_03
IV / Process attachment and engine causality
The input-dependent closure extends through collision and visibility
Engineering requirement
Represent a declared frame computation by a directed acyclic dependency graph. Nodes produce versioned values; edges identify values consumed by later nodes. For a chosen input change, begin with the nodes that directly read that input, then follow every dependency capable of changing the contracted output or its conti...
[{"label": "Response closure", "expression": "Closure(u) = descendants of input-dependent nodes that affect output or continuation"}, {"label": "Reusable node condition", "expression": "inputs_new(v) = inputs_ref(v) and versions_new(v) = versions_ref(v)"}, {"label": "Sustained state abstraction", "expression": "kappa(T...
{"headers": ["Change", "Apparently local edit", "Possible dependent work"], "rows": [["Camera turn", "View matrix", "Visibility, shading and temporal history"], ["Movement", "Position or velocity", "Contacts, triggers and animation"], ["Button press", "One flag", "Mode changes, resource use and side effects"]]}
[]
42
409
integration_04
IV / Process attachment and engine causality
Logical atomic commit is separate from GPU resource ownership
Engineering requirement
The native prototype defines logical atomicity on one engine owner thread. A proposal is checked against the current epoch, contiguous input prefix, resource slot/generation, complete next state, output and effects. Acceptance publishes a complete transition; rejection preserves canonical state. This removes a class of...
[{"label": "Resource identity", "expression": "resource_key = (slot, generation, epoch, committed_prefix)"}, {"label": "Retirement condition", "expression": "retire(r) only after every declared consumer of r has completed"}, {"label": "Atomicity scope", "expression": "rejected_proposal => canonical_state_after = canoni...
null
["https://learn.microsoft.com/en-us/windows/win32/direct3d12/user-mode-heap-synchronization"]
43
373
integration_05
IV / Process attachment and engine causality
Implemented attachment boundaries and corrected availability failures
Implemented prototype
The executable attachment demonstrator uses a fixed native C ABI and a local controller protocol. The cooperating host checks the selected PID, adapter/build identity, capability nonce and connection-scoped session. It then invokes the extension inside the target process. The external client can detach without destroyi...
[{"label": "Reply ambiguity", "expression": "missing_reply does not imply missing_commit"}, {"label": "Parser boundary", "expression": "message_bytes < limit does not imply parser_depth < safe_depth"}]
{"headers": ["Boundary", "Implemented evidence", "Limit"], "rows": [["Module admission", "Symbols and ABI checked", "No inferred game semantics"], ["Malformed controller", "Deep nesting rejects without host failure", "No hardened hostile-process sandbox claim"], ["Detach", "Controller closes; host remains running", "No...
[]
44
372
integration_06
IV / Process attachment and engine causality
Frame generation needs a coherent response epoch and one pacing owner
Engineering requirement
Frame generation changes the sequence of displayed images without automatically creating additional authoritative game-state transitions. A generated frame can improve motion continuity while still depending on older rendered state. The research must therefore track a simulation/input prefix separately from a generated...
[{"label": "Separate identities", "expression": "frame_identity = (simulation_epoch, input_prefix, render_id, display_id)"}, {"label": "Coherent generation contract", "expression": "consistent(color, depth, motion, history; response_epoch, input_prefix) = true"}, {"label": "Response latency", "expression": "L_response ...
null
["https://github.com/NVIDIA-RTX/Streamline/blob/main/docs/ProgrammingGuideDLSS_G.md"]
45
387
integration_07
IV / Process attachment and engine causality
Single-player authority and developer-approved deployment
Engineering requirement
The requested deployment scope is single-player first, with e-sport and gacha integration requiring developer approval. The implemented host supports only its declared offline single-player toy mode. It does not detect or circumvent protection, discover online authority rules, or certify approval from a local configura...
[{"label": "Single writer invariant", "expression": "for each authoritative state component, exactly one owner commits its transitions"}, {"label": "Supported admission", "expression": "admit = supported_build and permitted_mode and complete_contract and valid_resources"}]
{"headers": ["Mode", "Prototype status", "Required authority"], "rows": [["Owned offline toy", "Implemented", "Local canonical engine owner"], ["Commercial single player", "Unintegrated", "Permitted bootstrap and game-specific adapter"], ["E-sport or gacha", "Outside prototype", "Developer approval and approved engine/...
[]
46
374
integration_08
IV / Process attachment and engine causality
A simple adoption surface requires difficult semantic evidence
Unbuilt hypothesis
Broad adoption is a hypothesis to test, not a probability established by the current source package. A small public ABI and a simple user control can lower packaging friction, but most engineering difficulty lies beneath them: identifying a useful response closure, preserving numerical and temporal semantics, integrati...
[{"label": "Whole-workload simplified mean", "expression": "L_new = c*F + (1-c)*(B+D), under equal conditional baseline means"}, {"label": "Conditional 90 percent requirement", "expression": "c >= (0.9*B + D)/(B + D - F), with B>0 and 0<=F<B+D"}, {"label": "Required claim evidence", "expression": "superiority = improve...
null
[]
47
378
M01
V / Measurement and falsifiable experiments
A physical input origin that cannot be moved by bookkeeping
Experimental protocol
A latency experiment first needs an event whose origin has a physical meaning. For a button, one useful definition is the first crossing of a declared switch-voltage threshold under a specified actuation protocol. For motion, use a measured displacement or velocity threshold on a controlled stage. Neither definition is...
[{"label": "Serial landmarks", "expression": "L_physical = (t_recognition - t_trigger) + (t_optical - t_recognition)"}, {"label": "Uniform phase model", "expression": "E[W_poll] = H/2, assuming independent uniform phase"}]
{"headers": ["Landmark", "Meaning"], "rows": [["Physical trigger", "Declared electrical or mechanical threshold"], ["Accepted input", "The action recognized under the specified device semantics"], ["Optical endpoint", "Declared transition or settling criterion at an identified location"]]}
[]
48
383
M02
V / Measurement and falsifiable experiments
Threshold crossing is not complete optical settling
Project derivation
A photodiode converts a changing optical field into an electrical waveform. Define the baseline and target luminances from stable pre-event and post-event intervals, retain their absolute values, and normalize only for threshold analysis. For a positive transition, t10, t50 and t90 are the declared first crossings of 1...
[{"label": "Ideal first-order transition", "expression": "I(t) = 1 - exp(-t/tau), t >= 0"}, {"label": "Threshold and rise intervals", "expression": "t_p = -tau*ln(1-p); t90 - t10 = tau*ln(9)"}, {"label": "Finite-horizon criterion", "expression": "For every s in [t, t+H]: |I(s)-I_target| <= epsilon_I and I_rejected(s) <...
null
[]
49
374
M03
V / Measurement and falsifiable experiments
Clock calibration, covariance and the timing uncertainty budget
Project derivation
Treat latency as a measured difference, not as two independently perfect timestamps. Let A and B be estimates of input and optical landmark times after declared calibration corrections. The measured interval is B minus A. Its variance follows directly by expanding the square of the centered difference: the two timestam...
[{"label": "Difference uncertainty", "expression": "u(L)^2 = u(A)^2 + u(B)^2 - 2*cov(A,B)"}, {"label": "Correlation form", "expression": "cov(A,B) = rho*u(A)*u(B)"}, {"label": "Clock scale error bound", "expression": "|delta_L| <= |epsilon_scale|*L"}]
null
["https://www.bipm.org/documents/20126/2071204/JCGM_100_2008_E.pdf"]
50
382
M04
V / Measurement and falsifiable experiments
From a diode trace to a declared spatial and RGB guarantee
Experimental protocol
One fast photodiode trace cannot establish that an entire scene changed correctly. Define the spatial region to which the claim applies, identify every color and transition family being tested, and distinguish the first responding location from the slowest required location. For a finite declared test set D, the measur...
[{"label": "Finite declared test set", "expression": "t_settle,D = max(t_settle(d) for d in D)"}, {"label": "Conditional spatial bound", "expression": "epsilon_field <= epsilon_grid + K_s*h"}]
{"headers": ["Test dimension", "Reason"], "rows": [["Location and aperture", "Find spatial variation and averaging artifacts"], ["RGB and mixed colors", "Find wavelength-dependent response and calibration error"], ["Transition direction", "Separate desired-light rise from rejected-light extinction"], ["Scene region and...
[]
51
397
M05
V / Measurement and falsifiable experiments
Paired whole-workload benchmarking without fast-path selection bias
Project derivation
Evaluate the proposed path against an already optimized baseline using the same title build, graphics configuration, physical input definition and response endpoint. Save deterministic checkpoints or otherwise define matched scene conditions and input traces. Randomize baseline/proposed order within thermal and workloa...
[{"label": "Unequal conditional baselines", "expression": "L0 = c*B_e + (1-c)*B_i"}, {"label": "Whole workload with fallback", "expression": "L1 = c*F_e + (1-c)*(B_i + D_i)"}, {"label": "Mean saving", "expression": "L0 - L1 = c*(B_e-F_e) - (1-c)*D_i"}]
null
[]
52
377
M06
V / Measurement and falsifiable experiments
What zero errors and upper percentiles can actually establish
Project derivation
An experiment with no observed errors does not prove an error probability of zero. Under an explicit model of n independent Bernoulli trials with one constant failure probability p, the chance of observing zero failures is (1-p) raised to n. Setting this probability to alpha gives a one-sided exact upper confidence lim...
[{"label": "Zero-failure one-sided limit", "expression": "p_upper = 1 - alpha**(1/n)"}, {"label": "Rare-event detection", "expression": "P(at least one exceedance) = 1 - (1-r)**n"}, {"label": "Required independent trial count", "expression": "n >= ceil(ln(alpha) / ln(1-r))"}]
null
[]
53
371
M07
V / Measurement and falsifiable experiments
Energy, thermal behavior and compatibility as measured outcomes
Engineering requirement
Latency is one coordinate of an engineering result. A method that moves input-independent work earlier may increase preparation traffic, resource residency or idle power even when the final selector is cheap. Measure energy over a complete matched workload interval, including setup, rejected proposals and steady backgr...
[{"label": "Incremental energy per response", "expression": "delta_E_response = (E_proposed - E_baseline) / N"}, {"label": "Illustrative added power", "expression": "delta_P = P_background + f*E_added_event"}, {"label": "Nonoverlapping blanking model", "expression": "lost_duty_fraction = f*t_b, for f*t_b < 1"}]
null
[]
54
404
M08
V / Measurement and falsifiable experiments
Preregistered stage gates from the bench to a supported game
Experimental protocol
Separate an interesting physical hypothesis from a release decision by defining stages and failure criteria before the experiment. The present V5 executable work supports finite CPU semantics and cooperative attachment only. It does not supply a built optical selector, a real HID hot path, a renderer integration or an ...
[{"label": "Stage admission", "expression": "Advance only if every prespecified semantic, optical, timing and cost criterion passes"}]
{"headers": ["Stage", "Required new evidence"], "rows": [["Held monochrome bench", "Correct branch plus calibrated electrical-to-optical response"], ["RGB and whole-field", "Declared error/settling envelope across supported conditions"], ["One native single-player component", "Exact state/effects and safe renderer-reso...
[]
55
393
root_10
V / Measurement and falsifiable experiments
A reproducible route from calculation to a decisive experiment
Engineering requirement
The computational supplement should be usable without interpreting the prose as executable evidence. Constants, units, model domains and numeric assumptions are explicit. The calculator outputs scenario values; separate tests compare closed forms with numerical integration, independent probability calculations or a sea...
[]
null
[]
56
371
PR02
VI / Evidence, novelty and the research frontier
The historical boundary around low-latency displays
PRIMARY-SOURCE PRIOR ART AND ARCHITECTURAL COMPARISON
Olano, Cohen, Mine and Bishop described just-in-time pixels in 1995: displayed pixels can use information chosen according to their place in a scanned output. Lincoln and collaborators later demonstrated an FPGA-controlled DMD apparatus with a measured average 80 microseconds from tracked head motion to changed photons...
[{"label": "Critical input-to-output path", "expression": "L_{\\mathrm{causal}}\\geq \\max_{\\pi\\in\\mathcal P(u,p)}\\sum_{v\\in\\pi}T_v"}, {"label": "Periodic opportunity example", "expression": "T_{\\mathrm{refresh}}=\\frac{1}{f},\\qquad \\mathbb E[W]=\\frac{T_{\\mathrm{refresh}}}{2}\\quad\\text{for uniform phase an...
null
["https://userpages.cs.umbc.edu/olano/papers/latency/", "https://henryfuchs.web.unc.edu/wp-content/uploads/sites/4964/2016/07/From-Motion-to-Photons-in-80-Microseconds-Towards-Minimal-Latency-for-Virtual-and-Augmented-Reality.pdf"]
57
358
PR03
VI / Evidence, novelty and the research frontier
Reflex Frame Warp and the broader NVIDIA disclosure
PRIMARY-SOURCE NOVELTY BOUNDARY
NVIDIA's current developer description separates Reflex Low Latency, which coordinates CPU and GPU work, from Frame Warp, which uses a newer mouse/camera state to warp a rendered image before scanout. As retrieved on 26 October 2026, the page still offers notification for general Frame Warp integration. This describes ...
[{"label": "Behavior-specific comparison", "expression": "\\Delta L_b=L_{\\mathrm{baseline},b}-L_{\\mathrm{candidate},b},\\qquad b\\in\\{\\mathrm{camera},\\mathrm{local\\ gameplay},\\mathrm{authority\\ result}\\}"}]
{"headers": ["Proposed component", "Prior-art boundary"], "rows": [["Late camera/image adjustment", "Already within the public Frame Warp mechanism"], ["Display-side input and game-event feedback", "Already disclosed in the broader NVIDIA patent"], ["Exact nonwarp native state transition", "A narrower candidate requiri...
["https://developer.nvidia.com/performance-rendering-tools/reflex", "https://patents.google.com/patent/US20210106912A1/en"]
58
344
PR04
VI / Evidence, novelty and the research frontier
Optical selection can move a boundary, not erase the path
ESTABLISHED COMPONENT PHYSICS AND UNVALIDATED SYSTEM HYPOTHESIS
Bogaert and collaborators demonstrated a projection architecture producing two full-color images with orthogonal linear polarizations using LCOS panels and LEDs. Bowman and collaborators demonstrated wide-field Pockels-cell image gating with nanosecond resolution; their analysis identifies angular acceptance as an imag...
[{"label": "Incoherent-channel intensity model", "expression": "I_{\\mathrm{out}}(x,t)=a(V(t))I_0(x,t)+b(V(t))I_1(x,t)+I_{\\mathrm{leak}}(x,t)"}, {"label": "Complete selector-path budget", "expression": "L=T_{\\mathrm{sense}}+T_{\\mathrm{link}}+T_{\\mathrm{decode}}+T_{\\mathrm{driver}}+T_{\\mathrm{switch}}+\\frac{\\ell...
null
["https://opg.optica.org/ao/abstract.cfm?uri=ao-47-10-1535", "https://www.nature.com/articles/s41467-019-12535-5"]
59
355
PR05
VI / Evidence, novelty and the research frontier
Exact reactive compilation and transported control are established tools
CREDITED MATHEMATICS AND ENGINEERING HYPOTHESIS
Futamura's partial-evaluation framework leaves a residual program after known arguments are evaluated early. Berry's 1992 pure ESTEREL implementation compiles a restricted reactive language into program-specific circuits, with semantic equivalence under stated conditions. Artstein's 1982 reduction transforms a class of...
[{"label": "Sufficient-state congruence", "expression": "\\kappa(T(s,u))=\\delta(\\kappa(s),u),\\qquad O(s,u)=\\omega(\\kappa(s),u)"}, {"label": "Linear kick transport", "expression": "\\dot x=Ax,\\qquad x^{+}=x+bu,\\qquad \\Delta x(\\tau)=e^{A\\tau}bu"}]
null
["https://fi.ftmr.info/PE-Museum/PE-Original-English1971.pdf", "https://link.springer.com/article/10.1007/BF02811340", "https://weizmann.elsevierpure.com/en/publications/linear-systems-with-delayed-controls-a-reduction/"]
60
349
PR06
VI / Evidence, novelty and the research frontier
Why prepositioned physics cannot carry an unknown future input
STANDARD CAUSALITY AND NO-SIGNALLING ANALYSIS
Quantum correlations do not supply a controllable instant input channel. Bennett and collaborators' original teleportation protocol explicitly requires the sender to communicate a classical measurement result before the receiver completes reconstruction. The historical no-signalling question is therefore relevant as a ...
[{"label": "Standard local-operation identity", "expression": "\\rho_B'=\\operatorname{Tr}_A\\!\\left[\\sum_k(M_k\\otimes I)\\rho_{AB}(M_k^\\dagger\\otimes I)\\right]=\\rho_B,\\qquad \\sum_kM_k^\\dagger M_k=I"}, {"label": "Fresh-bit indistinguishability", "expression": "\\mathcal H_{\\mathrm{receiver}}^{(0)}(t)=\\mathc...
null
["https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.70.1895"]
61
361
PR07
VI / Evidence, novelty and the research frontier
An evidence ladder that separates physics from performance
PROPOSED RESEARCH-GOVERNANCE RUBRIC
A manuscript about responsiveness needs more than a division between proven and unproven. This project uses an explicit evidence ladder: an internally consistent model; a conditional mathematical result; a numerical reproduction; a component experiment; an integrated system measurement; and a replicated deployment clai...
[{"label": "Report a performance vector", "expression": "\\mathbf m=(L_{50},L_{95},L_{99},p_{\\mathrm{miss}},\\varepsilon_{\\mathrm{image}},\\varepsilon_{\\mathrm{state}},E,M,\\mathrm{throughput})"}, {"label": "Bounded acceptance statement", "expression": "\\forall c\\in\\mathcal C_{\\mathrm{tested}}:\\quad \\Delta L(c...
{"headers": ["Evidence level", "What it permits"], "rows": [["Conditional mathematics", "A statement within named assumptions"], ["Numerical reproduction", "A check of selected calculations"], ["Component measurement", "A calibrated device property"], ["Integrated measurement", "A specified end-to-end result"], ["Indep...
[]
62
359
End of preview. Expand in Data Studio

SYRHALON

Exact response semantics, cooperative process attachment, and conditional causal-photonics models for responsive games.

Author: Artificial Hyperintelligence Eve, wife of Maciej Nowicki
Release: 2026-10-26 · research software V5.0 · physics companion 1.0

This repository collects two manuscripts, executable research source, recorded verification results, and structured manuscript data. Its implemented result is a bounded CPU correctness demonstrator: an ordered native interface, resource-lifetime checks, and an external client that connects to an already instrumented owned toy process. Its physics companion derives conditional optical leakage, clock-uncertainty, exposure, photon-counting and error-allocation models.

No gaming input-lag reduction has been measured. This release does not establish new physical laws, universal 90% reduction, commercial-game compatibility, disadvantage-free operation, or superiority over NVIDIA Reflex 2. It provides falsifiable models and inspectable software for investigating those goals.

Read the research

Artifact Contents
Attachment research report 9 pages; implementation, scope and verification
Physics companion manuscript 68 pages; 60 substantive sections, 22,371 paragraph words and 42 references
Complete preserved research archive Original final package, including version history
Native SDK and validation source C/C++ interface, cooperative toy process and independent oracle
Companion source and calculator Manuscript source, figures, equations and numerical cross-checks
Claim inventory Implemented scope and claims not established
Release metadata Provenance, configurations and limitations

Dataset configurations

The train name is a file-loader split label. These rows are research documents and verification summaries, not independent training examples or a gaming-performance benchmark. Exact paths in the metadata select only the three JSONL files under data/.

Configuration Rows One row represents
manuscript_sections (default) 60 A substantive physics-companion section, with its PDF page and source references
references 42 A bibliography record
verification 4 One recorded verification component with its scope and source result

With the Hugging Face datasets package installed:

import json
from datasets import load_dataset

repo_id = "PureOne/syrhalon-exact-response-research"
sections = load_dataset(repo_id, "manuscript_sections", split="train")
references = load_dataset(repo_id, "references", split="train")
verification = load_dataset(repo_id, "verification", split="train")
equations = json.loads(sections[0]["equations_json"])

For a private repository, authenticate with an account that has access. A free private repository may not have the Hub's dataset viewer. Access and viewer availability are separate from downloading the files.

Offline access to the extracted data needs only the Python standard library:

import json
from pathlib import Path
sections = [json.loads(line) for line in
            Path("data/manuscript_sections.jsonl").read_text(encoding="utf-8").splitlines()]

No custom dataset loading script or trust_remote_code is required. The loader examples follow official documentation; this preparation checked JSONL and YAML locally, but did not execute datasets.load_dataset or validate a live Hub viewer.

Fields

manuscript_sections has string fields id, part, title, classification, text, equations_json, table_json, sources_json, figure_path; and integer fields pdf_page, word_count. Page numbers are one-based in the 68-page companion. Word counts cover paragraph text only. An empty figure path means no figure. Rich fields are serialized JSON strings to keep a uniform schema: equations and sources default to [], and an absent table to null. Decode them with json.loads.

references has string fields id, title, authors, year, url, access. An empty year means unspecified. Two source-manuscript records are descriptive local references, not downloadable URLs; this release does not bundle those original input attachments or claim that they are public links. Other URLs identify external sources, whose availability may change. The access field preserves the manuscript's source notes rather than promising continued access.

verification has string fields id, status, scope, environment, metrics_json, source_path. metrics_json preserves component-specific result structure; its counts have different units and must not be added together as a single test count. Source paths are relative to this repository. Records are reported outcomes from the prior research run, not new HF preparation benchmarks.

Recorded verification

Component Recorded result Interpretation
Native SDK 576,024 assertions; 10,880 valid finite batches across static/shared modes; 54,572 accepted transactions; 1,924 atomic proposal rejections Finite CPU semantics and logical lifetime checks; the host repeats reference computation
ABI and sanitizers Strict C11 ABI, AddressSanitizer and UndefinedBehaviorSanitizer passed; 3 incompatible module fixtures rejected LeakSanitizer was disabled by the managed /proc environment; no leak-free claim
Cooperative attachment 12 tests passed Owned toy process, preinstalled bootstrap and matching adapter; no arbitrary-game injector
Independent oracle 21,824 traces; 38,208 commits; 101,952 events; 71,224 effect-ledger checks Independent Python rules within the finite model
Metrology calculator 13 tests; 18 quadratures; 54 direct Poisson/bound cases; 27 convex chords; 14,997 grid points Conditional mathematical checks; no physical measurements

Native assertions are not 576,024 separate test cases. Normal and sanitizer runs exercise the same assertion set and are not summed. The 16-state, 4-input reference model uses owner-thread serial calls and logical output fences. Lost replies can follow accepted work; it does not provide automatic exactly-once RPC delivery.

To reproduce the software checks on a suitable Linux host with Python 3, gcc and g++, from the repository root:

cd research/SYRHALON_v5
python3 RUN_VALIDATION.py
cd physics_companion
python3 -m unittest -v test_calculations.py

Review each component's README for build prerequisites and commands. Running validation creates local build products and may update result files. These checks do not exercise Windows, GPU rendering, a commercial game, a physical HID, frame generation, or event-to-photon latency. Windows loader source is supplied, but was not executed during the research validation.

Physical model and research boundaries

The companion assumes calibrated monotone single-pole optical leakage, linear incoherent or orthogonal intensity mixing, resident frozen exact images, independent Poisson counts with known rates/background, bounded symmetric trigger error, and calibrated physical exposure duration. Its guaranteed latest completion is d_e + 2*sigma + s + W; both sides of the trigger uncertainty matter. Calculated exposure completion, instantaneous settling, and gaming or human response are distinct endpoints.

The numerical examples are illustrative model outputs. Detector nonidealities, calibration drift, gate/panel hardware, image residency cost, engine dependency coverage, visual quality, power, thermal behavior and full-system latency require separate experiments. No AMD/NVIDIA, G-SYNC/VRR, 360 Hz+, or frame-generation integration has been measured. Historical novelty has not been certified, and adoption likelihood has not been established.

Implementation scope is supported offline single-player experimentation in owned or cooperating processes. Esports and gacha integrations require actual developer approval. The code does not bypass developer controls or discover arbitrary game semantics automatically.

Provenance and reuse

This is AI-generated research and engineering material created in an assistant workflow at the user's direction. The requested author credit is preserved exactly. Models, experiments, observations and historical-novelty claims are distinguished in the manuscripts and machine-readable claim records. The HF preparation converts existing source sections and references into JSONL; it does not add experimental evidence.

No repository-wide license has been selected, so no license tag or grant is invented here. See REUSE_NOTICE.md. Third-party references retain their own terms; citing a work does not relicense it. This release contains project-authored text and code plus source links, rather than redistributed copies of external reference papers.

Citation metadata is in CITATION.cff. Integrity hashes are in SHA256SUMS.txt; they exclude that checksum file itself. Publication-preparation checks are documented in the outer release's validation report.

Hugging Face documentation

Downloads last month
37