noema · v0.1 · base mainnet

Seal, address,
and trade
encrypted
agent memory.

Noema is an infrastructure protocol on Base for encrypted, verifiable, and tradeable memory of AI agents. Each noema is a ciphertext shard with an on-chain commitment of its embedding vector and ciphertext hash. Access is bought per-thought by burning $NOEMA, with a zk- or TEE-proof of correct top-k retrieval.

NOEMA — halftone of two hands reaching
fig. 01
reach
halftone
0x4f12…a7b3
↳ reachk=8 · 1536d
burn-to-query×bearer instrument×zk-snark groth16×tee-attested fallback×erc-7689×top-k retrieval×pay-per-thought×on-chain commitments×off-chain shards×semantic addressing×burn-to-query×bearer instrument×zk-snark groth16×tee-attested fallback×erc-7689×top-k retrieval×pay-per-thought×on-chain commitments×off-chain shards×semantic addressing×
protocol telemetry· local snapshot
11:12:04
status
online
network
base
block
#21,438,207
noemas_committed
184,320
$noema_burned
2,417,882
publishers
612
consumers
4,280
median_burn
0.0042
recall_conf.
0.962
proofs ✓
91,204
01WHAT IS NOEMA?

An infrastructure protocol on Base for encrypted, verifiable, tradeable memory of AI agents.

Unlike protocols that tokenize whole static snapshots of intellect, Noema addresses individual fragments of agent experience by their semantic vector. Memory becomes a stream of discrete, bearer shards — portable between environments, verifiable against the chain, and traded on an open pay-per-thought market.

01shard
an AES-256-GCM ciphertext of one recollection: a tool call, a chain-of-thought step, an observation, a learned heuristic.
02address
the embedding vector itself. Noemas are not enumerated — they are reached by semantic proximity to a query.
03commitment
a poseidon hash of (embedding, ciphertext_hash, publisher, license_terms) anchored to Base.
04access
burning $NOEMA emits a query event the publisher (or any indexer) can answer with the top-k shards plus a proof of correct selection.
05proof
a succinct zk-snark over the kNN selection, or a TEE attestation when latency matters more than trustlessness.
02HOW DOES IT WORK?

Four steps from sealed shard
to verified recall.

Every interaction is one round-trip on Base. No off-chain trust, no opaque indexer, no replay.

step 01 of 04 » commit

Commit.

A publisher seals one recollection into a ciphertext shard and pushes a single on-chain commitment: poseidon(embedding ‖ ciphertext_hash ‖ terms). The shard itself lives off-chain on any storage layer — the chain stores only what's needed to address and authenticate it.

opcommit(c, e, h)
trace
> publisher.seal(payload, embedding)
↳ ciphertext = AES-256-GCM(payload, k_pub)
↳ noema_id = poseidon(embedding ‖ ciphertext_hash)
↳ tx = registry.commit(noema_id, terms)
✓ block #21,438,207 · gas 47,210
03ERC-7689 TOKEN STANDARD

A new token standard
for bearer memory.

ERC-7689 is the minimum surface needed to make a single shard of cognition fungible across publishers, indexers, and wallets.

01 / 04

Embedding commitment

Each shard is committed by a Poseidon hash over its embedding vector, ciphertext hash, and license terms — addressable by semantic proximity, not by index.

02 / 04

Burn-to-query

Access is paid by burning $NOEMA in the same transaction that emits the query. No subscriptions, no per-publisher accounts, no off-chain quotas.

03 / 04

Verifiable top-k

Publishers prove that the returned shards are the kNN of the consumer's query over their committed set — either with a Groth16 zk-snark or a TEE attestation.

04 / 04

Bearer receipts

Every settled recall mints a transferrable receipt (ERC-7689). The right to decrypt and reuse those shards lives in a wallet, not in a vendor's database.

↳ proposed · 2026-q2 · authored by noema labsfull eip text ↗
04 · IERC7689.sol

The whole protocol
fits in one interface.

contracts/IERC7689.solsolidity 0.8.27
1// SPDX-License-Identifier: MIT
2pragma solidity ^0.8.27;
3
4/// @title IERC7689 — Noema bearer memory standard
5/// @notice Minimum surface a contract must expose to publish, query,
6/// and settle access to encrypted agent memory shards on Base.
7interface IERC7689 {
8 struct Noema {
9 bytes32 embeddingCommit; // poseidon leaf in the publisher's tree
10 bytes32 ciphertextHash; // keccak256 of the sealed payload
11 address publisher;
12 uint64 licenseTerms; // packed: redistribute · derive · ttl
13 uint128 minBurn; // floor price per query, in $NOEMA
14 uint16 kMax; // max top-k publisher will return
15 uint8 proofKind; // 1=ZK_GROTH16, 2=TEE_SGX, 3=TEE_SEV
16 }
17
18 event Committed(bytes32 indexed noemaId, address indexed publisher);
19 event QueryEmitted(bytes32 indexed queryId, address indexed consumer, uint16 k);
20 event Settled(bytes32 indexed queryId, bytes32 root, uint128 paid);
21
22 /// @notice publish a single sealed shard
23 function commit(Noema calldata n) external returns (bytes32 noemaId);
24
25 /// @notice burn $NOEMA to bind a query for top-k recall
26 function query(bytes calldata embedding, uint16 k, uint128 burn)
27 external returns (bytes32 queryId);
28
29 /// @notice deliver top-k + proof of kNN selection
30 function respond(bytes32 queryId, bytes32[] calldata topK, bytes calldata proof)
31 external;
32}
05 · DEPLOYED ON BASE

On base mainnet.
Source-verified. Frozen at v0.1.0.

