Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “error correcting codes”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Logical quantum processor based on reconfigurable atom arrays

Suppressing errors is the central challenge for useful quantum computing, requiring quantum error correction (QEC) for large-scale processing. However, the overhead in the realization of error-corrected ‘logical’ qubits, in which information is encoded across many physical qubits for redundancy, poses substantial challenges to large-scale logical quantum computing. Here we report the realization of a programmable quantum processor based on encoded logical qubits operating with up to 280 physical qubits. Using logical-level control and a zoned architecture in reconfigurable neutral-atom arrays, our system combines high two-qubit gate fidelities, arbitrary connectivity, as well as fully programmable single-qubit rotations and mid-circuit readout. Operating this logical processor with various types of encoding, we demonstrate improvement of a two-qubit logic gate by scaling surface-code distance from d = 3 to d = 7, preparation of colour-code qubits with break-even fidelities, fault-tolerant creation of logical Greenberger–Horne–Zeilinger (GHZ) states and feedforward entanglement teleportation, as well as operation of 40 colour-code qubits. Finally, using 3D [[8,3,2]] code blocks, we realize computationally complex sampling circuits with up to 48 logical qubits entangled with hypercube connectivity with 228 logical two-qubit gates and 48 logical CCZ gates. We find that this logical encoding substantially improves algorithmic performance with error detection, outperforming physical-qubit fidelities at both cross-entropy benchmarking and quantum simulations of fast scrambling. These results herald the advent of early error-corrected quantum computation and chart a path towards large-scale logical processors.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2025

Schrödinger cat states of a nuclear spin qudit in silicon

High-dimensional quantum systems are a valuable resource for quantum information processing. They can be used to encode error-correctable logical qubits, which has been demonstrated using continuous-variable states in microwave cavities or the motional modes of trapped ions. For example, high-dimensional systems can be used to realize ‘Schrödinger cat’ states, which are superpositions of widely displaced coherent states that can be used to illustrate quantum effects at large scales. Recent proposals have suggested encoding qubits in high-spin atomic nuclei, which are finite-dimensional systems that can host hardware-efficient versions of continuous-variable codes. Here, in this study, we demonstrate the creation and manipulation of Schrödinger cat states using the spin-7/2 nucleus of an antimony atom embedded in a silicon nanoelectronic device. We use a multi-frequency control scheme to produce spin rotations that preserve the symmetry of the qudit, and we constitute logical Pauli operations for qubits encoded in the Schrödinger cat states. Our work demonstrates the ability to prepare and control non-classical resource states, which is a prerequisite for applications in quantum information processing and quantum error correction, using our scalable, manufacturable semiconductor platform.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Robust Resilient Signal Reconstruction under Adversarial Attacks

We consider the problem of signal reconstruction for a system under sparse signal corruption by a malicious agent. The reconstruction problem follows the standard error coding problem that has been studied extensively in the literature. We include a new challenge of robust estimation of the attack support. The problem is then cast as a constrained optimization problem merging promising techniques in the area of deep learning and estimation theory. A pruning algorithm is developed to reduce the "false positive" uncertainty of data-driven attack localization results, thereby improving the probability of correct signal reconstruction. Sufficient conditions for the correct reconstruction and the associated reconstruction error bounds are obtained for both exact and inexact attack support estimation. Moreover, a simulation of a water distribution system is presented to validate the proposed techniques.

Robust, Signal reconstruction, Resilient estimator↗
DOE OSTI2022

An improved pressure drop correlation for modeling localized effects in a pebble bed reactor

Advances in the development of pebble bed reactors (PBRs) has created a desire for accurate and cost-effective simulation tools for design scoping studies and safety analysis. The current state-of-the-art for these simulations is the use of porous media models, although these models rely on correlations to capture the effects of flow features that are not explicitly modeled. One of the areas where correlation accuracy is currently lacking is in the near-wall region of the bed. In this region, the presence of the wall causes the pebbles to pack more orderly, drastically changing the geometry and flow behavior in this region. This work presents a new generalized pressure drop correlation for PBRs based on the KTA equation. A high-to-low methodology is applied, where large eddy simulation (LES) is performed on two beds of 1568 and 1700 pebbles to generate a high-fidelity dataset. The flow fields are then averaged in time and separated into concentric rings of 0.05 D peb width. Average porosity, velocity, and pressure drop are extracted for each ring and the friction and form losses are calculated. The Reynolds number range for this study is 625–10,000, and thus the form losses are dominant over the friction losses. The form losses across the rings are investigated, and a correction term for the form loss calculation is determined and applied to the KTA equation to drastically improve the capability of modeling localized porosity effects in a porous media code. Finally, the improved correlation reduces near-wall velocity prediction error from over 50% with the KTA correlation to around 5%. Agreement in pressure drop prediction between LES and porous media simulations is also improved.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

