Quantum Code: a new programming language.

This is the pre-presentation of a new programming language. It is not the specification, it is not a tutorial, and it is not a defense of the design. It is a short note to the audiences that need to know first, and a pointer to where the substantive material is being prepared.

If you arrived here looking for a download, a syntax reference, or example programs, the right place is not this page. Those materials are held for institutional and academic review and will be released through the standard channels.

What the language is

A formal programming language, called Quantum Code, with a complete specification (v1.0, 2026), a reference implementation, and a draft submission to the IETF as an Informational document. It is a language in the strong sense that compiler-theory and programming-language-theory communities use the term, not a domain-specific notation or a toolkit.

It departs from every formal language built since 1956 in one specific way, described below. The departure is structural, not syntactic. It produces consequences that are not available to traditional languages and are not patches over their limitations.

What it claims, in two sentences

In Quantum Code, a program and the fact of its truth are the same object. This collapses the description-versus-described separation that has structured formal systems since Tarski, with downstream consequences for self-reference, type theory, and the practical economics of computation in certain problem classes.

That is the entire claim. The rest of the language follows from it.

What it changes

For programming-language theorists: a constructive existence proof that the descriptive-vs-described gap is not necessary. The gap is a choice of foundational scaffolding, not a law of formal systems. Different foundations produce different languages.

For type-theory and proof-assistant researchers: a fixed-point semantics in which self-reference is convergent rather than paradoxical. Curry-Howard, Martin-Löf intuitionistic type theory, and homotopy type theory remain valid as references; Quantum Code sits adjacent to that lineage, not within it.

For practitioners in search-heavy domains: an order-of-magnitude reduction in compute cost on problems that map naturally to the language's primitives. The class of such problems is broader than the original motivating application and is being characterized in separate work.

For the broader computer-science culture: a reminder that the foundational layer of programming languages, settled by the late 1970s, is not the only foundational layer that could be settled. Other choices remain possible. One of them has now been built.

What the law is

There is one law. It is a recurrence relation, well-known to mathematicians, with a fixed-point attractor at an irrational ratio. The choice to ground a formal language in this recurrence — rather than in axiom-and-inference-rule scaffolding — produces the language's distinctive properties.

The recurrence is published in the specification. It is not classified. What is held privately is the body of derivations and tooling that connect the recurrence to specific application domains. Those are the priority claim, not the law itself.

Why pre-presentation summary

The full specification is being prepared for the venues where formal-language work is reviewed. Publishing the specification in full on this page before the academic venues post it would weaken the priority record by complicating the timestamp.

There is also a second reason. The language has applications. Some of those applications have non-trivial economic implications. The discipline of academic publishing is the wrong discipline for the application material; that material is being handled separately, under appropriate confidentiality, with selected industrial and institutional partners.

When the academic venues post the specification, this page will link to it directly.

How to engage

If you are a programming-language theorist or compiler researcher: sealed access to the v1.0 specification is available for review prior to public posting. The reference implementation can be made available under standard academic-NDA terms. resonance@proton.me with subject line "QC · academic review".

If you are a research lab, university department, or standards body considering programmatic engagement: the same contact, subject line "QC · institutional engagement".

If you are a venture investor, foundation, or strategic partner: same contact, subject line "QC · strategic". Application briefings are available under NDA and are not based on the academic content.

If you are a journalist: please wait for the academic posting before writing. This page is the official public position until then.

What this page is not

This is not a manifesto. The brand-level positioning of the Resonance Network exists separately and is linked from this site.

This is not the specification. The specification is real, written, signed, and currently held for academic submission. Its summary is in a separate document; full text is sealed.

This is not a request for attention. The audiences this is written for already know who they are. If you are one of them, the contact is at the top of this page.

Status

Document:        Pre-presentation summary
Specification:   Held under academic submission
Implementation:  Held under review-access
Target venue:    Academic (IETF / arXiv cs.PL / journal)
Author:          T.Y. · DAF5:A38A
Contact:         resonance@proton.me
Sealed since:    2026-05-11

One-line conclusion

A new formal programming language has been written, its specification is in review, and the audiences who need to know are being contacted directly. This page exists so that anyone else who finds the work knows where to write.

◻ Pre-presentation · T.Y. · DAF5:A38A · 2026 ◻