MFENXLights Out / QQfenx local supercomputer checking scientific evidence

MFENX LIGHTS OUT / PROPRIETARY COMPUTE SYSTEM

A software-defined
local supercomputer.QQfenx inside.

Lights Out combines two execution engines under one local system: QQfenx discovers the smallest exact quotient ring required by each wrapping-i32 tensor tile, while the native C11 scientific engine drives IEEE FP64 provider workloads across CPU workers and process grids. Upstream NPB qualifies the surrounding OpenMP and MPI system with benchmark-native verification.

  • CURRENT PRODUCT RELEASEv0.1.6 · signed · verified
  • PARALLELISMpersistent threads + MPI
  • ARITHMETICexact i32 + IEEE FP64
  • SYSTEM QUALIFICATIONupstream NPB · 16 / 16

QQFENX / ADAPTIVE EXECUTION

The arithmetic domain changes while the program runs

an exact execution path from the full 32-bit machine ring through smaller physical quotients and into the zero ideal
EXECUTION LAW

Each tile carries exact algebraic content

A tile is stored as a normalized payload and its shared power-of-two content exponent:

T = 2s · T̂   (mod 232)

For a contribution A × B, QQfenx derives q = 32 − sA − sB. The payload executes in ℤ/2q while reconstruction preserves the original 32-bit answer exactly.

01ORIGINAL SEMANTICSℤ / 232

Wrapping-i32 remains the result contract.

02CONTENT-DERIVED EXECUTIONQ8 · Q16 · Q24 · Q32

The runtime selects the exact physical kernel class.

03ACTUAL CANCELLATIONRing promotion

New trailing-zero content shrinks the next quotient.

04ZERO IDEALNo payload execution

Proven-zero downstream contributions are annihilated.

EXECUTABLE TWO-STAGE CONFORMANCE RECORD 32 → 8 → 0

physical quotient width, ending in exact annihilation

STAGE ONE8 / 8

logical MACs execute through Q8

CANCELLATION PROMOTION24 → 25

one additional exact content bit is discovered

STAGE TWO0 / 8

Zero payload MACs execute; all eight logical MACs are annihilated

FULL CHAIN8 / 16

payload MACs execute; the exact output is independently accepted

NATIVE KERNEL ENGINE

One adaptive CPU path

Self-contained C11 kernels implement Q8, Q16, Q24, and Q32 arithmetic. Runtime dispatch selects AVX2, SSE4.1, or scalar execution according to the host while preserving identical results.

COMPLETE EXECUTION

Unstructured data stays exact

When no quotient contraction exists, q = 32 and QQfenx runs the full-ring path. Structure changes physical work, never numerical meaning.

REPLAY-GATED ACCEPTANCE

The result is checked from scratch

The standalone full-ring replay verifier re-derives tile content, quotient decisions, operation accounting, authenticated outputs, and the complete wrapping-i32 result before acceptance.

QQFENX / HISTORICAL SIGNED PERFORMANCE RELEASE v0.1.4

Exact arithmetic. Measured acceleration.

source-bound execution on Intel Core i5-2500S / SSE4.1 / commit 01e2c6e
MEASUREMENT PROFILE 384 × 384 × 384

Exact wrapping-u32 arithmetic. Each displayed range spans same-compiler end-to-end medians from 15 retained warm samples per compiler.

ZERO IDEAL / ONE LANE 8.02–8.94×

end-to-end versus same-compiler dense C

logical MACs
56,623,104
executed MACs
0
TWO-STAGE CANCELLATION CASCADE / ONE LANE 2.42–2.53×

end-to-end versus same-compiler dense C

logical MACs
113,246,208
annihilated MACs
56,623,104
PACKED Q8 / ONE LANE 1.25–1.27×

end-to-end versus same-compiler dense C

PACKED Q16 / ONE LANE 1.20–1.24×

end-to-end versus same-compiler dense C

FOUR-LANE SCALING

One exact engine. Four physical lanes.

End-to-end warm scaling versus the matching one-lane QQfenx execution.

Q82.15–2.29×
Q161.97–2.31×
Q322.04–2.38×
CASCADE2.27–2.42×
EXACTNESS / SOURCE CLOSURE

Bit-identical results, bound to the measured code