(Doublon) Benchmarking of Different Inverse Point Kinetics Implementations for an Autocorrected Reactimeter Algorithm

In November 2017, the Transient Reactor Test Facility returned to operation. Since that time, many transient test series have been completed, such as the Transient Heatsink Overpower Response capsule (THOR), the Transient Water Irradiation System for TREAT (TWIST), and Sirius. Each has provided valuable data for materials performance and reactor safety that can be applied in future designs. During each experimental series, detector count rates provided important information on the core behavior during transients. However, a limitation of these data is that variations in the neutron distribution during experiments can cause errors when attempting to infer reactivity evolution from detector signals. Neutron physics codes can be used to compute the flux shape variations. However, this is a poor solution when the experimental data is used for code verification, validation and uncertainty quantification. Indeed, if the output of the code is used both as a reference and to correct what the reference is compared to, the circular dependency limits the quality of the verification, validation and uncertainty quantification approach. To overcome this problem, the autocorrected reactimeter algorithm (ACRA) has been developed. This approach infers a time-dependent reactivity evolution by testing different spatial corrections and selecting the one that minimizes reactivity variations when the core is in a frozen configuration (i.e., when there is no variation in parameters affecting reactivity). However, the scope of this method was limited to transients where there were negligible thermal feedback. Indeed, the core is never in a frozen configuration when the fuel temperature varies during the whole transient. This is our motivation for developing an improved version of the ACRA that does not require frozen configurations. To develop this new algorithm, we need a precise and unbiased implementation of the inverse point kinetic equations (IPKEs) as any error in the reactivity evaluation will be propagated into the choice of the optimal spatial correction. Indeed, the previous reactimeter algorithm would use approximations, such as a negligible flux amplitude derivative, to focus on rapidity. For the numerical validation of ACRA, we aim at absolute error under for reactivity derived from signals similar to the one of this study. In this summary, we test eight different IPKE implementations. Each will process a mockup signal built for this study, similar to those that the future ACRA will process. Each reactivity output will be compared to the reference reactivity that has been used to generate the mockup signal. The implementation minimizing the difference with the reference reactivity will be used in the development of a new ACRA formulation.

73 - NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Approximate symmetries and quantum error correction

Abstract Quantum error correction (QEC) is a key concept in quantum computation as well as many areas of physics. There are fundamental tensions between continuous symmetries and QEC. One vital situation is unfolded by the Eastin–Knill theorem, which forbids the existence of QEC codes that admit transversal continuous symmetry actions (transformations). Here, we systematically study the competition between continuous symmetries and QEC in a quantitative manner. We first define a series of meaningful measures of approximate symmetries motivated from different perspectives, and then establish a series of trade-off bounds between them and QEC accuracy utilizing multiple different methods. Remarkably, the results allow us to derive general quantitative limitations of transversally implementable logical gates, an important topic in fault-tolerant quantum computation. As concrete examples, we showcase two explicit types of quantum codes, obtained from quantum Reed–Muller codes and thermodynamic codes, respectively, that nearly saturate our bounds. Finally, we discuss several potential applications of our results in physics.

Physics↗
DOE OSTI2021

A deterministic verification strategy for electrostatic particle-in-cell algorithms in arbitrary spatial dimensions using the method of manufactured solutions

As simulations of kinetic plasmas continue to increase in scope and complexity, a rigorous and straightforward method for verifying particle-in-cell (PIC) implementations is necessary to ensure their correctness. Here, in this paper, we present a deterministic method for the rigorous verification of multidimensional, multispecies, electrostatic particle-in-cell codes based on the method of manufactured solutions. Specifically, we prove that rigorous verification is possible through the exclusive examination of errors of grid quantities (i.e., moments and/or fields), allowing for a very light-weight and non-intrusive implementation in existing PIC codes. This is a marked improvement over earlier PIC verification approaches (only demonstrated with one species in 1D-1V), which rely on the comparison of cumulative distribution functions, and are invasive on the code base, introduce additional stochastic noise, are significantly more computationally expensive, and lack rigorous convergence properties. Interestingly, we show that different grid quantities feature different rates of convergence with the number of particles and mesh size, impacting the verification process. These theoretical results are confirmed numerically with a multi-species 2D-2V particle-in-cell code, including the ability of the method to detect order reduction due to an incorrect implementation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Effects of Injected Current Streams on MHD Equilibrium Reconstruction of Local Helicity Injection Plasmas in a Spherical Tokamak

