SEARCH · Search NASA

Results for “Code”

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.

SourceResearch connectionFrom yearThrough year

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

At least 37 records · Page 2

All sources NASA NTRS DOE OSTI

DOE OSTI2024

An Energy Codes Gap Analysis Field Study in the Southwest (Final Technical Report)

The primary goal of the “An Energy Codes Gap Analysis Field Study in the Southwest” project was to improve housing through strengthened building energy code implementation in two states, Colorado and Nevada, leading to greater energy and utility bill savings for households. Colorado is a home rule state. Nevada adopts a statewide code, but cities and counties must also adopt the code, making the state function like a home rule state. To broaden the impact of the project, an additional goal was to share and amplify project experiences, findings, and lessons that can be applied in other states. To achieve these goals, the project’s key objectives were to examine how residential energy codes are implemented in partner states; to use these findings to strengthen codes implementation through enhanced education, training, and outreach; and to enhance energy code technical assistance capabilities in the two partner states. In both partner states, the project led to the creation of a quantitative baseline understanding of compliance with high-impact energy code requirements, such as foundation, wall, and ceiling R-value; window U-factor and SHGC; envelope air tightness; duct tightness; and high-efficiency lighting. It then applied this baseline information to directly inform training in geographic areas with high levels of building and construction activity. The project has placed Colorado and Nevada among 23 states across the country that have conducted a single-family residential field study based on the established U.S. Department of Energy (DOE) methodology since 2014. It has also helped each State Energy Office test models for partnership- and relationship-building among government agencies and key stakeholder groups, including the State Energy Office and relevant code administration and professional licensing agencies, building officials, designers, builders, trades and utilities. At the national level, the project helped educate and inform State and Territory Energy Offices on a replicable methodology to assess energy code construction practices, effective stakeholder engagement strategies, and tailored energy code education and training. These findings are particularly pertinent for home-rule states, such as Colorado and Nevada, which rely on local government awareness and action to advance and implement building energy codes. By raising awareness of code adoption and compliance, this project has helped to equip each partner state with data on code compliance, strategies, education, and partnership models to advance building energy codes. This in turn will have an important impact on new construction practices in Colorado and Nevada, leading to more energy efficient and affordable housing. Currently, more than 62 percent of Colorado’s population lives in one of the 55 jurisdictions that have adopted the 2021 IECC to date, while nearly 95 percent of the state's population lives in one of the 208 jurisdictions that have adopted a code at 2015 IECC levels or higher. In Nevada, the 2018 IECC was adopted by the Governor’s Office of Energy in July 2018. By July 2020, 47 percent of the adopted energy code in the state was 2018 IECC which covers 96.5 percent of Nevada’s population. The training materials funded by this project focus on the 2021 IECC and will continue to be relevant in the two states as additional jurisdictions update their building energy codes.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2025

Fault Tolerant Decoding of QLDPC-GKP Codes with Circuit Level Soft Information

Concatenated bosonic-stabilizer codes have recently gained prominence as promising candidates for achieving low-overhead fault-tolerant quantum computing in the long term. In such systems, analog information obtained from the syndrome measurements of an inner bosonic code is used to inform decoding for an outer code layer consisting of a discrete-variable stabilizer code such as a surface code. The use of Quantum Low-Density Parity Check (QLDPC) codes as an outer code is of particular interest due to the significantly higher encoding rates offered by these code families, leading to a further reduction in overhead for large-scale quantum computing. Recent works have investigated the performance of QLDPC-GKP codes in detail, and the use of analog information from the inner code significantly boosts decoder performance. However, the noise models assumed in these works are typically limited to depolarizing or phenomenological noise. In this paper, we investigate the performance of QLDPC-GKP concatenated codes under circuit-level noise, based on a model introduced by Noh et al. in the context of the surface-GKP code. To demonstrate the performance boost from analog information, we investigate three scenarios: (a) decoding without soft information, (b) decoding with precomputed error probabilities but without real-time soft information, and (c) decoding with real-time soft information obtained from round-to-round decoding of the inner GKP code. Results show minimal improvement between (a) and (b), but a significant boost in (c), indicating that real-time soft information is critical for concatenated decoding under circuit-level noise. We also study the effect of measurement schedules with varying depths and show that using a schedule with minimum depth is essential for obtaining reliable soft information from the inner code.

Borah, Shantom K. [Arizona U. (main)]↗

DOE OSTI2025

Dynamical logical qubits in the Bacon-Shor code

