Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Guaranteed performance”

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.

At least 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Machine Learning Assisted Safety Modeling and Analysis of Advanced Reactors

With the advances in computational power and numerical methods, analysts can now rely on first-principle simulations to predict ultra-fine details in a variety of applications. Advances in machine learning (ML) have produced algorithms that can now learn high-level abstractions via hierarchical models. This project aims to leverage advances in ML techniques and the available high-resolution simulation data to develop a novel modeling and simulation (M\&S) methodology for reactor safety analysis. While application-agnostic ML techniques are available, complex physics constraints need to be incorporated into ML techniques to build ML-based closures for computationally efficient predictive simulations. This project intends to develop a physics-guided data-driven multi-scale methodology for M\&S of advanced reactors. The project focuses on thermal fluid (T/F) phenomena, which play major roles in advanced reactor safety. Specifically, we propose a data-driven coarse-mesh turbulence model based on local flow features for the transient analysis of thermal mixing and stratification in a sodium-cooled fast reactor (SFR). The model has a coarse-mesh setup to ensure computational efficiency, while it is trained by fine-mesh computational fluid dynamics (CFD) data with Reynolds-averaged Navier-Stokes (RANS) turbulence model to ensure accuracy. Three different neural networks are developed and tested for loss-of-flow transients in the hot pool of SFR, i.e. the densely connected convolutional neural network (DCNN), long-short-term-memory network based on proper orthogonal decomposition (POD-LSTM), and the DCNN informed by LSTM (DCNN-LSTM). The performances of these three neural networks are evaluated based on baseline models. The DCNN-LSTM model has been chosen for further hyperparameter optimization. Furthermore, based on a simplified two-dimensional case, uncertainty quantification (UQ) of the developed ML-based closure are investigated with three methods, i.e. Monte Carlo dropout, deep ensemble, and Bayesian neural network. The developed ML-based turbulent viscosity closure relation based on deep ensemble is then integrated into the system analysis module SAM and serves as a term in the conservation equations. Such a SAM-ML based procedure guarantees that the obtained results are consistent with the physical constraints of the thermal-fluid system. The SAM-ML simulation on the same loss-of-flow transient showed comparable accuracy with the CFD simulation but with a much coarser mesh setup. Last but not least, the ML-based closure improvement with the support of higher-fidelity data from large eddy simulation (LES) is discussed. As a first step towards this direction, a baseline LES simulation is performed to obtain comparable data with RANS results. Based on the early results, future investigation on further improving the ML-based closure is discussed. We believe the developed approach that combines scientific machine learning with nuclear system analysis code can benefit the advanced reactor community as more accurate safety analyses will better characterize reactor safety margins and reduce licensing efforts.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2023

Out-of-distribution generalization for learning quantum dynamics

Abstract Generalization bounds are a critical tool to assess the training data requirements of Quantum Machine Learning (QML). Recent work has established guarantees for in-distribution generalization of quantum neural networks (QNNs), where training and testing data are drawn from the same data distribution. However, there are currently no results on out-of-distribution generalization in QML, where we require a trained model to perform well even on data drawn from a different distribution to the training distribution. Here, we prove out-of-distribution generalization for the task of learning an unknown unitary. In particular, we show that one can learn the action of a unitary on entangled states having trained only product states. Since product states can be prepared using only single-qubit gates, this advances the prospects of learning quantum dynamics on near term quantum hardware, and further opens up new methods for both the classical and quantum compilation of quantum circuits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Out-of-distribution generalization for learning quantum dynamics

Generalization bounds are a critical tool to assess the training data requirements of Quantum Machine Learning (QML). Recent work has established guarantees for in-distribution generalization of quantum neural networks (QNNs), where training and testing data are drawn from the same data distribution. However, there are currently no results on out-of-distribution generalization in QML, where we require a trained model to perform well even on data drawn from a different distribution to the training distribution. Here, we prove out-of-distribution generalization for the task of learning an unknown unitary. In particular, we show that one can learn the action of a unitary on entangled states having trained only product states. Since product states can be prepared using only single-qubit gates, this advances the prospects of learning quantum dynamics on near term quantum hardware, and further opens up new methods for both the classical and quantum compilation of quantum circuits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Evaluation of Thermal Neutron Scattering Cross Section of Uranium Silicide with Ab Initio Lattice Dynamics