Open field line currents are intrinsic to DC helicity injection plasma startup and pose a challenge for inferring the plasma equilibrium with standard reconstruction analysis. Local helicity injection (LHI) is a type of DC helicity injection which uses small, modular current sources to drive force-free current along helical field lines to produce tokamak plasmas. MHD modeling and magnetic measurements during LHI indicate the injected current streams remain coherent as helical structures on the outboard edge of a core toroidal plasma that is tokamak-like in a toroidally averaged sense. To extract core plasma equilibrium properties, external magnetic diagnostics corrected for contributions from the injected current streams are fitted by a standard Grad-Shafranov equilibrium code. An iterative approach for estimating and subtracting the stream contributions from the diagnostic signals is described and applied to a model equilibrium database to reduce systematic errors introduced by the streams. Convergence is usually attained with 2 to 4 iterations, with derived equilibrium parameters matching the prescribed axisymmetric core values to within estimated experimental uncertainties. Accurate recovery of core parameters occurs when the ratio of the net toroidal windup current from the streams to the core plasma current is less than 0.2, which is typically satisfied in most experiments.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
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

Enhancing quantum memory lifetime with measurement-free local error correction and reinforcement learning

Reliable quantum computation requires systematic identification and correction of errors that occur and accumulate in quantum hardware. To diagnose and correct such errors, standard quantum error-correcting protocols utilize global error information across the system obtained by mid-circuit readout of ancillary qubits. We investigate circuit-level error-correcting protocols that are measurement-free and based on local error information. Such a local error correction (LEC) circuit consists of faulty multi-qubit gates to perform both syndrome extraction and ancilla-controlled error removal. We develop and implement a reinforcement learning framework that takes a fixed set of faulty gates as inputs and outputs an optimized LEC circuit. To evaluate this approach, we quantitatively characterize an extension of logical qubit lifetime by a noisy LEC circuit. For the two-dimensional (2D) classical Ising model and four-dimensional toric code, our optimized LEC circuit performs better at extending a memory lifetime compared with a conventional LEC circuit based on Toom's rule in a subthreshold gate error regime. We further show that such circuits can be used to reduce the rate of mid-circuit readouts to preserve a 2D toric code memory. Lastly, we discuss the application of the LEC protocol on dissipative preparation of quantum states with topological phases.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2024

Enhancing detection of topological order by local error correction

The exploration of topologically-ordered states of matter is a long-standing goal at the interface of several subfields of the physical sciences. Such states feature intriguing physical properties such as long-range entanglement, emergent gauge fields and non-local correlations, and can aid in realization of scalable fault-tolerant quantum computation. However, these same features also make creation, detection, and characterization of topologically-ordered states particularly challenging. Motivated by recent experimental demonstrations, we introduce a paradigm for quantifying topological states—locally error-corrected decoration (LED)—by combining methods of error correction with ideas of renormalization-group flow. Our approach allows for efficient and robust identification of topological order, and is applicable in the presence of incoherent noise sources, making it particularly suitable for realistic experiments. We demonstrate the power of LED using numerical simulations of the toric code under a variety of perturbations. We subsequently apply it to an experimental realization, providing new insights into a quantum spin liquid created on a Rydberg-atom simulator. Finally, we extend LED to generic topological phases, including those with non-abelian order.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Learning-Based Quantum Compilation: Translating QASM to QIR with CodeBERT

We propose a learning-based approach to quantum compilation by translating OpenQASM to Quantum Intermediate Representation (QIR) using a fine-tuned CodeBERT model. Trained on 10,000 synthetic QASM-QIR pairs, the model captures code semantics while addressing QIR verbosity and the 512-token limit via a custom token compression scheme. Finetuning was performed on the Frontier supercomputer, with results showing syntactic correctness and stable validation loss reduction. Our method moves toward enabling flexible, language-modeldriven quantum software tools. It also introduces syntax error handling and the possibility of incorporating classical control constructs, addressing limitations in existing rule-based compilers like qBraid-QIR. While the current model has been validated on quantum-only circuits, we propose future evaluations on hybrid quantum-classical examples. This poster will provide architecture insights, compression examples, training loss plots, and QIR outputs. Our work highlights the potential for scalable, adaptable compilation in future quantum toolchains.

Afrose, Sharmin [ORNL]↗
DOE OSTI2021

Phase-curve Pollution of Exoplanet Transmission Spectra