The Bacon-Shor code is a quantum error correcting subsystem code composed of weight-2 check operators that admits a single logical qubit, and has distance 𝑑 on a 𝑑×𝑑 square lattice. We show that when viewed as a Floquet code, by choosing an appropriate measurement schedule of the check operators, it can additionally host several dynamical logical qubits. Specifically, we identify a period-4 measurement schedule of the check operators that preserves logical information between the instantaneous stabilizer groups. Such a schedule not only measures the usual stabilizers of the Bacon-Shor code, but also measures and promotes gauge operators of the parent subsystem code to additional temporary stabilizers that protect the dynamical logical qubits against errors. We show that the code distance of these Floquet-Bacon-Shor codes scales as Θ⁢(𝑑/√𝑘) on an 𝑛=𝑑×𝑑 lattice with 𝑘 dynamical logical qubits, along with the logical qubit of the parent subsystem code. Unlike the usual Bacon-Shor code, the Floquet-Bacon-Shor code family introduced here can therefore saturate the subsystem bound 𝑘⁢𝑑=𝑂⁡(𝑛). Moreover, several errors are shown to be self-corrected purely by the measurement schedule itself. This work provides insights into the design space for dynamical codes and expands the known approaches for constructing Floquet codes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Market Driven Residential Energy Codes: Comparing Performance in a Changing Technological Environment

The research project is undertaken to better understand the changing relationship between the two basic methods of building energy code compliance – prescriptive and performance – and how those methods relate to each other with respect to advancements in building energy computer simulation standards and capabilities. The International Energy Efficiency Code (IECC) is a model code adopted by many jurisdictions across the United States. Historically, the prescriptive compliance methodology has been preferred in most jurisdictions. The prescriptive methodology requires meeting or exceeding specific efficiency minimums for each envelope component. This tends to be a simple method to teach and verify. A more involved prescriptive alternative called the Total UA alternative is sometimes used. This method requires some multiplication, summing, and comparison to compute, so it is done with a fairly simple computer program. However, advances in computer and building energy simulation technology have resulted in increased use of more detailed performance compliance methods. The performance compliance method establishes the annual energy cost threshold via hourly simulation models. The compliance threshold is determined with a comparison building model simulation with geometry similar to the proposed home and with energy feature parameters and efficiencies as specified in the IECC. This project examines relationships between the two methods of building energy code compliance, including: • Overall annual energy use based on utility bill analysis by compliance method • Code official work processes with respect to compliance methods • Gaps and issues associated with building code compliance methods • Simulated energy use difference between compliance methods • Code compliance cost as a function of compliance method • Code compliance labeling effectiveness for high performance residences • Getting to net zero energy use and net zero greenhouse gas emissions through high performance code alternatives • Electronic code permitting and compliance alternatives

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

DOE OSTI2025

Demand Response in Residential Energy Code: Technical Brief

As buildings account for over 75% of U.S. electricity use, effectively managing their loads can greatly facilitate the transition towards a clean, reliable grid. Grid-interactive efficient buildings (GEBs) combine efficiency and demand flexibility with smart technologies and communication to provide occupant comfort and productivity while serving the grid as a distributed energy resource (DER). In turn, GEBs can play a key role in ensuring access to an affordable, reliable, sustainable, and modern U.S. electric power system. Their national adoption could provide $\$$100-200 billion in U.S. electric power system cost savings over the next two decades. The associated reduction in CO 2 emissions is estimated at 6% per year by 2030 (DOE 2021). Building codes represent standard design practice in the construction industry and continually evolve to include advanced technologies and innovative practices. Historically, national model energy codes establish minimum efficiency requirements for new construction (ICC 2020). Expanding codes to support GEB capabilities is a pivotal step towards realizing demand flexibility in support of a clean grid by addressing capabilities to improve interoperability between smart building systems, the grid, and renewable energy resources. Realizing GEBs requires buildings with automated demand response (DR) capabilities that enable standardized communication with or control of, subject to explicit consumer consent, energy smart appliances or home energy management systems. This is achieved through direct or indirect (i.e., via an aggregator) communication between appliances and the electric grid. Energy codes can also support DR communication standardization and advance the deployment of building-integrated DERs such as energy storage, generation, and electric vehicles (EVs). Incorporating automated DR capabilities in energy codes provides many benefits to the consumers. Specifically, it aligns building electric load demand with intermittent renewable energy source availability, decreases peak load on the electric grid, allows buildings to respond to utility price signals, supports electrical network reliability and market growth of products and processes aligned with clean economic growth. The incorporation of DR into the model residential energy codes was considered for both the 2021 and 2024 International Energy Conservation Code (IECC) code development cycles. The approved DR measures in the 2021 cycle were removed in response to appeals (ICC 2020). Updated language was presented for consideration again for the 2024 IECC, where it was negotiated and again approved, and again removed in response to appeals (ICC 2024). This resulted in many sections, including sections on demand responsive controls, being moved to the credits options or an appendix as a voluntary application. This technical brief updates the proposed DR components such that they can be considered by states and local governments for direct incorporation into their codes, as well as for future IECC energy code development. The proposal refinements are intended to support consistency in approach and provide a degree of certainty for building owners, designers, contractors, manufacturers, and building and fire safety professionals. The scope of this technical brief includes three strategies for DR in residential buildings: 1) smart thermostats with demand-responsive control, 2) electric water heating incorporating demand-responsive controls and communication and 3) grid Integrated solar and energy storage systems.

