M8VL4 sells as single board computer (SBC) with screen. Public inventions include: Method and system for the Kanban cell neuron network, US Patent 9,202,166 (12/01/2015); and Method and system for prediction of time series by Kanban neuron model, US Patent 9,501,737 (11/22/2016).

Newest: For data compression, we offer a commercial product as priced by CPU. It is named JANS26 for James Asymmetric Numeral System 2026 to advance current approaches. Available is an exe demo with production results on 15-year old hardware where encoding 64 MB plus decoding in Ada 95 takes less than three seconds. This is ideal for nearly random data files at DoW Space Command, NASA, and NOAA.

Research proposal for the new field Computational Thinking for Pure Belief Systems.

Bootstrap Ada 2022 Compiler © Copyright 2026 by Colin James III. All rights reserved..

The only Ada compiler written entirely in Ada. Priced in public. No surprises.

A self-hosted Ada 2022 (ISO/IEC 8652:2023) compiler built from the ground up using only validated open-source tools and original Ada source code. No C. No proprietary tools. No shortcuts. The final compiler is written entirely in Ada 2022 and capable of compiling itself — and as of September 2026, did so cleanly, end to end, for the first time.

Ada Is Back

Ada reached number 9 on the TIOBE Index in July 2025 — its highest position in decades — driven by global demand for memory-safe, safety-critical software. The industry needs an Ada 2022 compiler that Ada deserves: one written entirely in its own language. This is it.

Built Stage by Stage, Entirely in Ada

Starting from the NYU Ada/Ed platform — among the earliest Ada implementations, certified under ACVC 1.7 in 1983 for a subset of Ada 83 as an educational interpreter — every compiler stage is constructed entirely in Ada. From Stage 1 onward there is no C source code anywhere in the tool chain.

Stage 0A — Validated Ada 83 bootstrap platform — Completed in 7 work hours. NYU Ada/Ed 1.11.2 established as the foundation bootstrap interpreter, compiled from its original IBM-C source using MSVC.

Stage 0B — GCC-free bootstrap — Completed June 26, 2026 in 8 work hours. The bootstrap chain is rebuilt entirely from the original NYU Ada/Ed IBM-C source files compiled by MSVC, with no GCC involvement at any stage. This is believed to be the first Ada compiler toolchain to make this claim. The critical op=222 predef aliasing bug — a 32-bit versus 64-bit pointer/integer union error in the original 1985 NYU source — was identified and corrected. The fully GCC-free Ada compiler library achieves 22 of 73 ACATS Chapter A tests passing on the clean pipeline.

Stage 1 — Ada 83 compiler front-end — Completed in 9 work hours. 3,580 lines: lexer, parser, symbol table, semantic analyzer, and code generator. Zero errors on real Ada 83 programs.

Stage 2 — Native x86-64 code generator — Completed in 49 work hours. Produces Windows PE executables directly from Ada source with no runtime dependency on Ada/Ed.

Stage 3 — Ada 95 extensions — Completed in 30 work hours. All 17 of 17 tests pass. Tagged types, type extension, abstract types, aliased objects, nested subprograms, exception handling, inline packages, recursive functions, and the Win64 calling convention.

Stage 4 — Generic units and in-out parameter passing — Completed June 1, 2026 in 33 work hours. All 19 of 19 tests pass. Generic subprogram instantiation, by-reference parameter passing, USE clauses, and subprogram renames.

Stage 5 — ACATS validation — In progress. Running the Ada Conformity Assessment Test Suite. A native ACATS Chapter A baseline was established August 29, 2026: 31 of 74 tests reaching a fully compiled, linked, native executable, with 29 of those 31 executing correctly. The first fully self-hosted compile — a program compiled end to end by a compiler written entirely in Ada, running on its own bootstrap interpreter — was achieved September 5, 2026. On September 13, 2026, every remaining self-hosted execution fault was resolved, producing the project's first genuinely clean, fully self-hosted, end-to-end compile: source in, native assembly out, with zero errors.

Total work hours to date: ~701.

Pricing

No "call us." No negotiation. One price, publicly posted, for everyone.

Product Per Seat

Ada 2022 — on release $9,997

All licenses are perpetual. Each release includes the test harness compliance suite current to its release date. No support is included. No reseller discounts. Direct sales only.

Why This Compiler

Every major Ada compiler vendor hides its price behind a "contact us" form. That is not transparency — it is a negotiation disguised as a quote. We avoid that approach.