The occurrence of a planet transiting in front of its host star offers the opportunity to observe the planet’s atmosphere filtering starlight. The fraction of occulted stellar flux is roughly proportional to the optically thick area of the planet, the extent of which depends on the opacity of the planet’s gaseous envelope at the observed wavelengths. Chemical species, haze, and clouds are now routinely detected in exoplanet atmospheres through rather small features in transmission spectra, i.e., collections of planet-to-star area ratios across multiple spectral bins and/or photometric bands. Technological advances have led to a shrinking of the error bars down to a few tens of parts per million (ppm) per spectral point for the brightest targets. The upcoming James Webb Space Telescope (JWST) is anticipated to deliver transmission spectra with precision down to 10 ppm. The increasing precision of measurements requires a reassessment of the approximations hitherto adopted in astrophysical models, including transit light-curve models. Recently, it has been shown that neglecting the planet’s thermal emission can introduce significant biases in the transit depth measured with the JWST/Mid-InfraRed Instrument, integrated between 5 and 12 μm. In this paper, we take a step forward by analyzing the effects of the approximation on transmission spectra over the 0.6–12 μm wavelength range covered by various JWST instruments. We present open-source software to predict the spectral bias, showing that, if not corrected, it may affect the inferred molecular abundances and thermal structure of some exoplanet atmospheres.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Optimization of the artificial viscosity in Lagrangian staggered discretization codes. Modeling 1D stand-alone shock - case study

We have developed new measures of errors for numerical shock. The new approach is based on analysis of the structure function, and separation of the errors related to oscillations and shock width, which also include error in the position of the ”center” of the numerical shock. We have demonstrated that those measures correctly characterize the numerical solution. We introduced an objective function in, which both types of errors are weighted, and presented optimal values of the coefficients of the linear and quadratic viscosity for different weights and different Mach numbers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Using a Large Language Model as a Building Block to Generate Usable Validation and Verification Suite for OpenMP

In the HPC area, both hardware and software move quickly. Often new hardware is developed and deployed, the corresponding software stack, including compilers and other tools, are under active development while leading edge software developers are working to port and tune their applications, all at the same time. While the software ecosystem is in flux, one of the key challenges for users is obtaining insight into the state of implementation of key features in the programming languages and models their applications are using – whether they have been implemented, and whether the implementation conforms to the specification, especially for newly implemented features (less tested by widespread use). OpenMP is one of the most prominent shared memory programming models used for on-node programming in HPC. With the shift towards accelerators (such as GPUs and FPGAs) and heterogeneous programming OpenMP features are getting more complex. It is natural to ask whether generative AI approaches, and large language models (LLMs) in particular, can help in producing validation and verification test suites to allow users better and faster insights into the availability and correctness of OpenMP features of interest. In this work, we explore the use of ChatGPT-4 to generate a suite of tests for OpenMP features. We have chosen a set of directives and clauses, a total of 78 combinations, which first appeared in OpenMP 3.0 (released in May 2008) but are also relevant for accelerators. We prompted ChatGPT to generate tests in the C and Fortran languages, for both host (CPU) and device (accelerator). On the Summit super-computer using the GNU implementation, we found that, of the 78 generated tests 67 C tests and 43 Fortran tests compiled successfully and fewer than those executed to completion. On further analysis we show that not all generated tests are valid. We document the process, results, and provide detailed analysis regarding the quality of tests generated. With the aim of providing input to a production quality validation and verification suite, we manually implement the corrections required to make the tests valid according to the current OpenMP specification. We quantify this effort as small, medium, or large, and record the lines of code changed to correct the invalid tests. With the corrected tests we validate recent implementations from HPE, AMD, and GNU on the Frontier supercomputer. Our experiment and subsequent analysis show that although LLMs are capable of producing HPC specific codes, they are limited by their understanding of the deeper semantics and restrictions of programming models such as OpenMP. Unsurprisingly more commonly used features have better support, while some OpenMP 3.0 directives such as sections and tasking are not universally supported on accelerators. We demonstrate that successful compilation and execution to completion are inadequate metrics for evaluating generated code and that, at this time, commodity LLMs require expert intervention for code verification. This points to gaps in the training data that is currently available for HPC. We demonstrate that with "small" effort 37% of generated invalid C tests and 63% of generated invalid Fortran tests could be corrected. This improves productivity of test generation as we circumvent writing from scratch and the common programming errors associated with it.

Pophale, Swaroop [ORNL] (ORCID:0000000185446367)↗
DOE OSTI2025

Changes to virus taxonomy, the international code of virus classification and nomenclature, and the ICTV statutes ratified by the International Committee on Taxonomy of Viruses (2025)