Every reported result was bit-identical to the independent exact wrapping-u32 oracle. The pinned UCI Iris workload also passed the independent exact oracle.

The signed, unfiltered evidence retains every configured comparator and result for source commit 01e2c6e.

HISTORICAL SIGNED EXECUTION FOUNDATION / RELEASE v0.1.3 v0.1.3 · signed · verified V0.1.3 / VERIFIED

NATIVE SCIENTIFIC COMPUTING

From persistent CPU workers to a 2-D process grid

a cohesive IEEE FP64 execution path for dense, sparse, stencil, streaming, reduction, and distributed scientific workloads
NEXT PRIVATE PRODUCT RELEASE / V0.1.7

Transform, memory geometry, and placement become execution contracts

The forthcoming runtime extends the native scientific path with plan-driven complex transforms, exact live-region routing for strided matrices, and an inventory-bound contract for MPI launch placement. Each feature enters through checked C11 interfaces and the existing persistent execution context.

COMPLEX FP64 FFT

Immutable plans. Allocation-free execution.

Dependency-free C11 plans own canonical bit-reversal and twiddle tables for batched, power-of-two forward and inverse transforms with padded strides and exact in-place operation.

1-D C2C · FORWARD + INVERSE
PERSISTENT MULTICORE

Every transform stage reaches the worker pool

Reordering, butterfly stages, and inverse scaling use the existing bounded workers. Fast execution dispatches across scalar, SSE2, AVX, and AVX2 + FMA implementations.

SIMD DISPATCH · PADDED BATCHES
REPRODUCIBLE EXECUTION

One fixed arithmetic order across the host

The reproducible policy uses a canonical floating-point environment and fixed non-contracting butterfly order across supported backends and lane counts.

BITWISE-STABLE RESULT ORDER
HPL MEMORY ROUTING

Exact live regions preserve the zero-copy path

An allocation-free interval merge distinguishes genuine overlap from adjacent strided submatrices. HPL-shaped disjoint panels enter native DGEMM directly; true overlap retains snapshot-safe packing.

EXACT ALIAS CLASSIFICATION
CLUSTER PLACEMENT CONTRACT V1

The launch geometry is sealed before execution

Node inventories, rank capacity, threads per rank, launcher family, shared-filesystem root, and deterministic hostfile bytes are bound into one checked MPI placement record.

OPEN MPI · MPICH · RANK PARTICIPATION
LIGHTS OUT / FP64 COMPUTE FABRIC

One native engine across local threads and MPI process grids

The Lights Out scientific path begins with self-contained C11 kernels, keeps a persistent multicore worker pool close to the data, and extends the same checked execution contract through CBLAS and MPI. Applications can enter through a checked C ABI or a safe Rust API while the runtime resolves the best supported CPU backend once per context.

  • ARITHMETICIEEE FP64
  • LOCAL PARALLELISMpersistent native threads
  • DISTRIBUTED PARALLELISMMPI process grids
  • CPU DISPATCHAVX2 + FMA / AVX / SSE2 / scalar
01 / LANGUAGE SURFACE

Safe Rust + checked C ABI

Typed slices, immutable FFT-plan ownership, and exclusive Rust contexts meet validated C dimensions, strides, spans, aliases, CSR structure, and lifecycle state.

02 / COMPATIBILITY

CBLAS + HPL

Ten double-precision CBLAS entry points connect unmodified HPL calls to the MFENX FP64 engine. Exact live-region classification keeps disjoint strided panels on zero-copy DGEMM paths.

03 / LOCAL ENGINE

C11 kernels + threads

Persistent workers execute complex FFT, streaming, reduction, dense, sparse, and stencil kernels with bounded operation-time storage.

04 / DISTRIBUTED ENGINE

MPI ranks + native lanes

Each rank drives its local worker pool while checked placement, communicator-wide agreement, partition checks, and collective execution coordinate the full job.

DISTRIBUTED DENSE LINEAR ALGEBRA

2-D block-cyclic, double-buffered SUMMA

Matrices are distributed over an explicit P × Q process grid. Each SUMMA phase broadcasts an A panel across a process row and a B panel down a process column, then sends the owned blocks directly through native multicore DGEMM. Two bounded panel slots prepare the next phase while the current phase computes.