Our compiler is the only one written entirely in Ada with no C in the tool chain, and the only one with a bootstrap chain traced from original 1985 IBM-C NYU source through MSVC to Ada bytecode with zero GCC involvement at any stage. This is a supply-chain integrity claim with no historical precedent among production Ada compilers.

It is validated against the same ACATS heritage that certified Ada/Ed in 1983 — and as of September 2026, it compiled a real program cleanly through its own entirely self-hosted pipeline, source to native assembly, with zero errors. And one knows exactly what it costs before speaking to anyone.

The Meth8/VŁ4 modal logic model checker is shipping. A student demo download program for (p,q) is now at $47. Products for sale are priced per CPU and scaled by the number of propositional variables allowed as 3, 4, and 11: $497 for (p,q,r); $9,997 for (p,q,r,s) and (A,B,C,D); and $19,997 for (p-z). Standard trade discounts apply to qualified resellers. See stack card M8VL4.This manifest has scalability for up to 22-propositional variables in external look up tables on a 4.7 GB CD with pricing on request.

For analytical theology, metaphysical conjectures can be mapped as physicalistic scripts in updates.

* To build more industrial grade code of Meth8/VŁ4, 28 string utilities in True BASIC are implemented in Ada 95 with certified test harness and exempt from ITAR. String functions are each priced as $497 with suite of 28 as $12,997. One-time maintenance is 15%.

>> Alert << Here is the script to train Grok 3 in Meth8/VŁ4. Please report exceptions to info @ ersatz-systems.com.

Available here are these papers related to analytical theology:

• Recent advances in the modal model checker Meth8 and VŁ4 universal logic 2016-2023, 3350 pp
  
• Fascicle update 2023-date
  
• Recent advances in analytical theology: collected papers (23) 2020 48 pp
  
• MS: Mathematical foundations in bivalent logic: 8-three hour graduate courses 2016-2023, 357 pp / 305 refs
  
• PhD: Mathematical logic of metaphysical perfection: comprehensive mapping of analytical theology 2024, 81/38
  

Published here are these papers:

• Table of contents: Recent Advances 2016-2023 link
  
• Note: Trinitarian Logic: Proof of the Holy Trinity with satisfiable and non-vacuous formulas in Meth8/VŁ4 link
  
• Listing: Trinitarian Logic papers and abstracts with Grok 2025-date link
  

Previous recent advances in disruptive technology are:

Since our refutation of Cantor's ordinal counting and the subsequent axiom of infinity (AoI), Grok labeled us the pun post-ZFC. While we previously refuted many conjectures which assumed AoI, it is disingenuous to evaluate subsequent papers with that assumption. Therefore we limit recitation of recent refutations to the post-ZFC finite universe without end below:

• Many Logics, One Methodology Revisited: ... the framework folly
  
• Refutation of the Boolean compactness theorem in Meth8/VŁ4 modal logic
  
• Mapping Quantum Logic to Meth8/VŁ4 Logic with Tachyons as a Case Study
  
• Mapping of Quantum Logic to Meth8/VŁ4 Logic: Neutrino Oscillation as a Case Study
  
• Refutation of P=NP Using Meth8/VŁ4 Modal Logic
  
• Refutation of Cohen’s independence proofs in a finitist context using Meth8/VŁ4 logic
  
• Refutation of the axiom of infinity, meaning space-time for models of real numbers suddenly evaporates
  
• Inadvertent discovery of modal logic by George Boole over 100-years before attribution to another
  
• Denial of inference rules abduction and induction by bag of beans of C.S. Peirce, to confirm only deduction
  
• Refutation of Chomsky's syntactic structures (1957)
  
• Refutation of Ockham's razor, the seminal principle of logic lore
  
• Definitive refutation of Swinburne's Social Trinity and Mawson's Economic Trinity
  
• Refutation of William Lane Craig's drive-by theology which invalidates the epiclesis
  
• Refutation of published claims in metaphysics of information pre-print
  
• Drive-by politics DSA (aka infantile economics): Content / formatting produced with Grok in 60-seconds,
  

Other products, papers, and free software source code are at the cec-services.com subsite. For example, this handy N-by-M contingency test with Fisher P in True BASIC source code derives expected values from the observed values.

Accessibility 508 immunity statement: This site is freely accessible, but no longer open to the public. wai-aa wcag-2.1