2021 IECC↗

DOE OSTI2024

RASPA3

RASPA3, a molecular simulation code for computing adsorption and diffusion in nanoporous materials and thermodynamic and transport properties of fluids. It implements force field based classical Monte Carlo/molecular dynamics in various ensembles. RASPA3 is rewritten from the ground up in C++23 with speed and code readability in mind. Transition-matrix Monte Carlo is added to compute the density of states and free energies. The Monte Carlo code for rigid molecules is based on quaternions, and the atomic positions needed in the energy evaluation are recreated from the center of mass position and quaternion orientation. The expanded ensemble methodology for fractional molecules, with a scaling parameter λ between 0 and 1, now also keeps track of analytic expressions of dU/dλ, allowing independent verification of the chemical potential using thermodynamic integration. The source code is freely available under the MIT license on GitHub.

Dubbeldam, David↗

DOE OSTI2025

Fracton models from product codes

We explore a deep connection between fracton order and product codes. In particular, we propose and analyze conditions on classical seed codes which lead to fracton order in the resulting quantum product codes. Depending on the properties of the input codes, product codes can realize either Type-I or Type-II fracton models, in both nonlocal and local constructions. For the nonlocal case, we show that a recently proposed model of lineons on nonlocal graphs can be obtained as a hypergraph product code. Interestingly, constrained mobility in this model arises only from energy barriers associated with the graph. For the local case, we introduce a novel type of classical LDPC code defined on a planar aperiodic tiling. By considering the specific example of the pinwheel tiling, we demonstrate the systematic construction of local Type-I and Type-II fracton models as product codes. Our work establishes product codes as a natural setting for exploring fracton order.

Fractons↗

DOE OSTI2025

Building Performance Standards and Energy Code Alignment - Technical Brief

Building energy codes focus on building design, construction and renovation and have significantly increased building efficiency since the first national energy code was published in 1975. Most jurisdictions have energy codes based on ANSI/ASHRAE/IES Standard 90.1 (hereto referred to as Standard 90.1) and the International Energy Conservation Code (IECC). Compliance options available in these model energy codes include a prescriptive path, whole building performance paths – including IECC Total Building Performance (TBP), Standard 90.1 Energy Cost Budget (ECB) method and Performance Rating Method (PRM) – and system performance paths for envelope and heating, ventilation, and air-conditioning systems. Building performance standard (BPS) policies are an emerging policy tool used by jurisdictions to reduce the operational energy use or greenhouse gas (GHG) emissions of the existing commercial building stock. BPS policies vary widely between jurisdictions and are tailored to each location’s climate and energy goals. Intuitively, projects that met a recent edition of the energy code should comply with the BPS targets. However, some new buildings may struggle with meeting the BPS for the following reasons: 1. Energy codes focus on the design of the building and its projected ability to perform efficiently, while BPS compliance is dependent on the actual ongoing performance of the building, considering variables like occupancy, operation, and maintenance. 2. There are significant differences in the methodologies used to determine BPS compliance versus code compliance, including how each handles compliance metrics, handling of building amenities, and renewable energy generation. 3. The prescriptive compliance path in the energy code is based on performance of individual building components, as opposed to the performance compliance path which accounts for holistic building design strategies and interdependent building systems. This can result in a significant variability in post-occupancy performance for buildings built using the prescriptive path. Designs on the lower end of the permitted efficiency range may struggle with meeting the BPS.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2025

Hierarchical memories: Simulating quantum LDPC codes with local gates