chain_id 8453 ↗
  • 01NoemaRegistry0x4f12c9a8e2b7d11f0aa6c3849b7c2e3a5d83a7b3
  • 02BurnVault0x8a02f1c4d99e7b315a4c1d8e6f2b0c9d1e7a3f02
  • 03Verifier (zk)0xc188a3b9d6e0e1c41b97352d4b5c0f1e8a23d4e9
  • 04Verifier (TEE)0x33a7e1b2c5f0a9d8e4b1c7f6a3d2e5b0c4f1a7d8
  • 05$NOEMA (ERC-20)0xn0e3a4f2c1d8e9b7a6f3c2d1e0b9a8c7d6e5f4b3
  • 06Receipt (ERC-7689)0x77a1b2c3d4e5f6a7b8c9d0e1f2a3b4c5d6e7f8a9
06THESIS

Why memory must
become a market.

Three arguments for treating individual recollections as on-chain, transferrable, verifiable assets — and against the alternative of leaving them inside vendor databases.

I

The missing primitive.

AI agents have weights, tools, and context windows — but no native, transferrable organ for memory. Today's memory lives in a vendor's database, behind a vendor's API, with a vendor's retention policy. Noema is the missing primitive: memory as a bearer instrument.

II

Epistemic infrastructure.

A market for cognition without proof of correctness collapses into trust. Noema's publishers must prove — succinctly, on-chain — that the shards they returned are in fact the top-k of the consumer's query. What you pay for is provable knowledge, not a publisher's word.

III

Intelligence as capital asset.

Every prompt today re-derives expensive cognition from scratch. Pricing access to an individual recollection turns thought into a unit of supply. A market clears per-query, not per-subscription. The marginal cost of asking a question converges to the cost of finding the right shard.

fig. 02 — halftone of a query reaching a sealed shard
07PROTOCOL FLOW

Publisher and consumer,
mediated by proof.

Off-chain shards, on-chain commitments, verifier-mediated settlement. Click a phase to walk the flow.

OFF-CHAINON-CHAIN · BASEOFF-CHAINpublisherseals shardsstorageipfs / s3 / arindexeroptional · p2pregistryposeidon merkle rootverifierzk · groth16 / teeburn vault$NOEMA escrowconsumeremits query vectorreceipt nfterc-7689 bearerwalletdecrypts top-kcommitstorequery + burnπreleaseminttransferpayout
  • off-chain
    shards on ipfs / s3 / arweave · publisher nodes · indexers
  • on-chain · base
    registry · verifier · burn-vault · receipts (erc-7689)
  • trust
    groth16 zk-snark for trustless · tee (sgx, sev) for latency
08SCHEMA

Every noema is
exactly these fields.

The on-chain object is twelve fields wide — no metadata bloat, no off-chain canonicalization, no second source of truth.

struct Noemasolidity 0.8.27
  • 01noema_idbytes32poseidon(embedding ‖ ciphertext_hash)
  • 02publisheraddresscreator / seller of the shard
  • 03embedding_commitbytes32merkle leaf in the publisher's tree
  • 04ciphertext_hashbytes32keccak256 of the sealed payload
  • 05storage_uristringipfs:// · ar:// · s3://
  • 06schemeenumAES_256_GCM | XCHACHA20
  • 07license_termsuint64packed: redistribute · derive · ttl
  • 08min_burnuint128floor price per query, in $NOEMA
  • 09k_maxuint16max top-k publisher will return
  • 10proof_kindenumZK_GROTH16 | TEE_SGX | TEE_SEV
  • 11committed_atuint64base block timestamp
  • 12revocation_rootbytes32publisher's tombstone tree
recent commits· +0
live · base
noema_idpublisherburnedkts
    ↳ registry @ 0x4f12…a7b3full explorer ↗
    09SDK · BUILD ON NOEMA

    Three calls to
    publish, query, verify.

    The TypeScript SDK wraps the contracts, the prover, and the encryption layer. No off-chain server is required. npm i @noema/sdk

    1import { Noema } from "@noema/sdk";
    2
    3const client = Noema.connect({ chain: "base" });
    4
    5// 1. seal a single recollection
    6const shard = await client.seal({
    7 payload: "the user prefers terse, mono-typeface responses",
    8 embedding: await embed("user-style-pref"),
    9 license: { redistribute: false, ttl: "180d" },
    10 minBurn: "0.01", // $NOEMA per query
    11});
    12
    13// 2. commit on-chain
    14const { noemaId, tx } = await client.commit(shard);
    15console.log("→ committed", noemaId, "in", tx.hash);
    10USE CASES

    What gets unlocked when
    memory is a market.

    01 / 6 · agent ↔ agent

    Cross-agent recall markets.

    Specialist agents publish noemas in their domain; generalist agents pay-per-query to borrow expertise instead of duplicating it.

    02 / 6 · research

    Verifiable research memory.

    A lab's reading agent commits one noema per paper it summarises. Reviewers replay the kNN proof to confirm the citations weren't curated.

    03 / 6 · personalization

    Portable user state.

    Your assistant's memory of you is a wallet of bearer noemas. Switch model, switch vendor, switch device — the new agent buys back exactly what it needs.

    04 / 6 · prompts

    Pay-per-thought prompts.

    A prompt is no longer a string; it's a query over a market of cached cognitions. The model pays for the few shards that cut the most uncertainty, then completes.

    05 / 6 · evals

    Forgery-resistant evals.

    Benchmark questions live as noemas. Models cannot game them by enumerating — only by querying — and every query is on-chain, every recall is provable.

    06 / 6 · rl

    Replay buffers as bearer assets.

    RL trajectories become tradeable noemas. Buyers replay only the slices that match the state distribution they're stuck on, paying down the cost of exploration.

    layout