Search NASA⌕ Search

SEARCH · Search NASA

Results for “certified compilation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

3 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

A Verified Optimizer for Quantum Circuits

We present VOQC, the first verified optimizer for quantum circuits, written using the Coq proof assistant. Quantum circuits are expressed as programs in a simple, low-level language called SQIR, a small quantum intermediate representation, which is deeply embedded in Coq. Optimizations and other transformations are expressed as Coq functions, which are proved correct with respect to a semantics of SQIR programs. SQIR programs denote complex-valued matrices, as is standard in quantum computation, but we treat matrices symbolically to reason about programs that use an arbitrary number of quantum bits. SQIR’s careful design and our provided automation make it possible to write and verify a broad range of optimizations in VOQC, including full-circuit transformations from cutting-edge optimizers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

The Essence of Cryptol: A Denotational Cryptol Interpreter in Coq for Foundational Assurances for Quantum Resistant Cryptosystems

Systems of the utmost consequence need a means to establish authenticity of software and data. Cryptosystems implement authentication, but can be vulnerable to cryptographic and implementation attacks. With the threat of quantum cryptographic attacks, “post-quantum” cryptosystems (PQCs) must be henceforth used in these systems. However, the new cryptography needs new ways to, rigorously and machine-checkably, prove systems free of vulnerabilities. We propose a retargetable capability to rapidly instantiate proven correct postquantum cryptosystems through novel proof-carrying synthesis and proof-automation technique, extending those proven successful on existing systems. This capability is crucial to meeting the cryptographic requirements for future high-consequence systems. Since specifications for high consequence cryptography are presently captured in a domain specific language known as Cryptol. While this can enable convenient fully automated reasoning about Cryptol specificaitons and implementations via the Software Analysis Workbench (SAW), Cryptol has expressivity gaps, so that cryptosystems with probabilistic programming features like Falcon cannot be fully expressed in the language. Moreover, SAW’s automation fails for programs and specificaitons with inductive and recursive structure, as in the Sphincs+ PQC. Finally, Cryptol and SAW together represent some 200,000 lines of unverified Haskell, so that the any guarantees about high consequence cryptography are presently contingent on a large, unverified, yet trusted computing base. The first step of the larger project of agile, assured crpytography is therefore to provide a formal, mechanized semantics for Cryptol, so that the specifications expressed by cryptographers in Cryptol can be reasoned about and compiled into performant implementations with a foundational, machine checkable certificate of correctness. This report describes our work on this first step, culminating in the design of a certified denotational interpreter, in Coq, for core Cryptol.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Determining the Solubility Behavior of Kogarkoite in Simulated Nuclear Waste

Kogarkoite (Na 3 FSO 4 ) is a sparingly soluble fluoride–sulfate double salt that has been identified in high level nuclear waste sludge at the Hanford Site and, more recently, in sludge batch compilation samples at the Savannah River Site (SRS). Due to its complex dissolution behavior, which exhibits an inverse dependence on sodium ion activity, the presence of this mineral poses significant challenges to waste retrieval and processing. Incomplete dissolution during sludge washing can lead to the retention of fluoride and sulfate in the high-level waste feed, potentially causing the formation of corrosive, immiscible molten salt layers, known as "glass gall,” in vitrification melters. Current efforts to optimize flowsheet parameters and wash-water volumes are hindered by the absence of a commercially available, certified reference material, which prevents the accurate calibration of analytical methods and the verification of dissolution kinetics. To address this critical gap, this research focuses on the laboratory synthesis of pure Kogarkoite to serve as a standard for comprehensive solubility and washing performance testing. A coupled synthesis and simulant campaign was executed using an evaporative crystallization protocol designed to replicate the dynamic concentration effects observed in tank farm operations. Thirteen simulant matrices were prepared by dissolving systematically varied ratios of sodium fluoride (NaF) and sodium sulfate (Na 2 SO 4 ) in deionized water under three distinct caustic regimes: 0.0 g (control), 4.0 g (~1 M), and 12.0 g (~3 M) sodium hydroxide (NaOH). While thermodynamic equilibrium models suggest that high-caustic environments should favor the stability of the double salt7, results from this evaporative study at 25 0 C revealed a distinct kinetic divergence. Simulants with high hydroxide loading predominantly yielded large, blocky crystals of sodium sulfate decahydrate (Na 2 SO 4 .10H 2 O). Successful synthesis of pure Kogarkoite was achieved exclusively in specific NaOH-free compositional windows, where the precipitate manifested as fine, opaque granular aggregates. Ion chromatography (IC) analysis confirmed phase purity through the simultaneous stoichiometric depletion of both fluoride and sulfate from the supernatant. This successful synthesis establishes a reproducible route to generate bulk Kogarkoite, enabling the subsequent phase of quantitative dissolution testing using inhibited water to optimize sludge-batch assembly.

Sarker, Md Sharif [Florida International Univ. (FI↗