OWNERSHIP
compact row-major block-cyclic storage with exact local-to-global mapping
PIPELINE
nonblocking row and column broadcasts with explicit request lifecycles
GEOMETRY
rectangular grids, odd dimensions, padded strides, and tail blocks
HYBRID EXECUTION
MPI distributes panels; persistent native lanes execute each local FP64 block
SUMMA DATAFLOW A × B → C
P × Q PROCESS GRIDblock-cyclic ownership
A ROW BROADCAST B COLUMN BROADCAST C LOCAL FP64 DGEMM
BUFFER 0 COMPUTE BUFFER 1 NEXT PANELS
DENSE / STREAMING

DGEMM and vector kernels

Cache-blocked FP64 DGEMM joins copy, scale, add, triad, AXPBY, and deterministic dot products with SIMD tails and padded leading dimensions.

CBLAS · HPL · STREAM
SPARSE

Persistent CSR SpMV

An owning CSR plan validates and packs matrix structure once, then reuses it across repeated local and rank-partitioned sparse operations.

HPCG · CSR ITERATIVE SOLVERS
STENCIL

7-point domain updates

Zero-Dirichlet local kernels combine with z-slab ownership and nonblocking halo exchange that overlaps interior computation.

STRUCTURED GRIDS · DOMAIN DECOMPOSITION
COLLECTIVES

Broadcast and reductions

Chunk-safe broadcast, native MPI sum, and ascending-rank reproducible sum provide communication paths for both throughput and stable result order.

OSU · MPI COMMUNICATION
SIGNED SCIENTIFIC EVIDENCE / RELEASE V0.1.6

Provider workloads and upstream system qualification

Every displayed value is bound to a source-locked build, retained raw output, captured topology, extracted metrics, and a rechecked evidence suite.

SOURCE-LOCKED SCIENTIFIC EVIDENCE

Official suites, exact inputs, sealed outputs

Every upstream suite is identified by official version, exact byte length, and SHA-256 before a build begins. Build inputs, executables, raw output, topology metadata, and extracted metrics remain connected in one verifiable record.

OFFICIAL SOURCE SHA-256 + BYTE LENGTH SEALED BUILD RAW BENCHMARK OUTPUT VERIFIED METRICS

Benchmark names identify their source projects and do not imply endorsement. This product includes software developed at the University of Tennessee, Knoxville, Innovative Computing Laboratory. complete benchmark attribution

01 / DEFINITION

What it is

one local compute architecture implemented in software and run by the host CPU and storage
ARCHITECTURE

What “software-defined” means

The combined architecture includes an instruction set, compiler, parallel scheduler, bounded-memory storage path, recovery protocol, and verifier. It coordinates CPU lanes and authenticated local storage under one deterministic execution and verification contract. Together these components make Lights Out a local supercomputer implemented as one cohesive software system.

PHYSICAL WORK

Two operating-system CPU lane tasks

The compiled image binds each output piece to lane piece mod 2. The acceptance harness observed both named lane tasks inside the product process at the same instant while the fresh workload was running.

STORAGE / MEMORY

Large tensors stay in authenticated local storage

Tensor manifests name BLAKE3-addressed chunks. Lanes read bounded, authenticated ranges instead of loading the complete 224 MiB right tensor into managed memory. Resource certificate schema 5 records the bound.

SIGNED EXECUTION FOUNDATION

Exact streamed i32 matrix multiplication

The signed execution foundation records streamed i32 matrix multiplication with wrapping-i32 arithmetic, bounded managed memory, durable receipts, and exact replay as one verified path inside the current system.

02 / SAME WORKLOAD

Accepted cross-release timing

single fresh accepted run per release; values appear only after both selected payloads pass browser checks
Local v2 external wall acceptance harness monotonic process observer
preserved Local v1 external wall same shapes, operation count, lanes, and output root
v1 wall / v2 wall waiting for both releases

This is a same-workload, cross-release, single-run comparison: 276.103268901 s ÷ 5.608764486 s. The displayed ratio is 49.2271104608×, rounded to 10 decimal places. The retained v1 and v2 technical records preserve the measurement method and matching result identities.