Constant-rate low-density parity-check (LDPC) codes are promising candidates for constructing efficient fault-tolerant quantum memories. However, if physical gates are subject to geometric-locality constraints, it becomes challenging to realize these codes. In this paper, we construct a new family of [[N,K,D]] codes, referred to as hierarchical codes, that encode a number of logical qubits K=Ω(N/log(N) 2 ). The N th element of this code family is obtained by concatenating a constant-rate quantum LDPC code with a surface code; nearest-neighbor gates in two dimensions are sufficient to implement the corresponding syndrome-extraction circuit and achieve a threshold. Below threshold the logical failure rate vanishes superpolynomially as a function of the distance D(N). We present a bilayer architecture for implementing the syndrome-extraction circuit, and estimate the logical failure rate for this architecture. Under conservative assumptions, we find that the hierarchical code outperforms the basic encoding where all logical qubits are encoded in the surface code.

Pattison, Christopher A. [California Institute of ↗

DOE OSTI2025

Diffusion Codes: Self-Correction from Small(er)-Set Expansion with Tunable Non-locality

Optimal constructions of classical LDPC codes can be obtained by choosing the Tanner graph uniformly at random among biregular graphs. We introduce a class of codes that we call ``diffusion codes'', defined by placing each edge connecting bits and checks on some graph, and acting on that graph with a random SWAP network. By tuning the depth of the SWAP network, we can tune a tradeoff between the amount of randomness -- and hence the optimality of code parameters -- and locality with respect to the underlying graph. For diffusion codes defined on the cycle graph, if the SWAP network has depth $\sim Tn$ with $T> n^{2β}$ for arbitrary $β>0$, then we prove that almost surely the Tanner graph is a lossless ``smaller set'' vertex expander for small sets up size $δ\sim \sqrt T \sim n^β$, with bounded bit and check degree. At the same time, the geometric size of the largest stabilizer is bounded by $\sqrt T$ in graph distance. We argue, based on physical intuition, that this result should hold more generally on arbitrary graphs. By taking hypergraph products of these classical codes we obtain quantum LDPC codes defined on the torus with smaller-set boundary and co-boundary expansion and the same expansion/locality tradeoffs as for the classical codes. These codes are self-correcting and admit single-shot decoding, while having the geometric size of the stabilizer growing as an arbitrarily small power law. Our proof technique establishes mixing of a random SWAP network on small subsystems at times scaling with only the subsystem size, which may be of independent interest.

Combinatorics (math.CO)↗

DOE OSTI2025

Geometric Structure and Transversal Logic of Quantum Reed–Muller Codes

Designing efficient and noise-tolerant quantum computation protocols generally begins with an understanding of quantum error-correcting codes and their native logical operations. The simplest class of native operations are transversal gates, which are naturally fault-tolerant. Here, in this paper, we aim to characterize the transversal gates of quantum Reed–Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. We start our work by establishing a new geometric characterization of quantum RM codes via the Boolean hypercube and its associated subcube complex. More specifically, a set of stabilizer generators for a quantum RM code can be described via transversal X and Z operators acting on subcubes of particular dimensions. This characterization leads us to define subcube operators composed of single-qubit π/2 k Z -rotations that act on subcubes of given dimensions. We first characterize the action of subcube operators on the code space: depending on the dimension of the subcube, these operators either (1) act as a logical identity on the code space, (2) implement non-trivial logic, or (3) rotate a state away from the code space. Second, and more remarkably, we uncover that the logic implemented by these operators corresponds to circuits of multi-controlled-Z gates that have an explicit and simple combinatorial description. Overall, this suite of results yields a comprehensive understanding of a class of natural transversal operators for quantum RM codes.

Reed–Muller (RM) codes↗

DOE OSTI2026

Performance-Aligned LLMs for Generating Fast HPC Code

Optimizing scientific software is a difficult task because codebases are often large and complex, and performance can depend upon several factors including the algorithm, its implementation, and hardware among others. Causes of poor performance can originate from disparate sources and be difficult to diagnose. Recent years have seen a multitude of work that use large language models (LLMs) to assist in software development tasks. However, these tools are trained to model the distribution of code as text, and are not specifically designed to understand performance aspects of code. In this work, we introduce a reinforcement learning based methodology to align the outputs of code LLMs with performance. This allows us to build upon the current code modeling capabilities of LLMs and extend them to generate better performing code. Here, we demonstrate that our fine-tuned model improves the expected speedup of generated code over base models for a set of benchmark tasks from 0.9 to 1.6 for serial code and 1.9 to 4.5 for OpenMP parallel code.

Computer science↗

DOE OSTI2024

Electric Vehicle Charging for Residential and Commercial Energy Codes: Technical Brief

Numerous studies show that sales of electric vehicles (EVs) have grown consistently over recent years in the U.S. The U.S. Energy Information Administration (EIA) estimated 3 million EVs were on the road in 2022, and the Edison Electric Institute (EEI) forecasts a total of 26.4 million EVs on the road by 2030. Based on this forecast, EEI projects the need for an additional 12.9 million EV charge ports by 2030. If EV charging infrastructure fails to keep pace with sales of EVs it could result in consumers stranded without options to power their vehicles. EVs are capable of providing substantial benefits to the consumers. EVs are less expensive to operate than conventional internal combustion engine vehicles, have lower maintenance costs, and have the convenience of fueling (charging) at home or work. Studies conducted in California show that costs associated with installing EV charging infrastructure can be substantially more expensive for retrofit scenarios compared to new construction, making inclusion of EV infrastructure in new construction codes a cost-effective policy option to increase infrastructure to meet growing demands. PNNL tracks adoption of mandatory EV provisions across the U.S. As of December 20, 2024, 12 states (California, Oregon, Washington, Colorado, New Mexico, Illinois, Maryland, Delaware, New Jersey, Rhode Island, Massachusetts and Vermont) and 53 local governments have added EV provisions to their building codes, local ordinances and zoning requirements. Originally published in 2022, this tech brief has been revised to align with recent model energy code committee discussions and published EV infrastructure code language. This technical brief summarizes market trends, costs and benefits, and provides sample code language for EV charging infrastructure for consideration to be included in model codes, such as the International Energy Conservation Code (IECC) and ANSI/ASHRAE/IES Standard 90.1, as well as directly by states and local governments in their building codes. The technical brief summarizes related efforts undertaken by states and local governments, and builds upon language considered during the 2021 and 2024 IECC development cycles.

2021 IECC↗

DOE OSTI2025

Low-Density Parity-Check Codes as Stable Phases of Quantum Matter

Phases of matter with robust ground-state degeneracy, such as the quantum toric code, are known to be capable of robust quantum information storage. Here, we address the converse question: given a quantum error-correcting code, when does it define a stable gapped quantum phase of matter, whose ground-state degeneracy is robust against perturbations in the thermodynamic limit? We prove that a low-density parity-check (LDPC) code defines such a phase, robust against all few-body perturbations, if its code distance grows at least logarithmically in the number of degrees of freedom, and it exhibits “check soundness.” Many constant-rate quantum LDPC expander codes have such properties, and define stable phases of matter with a constant zero-temperature entropy density, violating the third law of thermodynamics. Our results also show that quantum toric-code phases are robust to spatially nonlocal few-body perturbations. Similarly, phases of matter defined by classical codes are stable against symmetric perturbations. In the classical setting, we present improved locality bounds on the quasiadiabatic evolution operator between two nearby states in the same code phase.

quantum error correction↗

DOE OSTI2025

Low-Density Parity-Check Stabilizer Codes as Gapped Quantum Phases: Stability under Graph-Local Perturbations

We generalize the proof of stability of topological order, due to Bravyi, Hastings, and Michalakis, to stabilizer Hamiltonians corresponding to low-density parity-check (LDPC) codes without the restriction of geometric locality in Euclidean space. We consider Hamiltonians 𝐻 0 defined by ⟦𝑁,𝐾,𝑑⟧ LDPC codes, which obey certain topological quantum order conditions: (i) code distance 𝑑 ≥ 𝑐⁢log (𝑁), implying local indistinguishability of ground states, and (ii) a mild condition on local and global compatibility of ground states—these include good quantum LDPC codes and the toric code on a hyperbolic lattice, among others. We consider stability under weak perturbations that are quasilocal on the interaction graph defined by 𝐻 0 and that can be represented as sums of bounded-norm terms. As long as the local perturbation strength is smaller than a finite constant, we show that the perturbed Hamiltonian has well-defined spectral bands originating from the 𝑂⁡(1) smallest eigenvalues of 𝐻 0 . The band originating from the smallest eigenvalue has 2 𝐾 states, is separated from the rest of the spectrum by a finite energy gap, and has exponentially narrow bandwidth 𝛿 =𝐶⁢𝑁⁢𝑒 −Θ⁡(𝑑) , which is tighter than the best-known bounds even in the Euclidean case. We also obtain that the new ground-state subspace is related to the initial-code subspace by a quasilocal unitary, allowing one to relate their physical properties. Our proof uses an iterative procedure that performs successive rotations to eliminate non-frustration-free terms in the Hamiltonian. Our results extend to quantum Hamiltonians built from classical LDPC codes, which give rise to stable symmetry-breaking phases. These results show that LDPC codes very generally define stable gapped quantum phases, even in the non-Euclidean setting, initiating a systematic study of such phases of matter.

mathematical physics↗

DOE OSTI2024

Phase diagram of the three-dimensional subsystem toric code

Subsystem quantum error-correcting codes typically involve measuring a sequence of noncommuting parity check operators. They can sometimes exhibit greater fault tolerance than conventional codes, which use commuting checks. However, unlike subspace codes, it is unclear if subsystem codes—in particular their advantages—can be understood in terms of ground-state properties of a physical Hamiltonian. In this paper, we address this question for the three-dimensional subsystem toric code (3D STC), as recently constructed by Kubica and Vasmer [], which exhibits single-shot error correction. Motivated by a conjectured relation between single-shot properties and thermal stability, we study the zero- and finite-temperature phases of an associated noncommuting Hamiltonian. By mapping the Hamiltonian model to a pair of 3D Z 2 gauge theories coupled by a kinetic constraint, we find various phases at zero temperature, all separated by first-order transitions: There are 3D toric code-like phases with deconfined point-like excitations in the bulk, and there are phases with a confined bulk supporting a 2D toric code on the surface when appropriate boundary conditions are chosen. The latter is similar to the surface topological order present in 3D STC. However, the similarities between the single-shot correction in 3D STC and the confined phases are only partial: they share the same sets of degrees of freedom, but they are governed by different dynamical rules. Instead, we argue that the process of single-shot error correction can more suitably be associated with a path (rather than a point) in the zero-temperature phase diagram, a perspective, which inspires alternative measurement sequences enabling single-shot error correction. Moreover, since none of the above-mentioned phases survives at nonzero temperature, the single-shot error-correction property of the code does not imply thermal stability of the associated Hamiltonian phase. Published by the American Physical Society 2024

Li, Yaodong (ORCID:0000000337421944)↗

DOE OSTI2025

An archaeal genetic code with all TAG codons as pyrrolysine

Multiple genetic codes developed during the evolution of eukaryotes and bacteria, yet no alternative genetic code is known for archaea. We used proteomics to confirm our prediction that certain archaea consistently incorporate pyrrolysine (Pyl) at TAG codons, supporting an alternative archaeal genetic code that we designate the Pyl code. This genetic code has 62 sense codons encoding 21 amino acids. In contrast to monophyletic genetic code distributions in bacteria, the archaeal Pyl code occurs sporadically, indicating that it arose independently in multiple lineages. We discovered that more than 1800 archaeal proteins contain Pyl, increasing the number of such proteins by two orders of magnitude. Additionally, five Pyl transfer RNA (tRNA) pyrrolysyl–tRNA synthetase pairs from Pyl-code archaea were used to introduce Pyl analogs into proteins in Escherichia coli.

Kivenson, Veronika [University of California, Berk↗

DOE OSTI2025

ARCS: Agentic Retrieval-Augmented Code Synthesis with Iterative Refinement

Agentic Retrieval-Augmented Code Synthesis with Iterative RefinementIn supercomputing, efficient and optimized code generation is essential to leverage high-performance systems effectively. We have developed Agentic Retrieval-Augmented Code Synthesis (ARCS), an advanced framework for accurate, robust, and efficient code generation, completion, and translation. ARCS integrates Retrieval-Augmented Generation (RAG) with Chain-of-Thought (CoT) reasoning to systematically break down and iteratively refine complex programming tasks. An agent-based RAG mechanism retrieves relevant code snippets, while real-time execution feedback drives the synthesis of candidate solutions. This process is formalized as a state-action search tree optimization, balancing code correctness with editing efficiency. Evaluations on the Geeks4Geeks and HumanEval benchmarks demonstrate that ARCS significantly outperforms traditional prompting methods in translation and generation quality. By enabling scalable and precise code synthesis, ARCS offers transformative potential for automating and optimizing code development in supercomputing applications, enhancing computational resource utilization

Bhattarai, Manish [Los Alamos National Labs]↗