Abstract The 56th meeting of the Executive Committee (EC) of the International Committee on Taxonomy of Viruses (ICTV) was held in Bari, Italy, in July/August, 2024, and 115 submitted taxonomy proposals were reviewed. A total of 112 were subsequently ratified by the ICTV membership. An additional 9 error correction proposals were also approved in August 2025. This article lists the taxonomy proposals that have now been incorporated into release 40 version v2 of the Master Species List ( https://ictv.global/msl ), the Virus Metadata Resource ( https://ictv.global/vmr ), and associated ICTV databases. In addition to the assignments of 1,563 new virus species, 243genera, 55 families, 11 orders, and 8 classes, there were substantial additions to higher taxonomic ranks. These include the creation of a new realm ( Singelaviria ), which is based on the recognition of a separate evolutionary origin for the hallmark capsid genes of members of the kingdom Helvetiavirae. These express capsid proteins forming a single jelly-roll fold that is structurally and evolutionarily distinct from those of members of the family Bamfordvirae , assigned to the realm Varidnaviria . Furthermore, the realm Varidnaviria underwent a major reorganization, including the addition of a new kingdom, Abadenavirae . Another notable change was the classification of the vertebrate-infecting single-stranded DNA anellovirids into a new phylum Commensaviricota (kingdom Shotokuvirae , realm Monodnaviria ). Archaeal viruses infecting the hyperthermophilic Archaeoglobi were assigned to a new phylum Calorviricota , in the kingdom Trapavirae (realm Monodnaviria ), whereas RNA viruses infecting hyperthermophilic bacteria were classified into a new phylum Artimaviricota (realm Riboviria ). In recognition of his extensive and valuable contributions to virus taxonomic developments in Study Groups and over the period of his EC membership, Stuart Siddell was honoured as a new life member of the ICTV. The ICTV has created a new strategy for disseminating information on taxonomy advances through annual open-access publication of citeable taxonomy proposal summaries from each ICTV Subcommittee. A collective total of 354 co-authors of the seven summaries were drawn from members of each Subcommittee, the EC, and a very large number of contributors from the wider virology community.

Simmonds, Peter (ORCID:0000000279644700)↗
DOE OSTI2024

Benchmarking of Different Inverse Point Kinetics Implementations for an Autocorrected Reactimeter Algorithm

In November 2017, the Transient Reactor Test Facility returned to operation. Since that time, many transient test series have been completed; each has provided valuable data for materials performance, reactor safety that can be applied in future designs. During each experimental series, detector count rates provided important information on the core behavior during transients. However, a limitation of these data is that variations in the neutron distribution during experiments cause errors when attempting to infer reactivity evolution from detector signals. Neutron physics codes can be used to compute the flux shape variations. However, this is a poor solution when the experimental data is used to do verification, validation and uncertainty quantification (VVUQ) on codes. Indeed, if the output of the code is used both as a reference and to correct what the reference is compared to, the circular dependency limits the quality of the VVUQ approach. To overcome this problem, an Autocorrected Reactimeter Algorithm (ACRA) has been developed. This approach infers time-dependent reactivity evolution by testing different spatial corrections and selecting the one that minimizes reactivity variations when the core is in a frozen configuration (i.e. when there is no variation in parameters affecting reactivity). However, the scope of this method was limited to transients where there were negligible thermal feedback. Indeed, the core is never in a frozen configuration when the fuel temperature varies during the whole transient. This is our motivation for the development of an improved version of the ACRA which does not require frozen configurations

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2023

Using CUBIT to Create Unstructured Mesh Models for MCNP Simulations

The Monte Carlo N-Particle (MCNP) transport code version 6 (also known as MCNP6) has the capability for tracking particles on unstructured mesh (UM) geometry models embedded into constructive solid geometry (CSG) cells. This feature has been developed for performing calculations of complex geometry models because creating CSG models is a time-consuming and error-prone process as the complexities of geometries increase. An MCNP UM calculation requires UM geometry input files. The UM capability was originally designed to work with UM models created with the Abaqus/CAE software and ASCII input files that it generates. The Abaqus-formatted input files needed for MCNP UM calculations must have the correct Abaqus syntax and meet the additional MCNP requirements. Several software packages can generate a UM model formatted as an Abaqus input file. Cubit, the Sandia National Laboratory automated mesh generation toolkit, can generate a UM model formatted as an Abaqus input file. However, the Abaqus input files created by Cubit cannot be used for MCNP simulations. A Python script has been developed to convert an Abaqus file created by Cubit to an Abaqus file that the MCNP code can process. This report describes the process of using Cubit to create UM models for MCNP calculations.

97 MATHEMATICS AND COMPUTING↗