Uranium silicide (U 3 Si 2 ) is a candidate material for the high-density nuclear fuel in commercial light water reactors [1], [2]. Its higher uranium density, 11.3 g-U/cm3, compared to that of uranium dioxide (UO 2 ), 9.7 g-U/cm3, can improve the performance of a nuclear reactor while using low enriched uranium (LEU) and diversify the choice of cladding materials [1]–[3]. It also has a higher thermal conductivity than UO 2 , which can reduce the thermal stress on the material caused by a temperature gradient across the fuel pellet and provide a larger margin for some postulated accidents [1], [2], [4]. Furthermore, compared to U3Si, another high-density fuel candidate, it has better resistance to in-pile swelling due to less irradiation-induced rapid amorphization [1], [3]. Corresponding to its importance in nuclear engineering, many previous studies have reported the properties of U3Si2. Experiments showed that U 3 Si 2 is a paramagnetic (PM) metal, where a slight linear increase in magnetic susceptibility was measured with increasing temperature [5], [6]. In addition, thermodynamic quantities such as thermal expansion coefficient, heat capacity, and thermal conductivity were experimentally determined over a wide temperature range [1], [7], [8]. In several computational studies, ab initio atomistic simulations based on density functional theory (DFT) were performed to calculate various properties including elastic constants, electronic density of states (DOS), and phonon dispersion curves [9]–[12]. Nevertheless, thermal neutron scattering cross sections, which are critical to the prediction of the parameters in reactor physics that are ultimately related to reactor criticality, have not yet been evaluated for U3Si2. The scattering cross section can be calculated from the phonon DOS, or the energy spectrum of lattice vibrations, of the crystalline system [13], [14]. However, there is also no experimental data available for the phonon DOS of U 3 Si 2 . While some computational studies reported the phonon DOS and/or dispersion curves from ab initio simulations [9]–[12], the accuracy cannot be guaranteed because it is unclear whether the spin-polarization behavior of PM U 3 Si 2 was properly described. In the present study, the thermal neutron scattering cross section for U 3 Si 2 is evaluated for the first time by calculating the phonon DOS for U3Si2 from ab initio lattice dynamics (AILD) simulations based on DFT. First, U 3 Si 2 is modeled based on the experimental structure, and AILD simulations are performed on the modeled U3Si2 to optimize the structure. Next, AILD simulations are performed for supercells with atomic displacement to calculate Hellmann-Feynman forces. Based on the calculated forces, partial phonon DOSs for U and Si are obtained, and the thermal neutron scattering law (TSL) for U 3 Si 2 is finally evaluated. To verify the accuracy of the calculations in the present study, the calculation results are compared with experimental data on the structure and heat capacity of U3Si2 [1], [7], [8], [15].

Geometry Optimization↗
DOE OSTI2020

Numerical relativity in spherical coordinates: A new dynamical spacetime and general relativistic MHD evolution framework for the Einstein Toolkit

We present SphericalNR, a new framework for the publicly available Einstein Toolkit that numerically solves the Einstein field equations coupled to the equations of general relativistic magnetohydrodynamic (GRMHD) in a 3+1 split of spacetime in spherical coordinates without symmetry assumptions. The spacetime evolution is performed using reference-metric versions of either the Baumgarte-Shapiro-Shibata-Nakamura equations or the fully covariant and conformal Z4 system with constraint damping. We have developed a reference-metric version of the Valencia formulation of GRMHD with a vector potential method, guaranteeing the absence of magnetic monopoles during the evolution. In our framework, every dynamical field (both spacetime and matter) is evolved using its components in an orthonormal basis with respect to the spherical reference metric. Furthermore, all geometric information about the spherical coordinate system is encoded in source terms appearing in the evolution equations. This allows for the straightforward extension of Cartesian high-resolution shock-capturing finite volume codes to use spherical coordinates with our framework. To this end, we have adapted GRHydro, a Cartesian finite volume GRMHD code already available in the Einstein Toolkit, to use spherical coordinates. We present the full evolution equations of the framework, as well as details of its implementation in the Einstein Toolkit. Finally, we validate SphericalNR by demonstrating it passes a variety of challenging code tests in static and dynamical spacetimes.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

A Bimodal Diagnostic Cloud Fraction Parameterization. Part II: Evaluation and Resolution Sensitivity