accepted phaseLocal v1Local v2v1 / v2
internal end to end
primary execution
durable output finalization
embedded exact replay

In v2, primary arithmetic no longer dominates the accepted internal timing. Durable output commit/finalization and exact replay are the larger remaining phases on this rotating local disk.

03 / RESOURCE MEASUREMENTS

Accepted v2 measurements

loaded only from selected files that match the sealed capture manifest
logical input authenticated durable tensor bytes
data / certified managed peak strictly greater than four times
certified managed peak resource certificate schema 5
overlapping CPU lanes observed / configured by external /proc sampling
observed peak RSS external /proc · swap
GPU paths / network syscalls / recorded product syscall traces

04 / EXECUTION PATH

How it works

independently addressed exact replay checks every output value before acceptance
01 COMPILE ISA 6 validate tensor shapes and emit a digest-bound schema-3 machine image
02 CERTIFY bind two lanes, piece geometry, I/O bounds, and a 42,411,200-byte managed peak
03 READ PANELS stream contiguous authenticated right-tensor panels from local content-addressed storage
04 EXECUTE LANES two deterministic CPU lanes compute disjoint output-row pieces with exact wrapping-i32 arithmetic
05 CHECKPOINT synchronize each piece and content-bound schema-2 receipt before it may be reused
06 REPLAY / PUBLISH parallel verifier lanes derive addresses separately and replay all 352,321,536 integer operations
Browser verification

JavaScript on this page downloads, hashes, and cross-checks the selected release files. Runtime memory, timing, process interruption, lane overlap, and syscall observations come from the retained external harness records.

05 / AUTHENTICATED I/O

Exact recorded counters

observed records equal an independent manifest/range/cache derivation
admission input requested · loads · hits
primary input requested · loads · hits
replay input requested · loads · hits
replay output requested · loads · hits

06 / RECOVERY

SIGKILL and exact resume

the harness killed the process group; valid durable work was retained and only the missing piece ran after restart
  1. 01fresh run executed
  2. 02SIGKILLexit 137 after
  3. 03durable receipt retained
  4. 04resumereused · executed
  5. 05same outputboth standalone replay checks passed
UNINTERRUPTED ROOT = RESUMED ROOT the output root also matches the preserved v1 comparator

07 / ADVERSARIAL INTEGRITY

Invalid publication blocked

five isolated integrity mutations were detected and safely stopped before publication
input chunk
checkpoint piece
checkpoint receipt
machine image
result / I/O counter

08 / BROWSER CHECKS

Selected-artifact integrity

Web Crypto SHA-256 plus structural and cross-file checks for the scientific summary, v2 execution evidence, and preserved v1 comparator
  1. v0.1.6 signed scientific release evidencewaiting
  2. 15 source-locked build records verifiedwaiting
  3. 25 accepted · complete 46-record historywaiting
  4. upstream NPB Class A OpenMP and MPI system qualificationwaiting
  5. HPL residuals and fair-topology HPCG comparisonwaiting
  6. STREAM results and exact OSU collective telemetrywaiting
  7. selected v2 execution evidence and integrity manifestwaiting
  8. preserved v1 comparator evidence and integrity manifestwaiting
  9. same-workload v1/v2 identities checked before timing displaywaiting

The browser hashes the current scientific summary and selected retained execution files, then checks the exact workload, topology, result, and telemetry fields displayed above.

COMMERCIAL OPERATION

Operate a licensed deployment

Linux x86_64 · local CPU and storage · commercial evaluation and deployment access from MFENX
mfenx-local / exact 256 × 256 identity product
chmod +x ./mfenx-local
./mfenx-local matrix-create --store mfenx-store --rows 256 --columns 256 --fill sequence --output left.tensor.json --io-mib 1
./mfenx-local matrix-create --store mfenx-store --rows 256 --columns 256 --fill identity --output right.tensor.json --io-mib 1
./mfenx-local compile --store mfenx-store --left left.tensor.json --right right.tensor.json --output product.image.json --max-managed-mib 64 --lanes 2 --io-mib 1
./mfenx-local run --store mfenx-store --image product.image.json --checkpoint-dir product.checkpoint --output product.result.json --io-mib 1
./mfenx-local verify --store mfenx-store --image product.image.json --result product.result.json --io-mib 1