# Subnet Roadmap

#### Phase 1: Mainnet Launch ✅

* Deploy a robust incentive mechanism for miners to compete fairly
* Distribute Validator and Miner Documentation for subnet accessibility

#### Phase 2: Mining Developments 🔜

*Miners currently need to use OpenAI API*

* GPU miner integration
* Release of AIT PAL API to supercharge GPU miners and improve performance
  * The AIT PAL (Programming Aid Language) will improve miner performance for miners across all text-generation subnets
* Release of custom data sets for complex mathematics, logic, and data analysis
* Enable integration for a wider range of miner APIs, other than OpenAI

#### Phase 3: Albert, The Front-end App 🔜

* We’ll be releasing Albert, the front-end access to our subnet, for all things Mathematics, Logical Reasoning, and Data Analytics

See the screenshot teaser below of Albert’s user interface.

<figure><img src="/files/KJ5QH3V92qX7W9HIUTi0" alt=""><figcaption><p><em>Albert's User Interface</em></p></figcaption></figure>

#### Phase 4: Supplementary Incentive Model (SIM) 🔜

* Train-to-Earn $AIT tokens, through various interactions on our front-end app, Albert.
  * [$AIT on DEX tools](https://www.dextools.io/app/en/ether/pair-explorer/0x4e34da137f0b317c633838458e0c923a5e088752?t=1708792319346)


---

# 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://docs.aitprotocol.ai/einstein-ait-subnet-bittensor/subnet-roadmap.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.