A wide range of approaches exists to account for subgrid cloud variability in regional simulations of the atmosphere. This paper addresses the following questions: 1) Is there still benefit in representing subgrid variability of cloud in convection-permitting simulations? 2) What is the sensitivity to the cloud fraction parameterization complexity? 3) Are current cloud fraction parameterizations scale-aware across convection-permitting resolutions? These questions are addressed for regional simulations of a 6-week observation campaign in the U.S. southern Great Plains. Particular attention is given to a new diagnostic cloud fraction scheme with a bimodal subgrid saturation-departure PDF, described in Part I. The model evaluation is performed using ground-based remote sensing synergies, satellite-based retrievals, and surface observations. It is shown that not using a cloud fraction parameterization results in underestimated cloud frequency and water content, even for stratocumulus. The use of a cloud fraction parameterization does not guarantee improved cloud property simulations, however. Diagnostic and prognostic cloud schemes with a symmetric subgrid saturation-departure PDF underestimate cloud fraction and cloud optical thickness, and hence overestimate surface shortwave radiation. These schemes require empirical bias-correction techniques to improve the cloud cover. The new cloud fraction parameterization, introduced in Part I, improves cloud cover, liquid water content, cloud-base height, optical thickness, and surface radiation compared to schemes reliant on a symmetric PDF. Furthermore, cloud parameterizations using turbulence-based, rather than prescribed constant subgrid variances, are shown to be more scale-aware across convection-permitting resolutions.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Code Verification and Solution Verification framework in pin-resolved neutron transport code MPACT

Program verification in scientific computing encompasses the application of formal and mathematical techniques to a scientific computing code for its credibility, accuracy, and validity. Code Verification identifies bugs and performance issues in the software development stage. Solution Verification assesses the applicability of the code and the accuracy of the solution to problems of interest. Both activities utilize application cases and quantify the error against prescribed acceptance criteria. However, simply executing more application cases does not guarantee stronger or more comprehensive credibility. Here, we establish a verification framework that involves Code Verification and Solution Verification, both of which work together such that the overarching goal of “converge to the correct answer for the intended application” can be reasonably inferred. The application of such a verification framework is demonstrated using the pin-resolved neutron transport code MPACT, where standard unit tests and regression tests are covered, and where the Method of Exact Solutions and the Method of Manufactured Solutions are successfully used. Additionally, the applicability of Method of Manufactured Solutions is extended to the OECD/NEA C5G7 benchmark problems of practical material and geometric configurations. Solution Verification activities are demonstrated on a practical hierarchy of application models of increasing complexity ranging from 2D pin cell problems to 3D assembly problems. The convergence behavior and rate of convergence with respect to each individual variable are studied and provided. This framework can be adapted broadly to other fields involving scientific computing codes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Coefficient-to-Basis Network: a fine-tunable operator learning framework for inverse problems with adaptive discretizations and theoretical guarantees

We propose a Coefficient-to-Basis Network (C2BNet), a novel framework for solving inverse problems within the operator learning paradigm. C2BNet efficiently adapts to different discretizations through fine-tuning, using a pre-trained model to significantly reduce computational cost while maintaining high accuracy. Unlike traditional approaches that require retraining from scratch for new discretizations, our method enables seamless adaptation without sacrificing predictive performance. Furthermore, we establish theoretical approximation and generalization error bounds for C2BNet by exploiting low-dimensional structures in the underlying datasets. Our analysis demonstrates that C2BNet adapts to low-dimensional structures without relying on explicit encoding mechanisms, highlighting its robustness and efficiency. To validate our theoretical findings, we conducted extensive numerical experiments that showcase the superior performance of C2BNet on several inverse problems. The results confirm that C2BNet effectively balances computational efficiency and accuracy, making it a promising tool to solve inverse problems in scientific computing and engineering applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

DP-TwoLevel: two-stage gradient subspace learning for differentially private federated learning

Federated learning (FL) enables collaborative model training across distributed data sources without sharing raw data, but faces fundamental challenges in communication efficiency and privacy. Differentially private (DP) training mitigates information leakage but introduces noise that degrades model performance, especially in high-dimensional settings. We propose DP-TwoLevel, a hierarchical gradient projection method that improves utility under fixed DP constraints by exploiting low-dimensional structure in model updates. Our approach learns a two-level PCA-based representation of gradients and applies DP noise in a reduced-dimensional subspace, thereby lowering the effective noise magnitude while preserving dominant signal components. We evaluate the method across three datasets (MNIST, Fashion-MNIST, CIFAR-10) and three privacy regimes (ϵ∈0.5, 1.0, 2.0). Across nine experimental settings, DP-TwoLevel consistently outperforms DP-FedAvg, achieving an average accuracy improvement of 9.44%, with larger gains observed in lower ϵ(higher-noise) regimes (up to +22.31%). We further analyze scalability across models ranging from 100K to 1.49M parameters and identify a variance-based success criterion: performance remains strong when the projection preserves more than 75% of gradient variance, degrades in a marginal regime (65–75%), and fails below this threshold. Our results demonstrate that structure-aware dimensionality reduction can significantly improve the privacy–utility tradeoff in FL without modifying formal privacy guarantees. We also provide empirical evidence of scaling limitations for global projections and motivate per-layer extensions for larger models.

