# Recursion

## 📚 How Collections and Inscriptions Work

In a traditional collection, you inscribe each **final image (PFP)** directly. But full images are often **1–3MB**, which can cost **thousands of dollars** per file — and if a file is over **4MB**, it **can’t be inscribed at all**.

#### ❌ Why This Doesn’t Scale

In a 10k collection, direct inscriptions are:

* **Too expensive**
* **Not scalable**
* **Limited by size caps**

***

### ✅ Why Recursion Fixes It

With recursion, you inscribe the **individual traits once** (eyes, background, etc.), and then create **small recursive files** that reference those traits to build the final image **on-chain**.

#### Key Benefits:

* **Drastically lower costs**
* **Files stay under size limits**
* **Fully on-chain and modular**

Each mint only needs to inscribe a tiny recursive file — making minting cost as little as **$1 per collector**, without sacrificing on-chain permanence.

***

## 💰 File Size = Higher Fees

Inscriptions are priced **per byte**. Bigger files = higher fees.

#### 📦 Example:

* 100KB  = $100
* 20KB  = $20

👉 **Smaller files = cheaper inscriptions.**\
Keep files light to save money.

***

## ⚙️ Using Generatord + Recursion (The Cheap Way)

Use [GeneratorD](https://www.generatord.io) to build and prepare your collection efficiently.

#### 🛠 Workflow:

1. **Compress traits**:
   * Resize to **500×500**
   * Convert to **`.webp`**
   * Strip metadata (EXIF, color profiles)
2. **Upload compressed traits** to GeneratorD.
3. **Inscribe traits** at a low fee rate (e.g. **1.2 sats/byte**).
4. **Pay for file generation** inside Generatord.
5. **Generate recursive files** (don’t inscribe them yet).
6. **Upload your collection** to\
   👉 <https://creator.ordinalgenesis.xyz>

**⚠️ Important:**\
Do **not** inscribe the recursive files yourself — just generate them and follow the steps in the Ordinal Genesis Creator.

***

## 🧾 Why This Saves Money

Recursive mints only reference traits — they don’t store full images again.

#### 💸 Result:

* Each mint = just 100 bytes
* At 1.2 sats/byte, minting can cost **under $1**
* Scales easily without bloating costs

**👉 Compress + recurse = fully on-chain + super cheap mints**

***


---

# 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://info.ordinalgenesis.xyz/ordinals/recursion.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.