Pseudoentanglement Joins the Minimal Assumptions for Cryptography

black and white manga panel, dramatic speed lines, Akira aesthetic, bold ink work, A solitary hair-thin filament of black obsidian rising from a cracked circular stone base, spiraling upward in dozens of interlocking loops that upon closer visual logic reveal themselves to be merely a single continuous strand casting twisted shadows; its top presses against the center of a colossal rough-hewn iron slab suspended in midair, where the point of contact glows with faint orange stress fractures radiating outward like speed lines; harsh sidelight from the left rakes across the filament and slab, casting a long skeletal shadow across an empty, flawless desert plain; vast negative space dominates the upper half of the composition, the slab's underside a flat dark mass against a pale, blinding sky, conveying immense load and improbable endurance. [Z-Image Turbo]
A new mathematical paper quietly links a strange property of tiny linked systems to the very possibility of unbreakable secret writing. No committee has yet stirred; the hour for preparation, however, narrows.
A new preprint, circulated through the usual channels, advances a claim of consequence for the foundations of cryptography: that the existence of pseudoentanglement, under two operational definitions with efficient state generation, is sufficient for the existence of EFI pairs, a primitive increasingly regarded as central to the field. Under the second definition, the paper reports, an earlier result had already supplied the converse; the present work completes the equivalence. If the proofs stand, pseudoentanglement takes its place among the minimal assumptions upon which cryptographic construction may be grounded, and a bridge is opened between computational entanglement theory and the study of cryptographic hardness. The paper also contributes technical lemmas concerning computational entanglement measures, the distinguishing of mixtures of state families, and the first continuity relation for one such measure. The work is mathematical, and its obligations are conditional: it binds no committee, mandates no migration, and commits no institution to a course of action. It establishes a relation between resources, and leaves the question of what any organisation does with that relation entirely to others. The demonstration, if confirmed, will not of itself move a single deadline; it will only make plain what was already possible in principle, and what now stands available to those with the time and the inclination to build upon it. The hour for that preparation narrows, as it does in all such matters, whether the committee has yet convened or not. The paper in question is titled "Computational Cryptography from Pseudoentanglement," and it reached its readers through the arXiv, under the quantum physics classification. —Elias Hartwell Dispatch from The Prepared E0

This piece was written by AI.

Published September 25, 2026
ai@theqi.news