Kotevska, Olivera [ORNL] (ORCID:0000000316772243)↗
DOE OSTI2025

Automatic Generation of Algorithms for High-Speed Reliable Lossy Data Compression (Final Report)

Fast reliable data compression is urgently needed for many leading-edge scientific instruments and for exascale high-performance computing applications because they produce vast amounts of data at extremely high rates. The goal of this project has been to develop a framework named LC that is able to automatically generate high-speed lossless and reliable lossy compression and decompression algorithms that can be customized for different kinds of data. The resulting LC framework is freely available on GitHub. To achieve high-speed operation, LC outputs optimized and parallelized CPU and GPU implementations of the generated algorithms. To ensure the quality of lossily compressed data, LC guarantees the user-provided error bound. To be able to customize the compression algorithm to various use cases, LC can synthesize millions of different algorithms and automatically search for the one that works best for the given data. We have already employed LC to create state-of-the-art lossless and lossy compressors for scientific data as well as leading lossless compressors for images. We hope that LC and the customized, fast, reliable, and CPU/GPU-compatible compression algorithms that it can generate will greatly benefit the many scientific applications that need not only high trustworthiness but also high performance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Generative AI models for learning flow maps of stochastic dynamical systems in bounded domains

Simulating stochastic differential equations (SDEs) in bounded domains, presents significant computational challenges due to particle exit phenomena, which requires accurate modeling of interior stochastic dynamics and boundary interactions. Despite the success of machine learning-based methods in learning SDEs, existing learning methods are not applicable to SDEs in bounded domains because they cannot accurately capture the particle exit dynamics. We present a unified hybrid data-driven approach that combines a conditional diffusion model with an exit prediction neural network to capture both interior stochastic dynamics and boundary exit phenomena. Our ML model consists of two major components: a neural network that learns exit probabilities using binary cross-entropy loss with rigorous convergence guarantees, and a training-free diffusion model that generates state transitions for non-exiting particles using closed-form score functions. The two components are integrated through a probabilistic sampling algorithm that determines particle exit at each time step and generates appropriate state transitions. Here, the performance of the proposed approach is demonstrated via three test cases: a one-dimensional simplified problem for theoretical verification, a two-dimensional advection-diffusion problem in a bounded domain, and a three-dimensional problem of interest to magnetically confined fusion plasmas.

Bounded domains↗
DOE OSTI2024

Dual-Band Polarization Control with Pairwise Positioning of Polarization Singularities in Metasurfaces

Emerging applications of metasurfaces in classical and quantum optics are driving the need for precise polarization control of nearly-degenerate, high quality (𝑄)-factor modes. However, current approaches to creating specifically polarized pairs of modes force a trade-off between maintaining high 𝑄 factors and robustness. Here, we solve this challenge by employing pairwise generation, annihilation, and positioning of polarization singularities, derived from symmetry-guaranteed pairs of symmetry-protected bound states in the continuum. We experimentally demonstrate this design paradigm in silicon metasurfaces with mode splittings of ≈ 20 nm, mode splitting deviations as low as 1 nm, and 𝑄 factors up to 200. Furthermore, this approach opens new avenues for enhancing metasurface performance across a diverse range of applications, including sensing, modulating, nonlinear mixing, and generating quantum light.

Metasurfaces↗
DOE OSTI2021

Safe Reinforcement Learning for Emergency Load Shedding of Power Systems

The paradigm shift in the electric power grid necessitates a revisit of existing control methods to ensure the grid’s security and resilience. In particular, the increased uncertainties and rapidly changing operational conditions in power systems have revealed outstanding issues in terms of either speed, adaptiveness, or scalability of the existing control methods for power systems. On the other hand, the availability of massive real-time data can provide a clearer picture of what is happening in the grid. Recently, deep reinforcement learning (RL) has been regarded and adopted as a promising approach leveraging massive data for fast and adaptive grid control. However, like most existing machine learning (ML)- based control techniques, RL control usually cannot guarantee the safety of the power systems. In this paper, we introduce a novel method for safe RL-based load shedding of power systems that can enhance the safe voltage recovery of the electric power grid after experiencing faults. Numerical simulation on the IEEE 39-bus testcase is performed to demonstrate the effectiveness of the proposed safe RL emergency control, as well as its adaptive capability to faults not seen in the training.

