# Arithmetic Circuits

## Arithmetic Circuits

A critical step in the implementation of any SNARK based application is the conversion of the arbitrary problem to be proven into a mathematical assemblage called an Arithmetic Circuit. While it may seem counterintuitive at first, converting a computational problem to a set of arithmetic operations (addition, multiplication) is precisely what enables zero knowledge circuits produce confirmation on incomplete data the way they do. Each arithmetic circuit is composed of arithmetic gates which are numerical analogs to boolean based logic gates, and wires which demonstrate the flow of values from the beginning of the circuit to the close

<figure><img src="/files/J5Hct7LJ0NPlTUeO7Hth" alt=""><figcaption><p>An arithmetic circuit is made up of wires and gates that represent an arithmetic operation</p></figcaption></figure>


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://battlezips.gitbook.io/battlezips/theory/primitives/arithmetic-circuits.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.