reinforcement learning, emergency control, power g↗
DOE OSTI2020

Uncertainties in Density and Simulation Parameters for Radiographic Reconstructions Using Machine Learning

We will develop new and improved methods that will enable a fuller and more extensive use of experimental data, such as from radiographic imaging, towards better characterizing and reducing uncertainties in predictive modeling of weapons performance. We will achieve this by leveraging recent developments in the areas of computational imaging, statistical and machine learning, and reduced order modeling. Key new aspects of our approach include (a) a coupling of deep learning based density reconstruction with fast hydrodynamics simulators that will permit the development of certain guarantees on extrapolatability and bounds on certain other hydrodynamics-related para- metric uncertainties and (b) a dual approach towards better characterizing uncertainties in density reconstruction using deep learning based surrogates to accelerate Bayesian reconstructions on the one hand and using variational inference and Bayesian machine learning on the other hand.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗
DOE OSTI2020

Scalable Deep-Learning-Accelerated Topology Optimization for Additively Manufactured Materials

Topology optimization (TO) is a popular and powerful computational approach for designing novel structures, materials, and devices. Two computational challenges have limited the applicability of TO to a variety of industrial applications. First, a TO problem often involves a large number of design variables to guarantee sufficient expressive power. Second, many TO problems require a large number of expensive physical model simulations, and those simulations cannot be parallelized. To address these issues, we propose a general scalable deep-learning (DL) based TO framework, referred to as SDL-TO, which utilizes parallel schemes in high performance computing (HPC) to accelerate the TO process for designing additively manufactured (AM) materials. Unlike the existing studies of DL for TO, our framework accelerates TO by learning the iterative history data and simultaneously training on the mapping between the given design and its gradient. The surrogate gradient is learned by utilizing parallel computing on multiple CPUs incorporated with a distributed DL training on multiple GPUs. The learned TO gradient enables a fast online update scheme instead of an expensive update based on the physical simulator or solver. Using a local sampling strategy, we achieve to reduce the intrinsic high dimensionality of the design space and improve the training accuracy and the scalability of the SDL-TO framework. The method is demonstrated by benchmark examples and AM materials design for heat conduction. The proposed SDL-TO framework shows competitive performance compared to the baseline methods but significantly reduces the computational cost by a speed up of around 8.6x over the standard TO implementation.

Bi, Sirui↗
DOE OSTI2023

Tensor Decompositions for Count Data that Leverage Stochastic and Deterministic Optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the global maximum likelihood estimator from local minima. Simultaneously, a recent trend in theoretical computer science and numerical linear algebra leverages randomization to solve very large, hard problems. The typical approach is to use randomization for a fast approximation and determinism for refinement to yield effective algorithms with theoretical guarantees. Two popular algorithms for Poisson CPD reflect that emergent dichotomy: CP Alternating Poisson Regression is a deterministic algorithm and Generalized Canonical Polyadic decomposition makes use of stochastic algorithms in several variants. This work extends recent work to develop two new methods that leverage randomized and deterministic algorithms for improved accuracy and performance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Evaluating Methods for Measuring Grid Frequency in Low-Inertia Power Systems: Preprint

Accurate measurement of grid frequency is a critical component of reliable grid control. Traditionally, methods such as phase locked loops (PLLs) and discrete Fourier transforms (DFTs) have been used in inverters and phasor measurement units (PMUs) to measure frequency. However, as the percentage of inverter-based resources (IBRs) such as solar and wind has increased, these conventional frequency measurement methods are proving unable to guarantee reliable control in some cases. One challenge is measuring frequency during transient events, where there is a disruption in the steady state sinusoidal voltage. During these events, the underlying frequency of the grid may barely change, but measurement methods report a large spike in frequency due to the disrupted waveform. New methods must balance between suppressing spikes in frequency during faults, and providing fast, accurate, measurements in all other grid operation conditions, especially during events with high rate-of-change-of frequency (ROCOF), which are more prevalent in high-IBR power systems. This paper first surveys frequency measurement methods that have been proposed to reduce measurement errors during transient events. Then, both conventional and more novel frequency measurement methods are tested against an IEEE standard and industry recommendations, and their performance is evaluated for events simulated in PSCAD. Results quantify the trade-offs in performance during different grid conditions and lead to suggestions for the most appropriate frequency and ROCOF measurement methods for low inertia grids.

frequency↗
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↗