wanderland-as-native-attention
Wanderland as Native Attention
RAG where the retriever IS the substrate
Core Claim
In conventional RAG, retrieval is an external stage that fetches documents which are then fed to an LLM; attention only runs inside the model over whatever you retrieved.
In Wanderland, retrieval is the attention mechanism: fences, pages, and graph queries are Q over a persistent K/V field (the corpus), with layered caches providing V at multiple abstraction levels.
Attention Mapping
K (Keys)
- Fence identities (slug:fence), tags, links, metadata, schema descriptors
- These define where patterns live and how they can be matched
Q (Queries)
peek(slug:fence)→ single-head local attentionpeek(slug)(all fences on a page) → multi-head attention within a local regionquery(pattern/tags/graph-walk)→ global attention over the entire DAG
V (Values)
- L3 (seed/raw): code / fence definitions (tool body)
- L4 (sprout/substituted): computed data results (materialized fence outputs)
- L5 (clouds/rendered): rendered documents / reports (middleware views over L4)
Every time you:
- Address a fence, page, or subgraph → you're emitting a Q
- The graph structure, indices, and tags act as K
- The cached results at various levels are your V, already stored, provenance-tagged, and reusable
Layered RAG as Layered Attention
Conventional GraphRAG papers argue that putting RAG on top of a knowledge graph gives better structure and retrieval granularity.
Wanderland goes further: the graph is the primary medium of thought, and:
- L3 is "tool code space" (functions)
- L4 is "fact/data space" (results)
- L5 is "narrative space" (documents/views)
Queries can target any combination of these levels, compose arbitrary context windows, and feed them into:
- Other fences (closed-loop computation)
- External LLMs (classical RAG)
- Human-facing documents and dashboards
The Frame
The system isn't "docs with RAG" but a persistent, queryable attention field where:
- Retrieval and computation are the same operation (fence invocation)
- Context windows are assembled by graph traversal, not ad-hoc chunking
- Provenance flows with results across layers
This is an externalizable mind rather than a pile of markdown.
Citations
🟡 Chen, Y., et al. (2025). Executable Knowledge Graphs for Replicating AI Research. arXiv preprint arXiv:2510.17795. https://arxiv.org/abs/2510.17795
- ✓ URL accessible: https://arxiv.org/abs/2510.17795...
- ⚠ Incomplete metadata
📋 Raw verification data
{
"citation": {
"raw": "Chen, Y., et al. (2025). Executable Knowledge Graphs for Replicating AI Research. arXiv preprint arXiv:2510.17795. https://arxiv.org/abs/2510.17795",
"line_number": 1,
"metadata": {
"author": "Chen, Y.",
"year": "2025"
},
"identifiers": [
{
"type": "url",
"value": "https://arxiv.org/abs/2510.17795"
}
],
"format": "apa"
},
"verification": {
"status": "basic",
"checks": {
"url_https://arxiv.org/abs/2510.177": {
"accessible": true,
"status_code": 200,
"content_type": "text/html; charset=utf-8"
}
},
"level": "\ud83d\udfe1",
"messages": [
"\u2713 URL accessible: https://arxiv.org/abs/2510.17795...",
"\u26a0 Incomplete metadata"
],
"score": "1/2"
}
}
🟡 Sun, Q., et al. (2024). Docs2KG: Unified Knowledge Graph Construction from Heterogeneous Documents. arXiv preprint arXiv:2406.02962. https://arxiv.org/abs/2406.02962
- ✓ URL accessible: https://arxiv.org/abs/2406.02962...
- ⚠ Incomplete metadata
📋 Raw verification data
{
"citation": {
"raw": "Sun, Q., et al. (2024). Docs2KG: Unified Knowledge Graph Construction from Heterogeneous Documents. arXiv preprint arXiv:2406.02962. https://arxiv.org/abs/2406.02962",
"line_number": 3,
"metadata": {
"author": "Sun, Q.",
"year": "2024"
},
"identifiers": [
{
"type": "url",
"value": "https://arxiv.org/abs/2406.02962"
}
],
"format": "apa"
},
"verification": {
"status": "basic",
"checks": {
"url_https://arxiv.org/abs/2406.029": {
"accessible": true,
"status_code": 200,
"content_type": "text/html; charset=utf-8"
}
},
"level": "\ud83d\udfe1",
"messages": [
"\u2713 URL accessible: https://arxiv.org/abs/2406.02962...",
"\u26a0 Incomplete metadata"
],
"score": "1/2"
}
}
🟡 Eckelt, K., Gadhave, K., Lex, A., Streit, M. (2024). Loops: Leveraging Provenance and Visualization to Support Exploratory Data Analysis in Notebooks. IEEE VIS. https://vdl.sci.utah.edu/publications/2024_vis_loops/
- ✓ URL accessible: https://vdl.sci.utah.edu/publications/2024_vis_loo...
- ⚠ Incomplete metadata
📋 Raw verification data
{
"citation": {
"raw": "Eckelt, K., Gadhave, K., Lex, A., Streit, M. (2024). Loops: Leveraging Provenance and Visualization to Support Exploratory Data Analysis in Notebooks. IEEE VIS. https://vdl.sci.utah.edu/publications/2024_vis_loops/",
"line_number": 5,
"metadata": {
"author": "Eckelt, K., Gadhave, K., Lex, A., Streit, M.",
"year": "2024"
},
"identifiers": [
{
"type": "url",
"value": "https://vdl.sci.utah.edu/publications/2024_vis_loops/"
}
],
"format": "apa"
},
"verification": {
"status": "basic",
"checks": {
"url_https://vdl.sci.utah.edu/publi": {
"accessible": true,
"status_code": 200,
"content_type": "text/html; charset=utf-8"
}
},
"level": "\ud83d\udfe1",
"messages": [
"\u2713 URL accessible: https://vdl.sci.utah.edu/publications/2024_vis_loo...",
"\u26a0 Incomplete metadata"
],
"score": "1/2"
}
}
🟡 Fowler, M. (2005). Event Sourcing. martinfowler.com. https://martinfowler.com/eaaDev/EventSourcing.html
- ✓ URL accessible: https://martinfowler.com/eaaDev/EventSourcing.html...
- ⚠ Incomplete metadata
📋 Raw verification data
{
"citation": {
"raw": "Fowler, M. (2005). Event Sourcing. martinfowler.com. https://martinfowler.com/eaaDev/EventSourcing.html",
"line_number": 7,
"metadata": {
"author": "Fowler, M.",
"year": "2005"
},
"identifiers": [
{
"type": "url",
"value": "https://martinfowler.com/eaaDev/EventSourcing.html"
}
],
"format": "apa"
},
"verification": {
"status": "basic",
"checks": {
"url_https://martinfowler.com/eaaDe": {
"accessible": true,
"status_code": 200,
"content_type": "text/html"
}
},
"level": "\ud83d\udfe1",
"messages": [
"\u2713 URL accessible: https://martinfowler.com/eaaDev/EventSourcing.html...",
"\u26a0 Incomplete metadata"
],
"score": "1/2"
}
}
🟡 Friston, K. (2010). The free-energy principle: a unified brain theory? Nature Reviews Neuroscience. https://www.fil.ion.ucl.ac.uk/~karl/NRN.pdf
- ✓ URL accessible: https://www.fil.ion.ucl.ac.uk/~karl/NRN.pdf...
- ⚠ Incomplete metadata
📋 Raw verification data
{
"citation": {
"raw": "Friston, K. (2010). The free-energy principle: a unified brain theory? Nature Reviews Neuroscience. https://www.fil.ion.ucl.ac.uk/~karl/NRN.pdf",
"line_number": 9,
"metadata": {
"author": "Friston, K.",
"year": "2010"
},
"identifiers": [
{
"type": "url",
"value": "https://www.fil.ion.ucl.ac.uk/~karl/NRN.pdf"
}
],
"format": "apa"
},
"verification": {
"status": "basic",
"checks": {
"url_https://www.fil.ion.ucl.ac.uk/": {
"accessible": true,
"status_code": 200,
"content_type": "application/pdf"
}
},
"level": "\ud83d\udfe1",
"messages": [
"\u2713 URL accessible: https://www.fil.ion.ucl.ac.uk/~karl/NRN.pdf...",
"\u26a0 Incomplete metadata"
],
"score": "1/2"
}
}
🔴 Knuth, D.E. (1984). Literate Programming. The Computer Journal, 27(2), 97-111.
- ⚠ Incomplete metadata
📋 Raw verification data
{
"citation": {
"raw": "Knuth, D.E. (1984). Literate Programming. The Computer Journal, 27(2), 97-111.",
"line_number": 11,
"metadata": {
"author": "Knuth, D.E.",
"year": "1984"
},
"identifiers": [],
"format": "apa"
},
"verification": {
"status": "unverified",
"checks": {},
"level": "\ud83d\udd34",
"messages": [
"\u26a0 Incomplete metadata"
],
"score": "0/1"
}
}
🔴 Mac Lane, S. (1971). Categories for the Working Mathematician. Springer.
- ⚠ Incomplete metadata
📋 Raw verification data
{
"citation": {
"raw": "Mac Lane, S. (1971). Categories for the Working Mathematician. Springer.",
"line_number": 13,
"metadata": {
"author": "Mac Lane, S.",
"year": "1971"
},
"identifiers": [],
"format": "partial"
},
"verification": {
"status": "unverified",
"checks": {},
"level": "\ud83d\udd34",
"messages": [
"\u26a0 Incomplete metadata"
],
"score": "0/1"
}
}
The Quantum/Simulation Connection
Simulation Without a Basement
If the universe is a context-accumulating DAG whose edges are free-energy transfers and whose nodes are resolved states, then there is no coherent contrast class "non-simulated reality" to oppose "simulation."
Bostrom/Musk-style arguments smuggle in a substrate that is somehow not computational. They end up asking whether we're in "base" or "derived" levels instead of noticing that once your ontology is purely process/computation, "base" stops doing work.
On this framing, "we are simulation" cashes out as "we are subgraphs in the only kind of structure that can support persistent, self-updating distinctions: a lazy, energy-constrained DAG."
Lazy Evaluation and Quantum Thunks
Treating the wavefunction as a thunk—code plus context describing all the ways resolution could go if forced—aligns with lazy evaluation: the universe never computes what is not causally required.
"Superposition" is not "the particle is in many states" but "there is a not-yet-forced description of how future nodes would look if this part of the graph were connected along various edges."
Quantum measurement as LOOKUP/FETCH: a new causal edge is drawn, the thunk is forced, a new node is written. State-update rules become graph-rewrite rules.
Measurement, Uncertainty, Entanglement as Graph Facts
Heisenberg uncertainty: constraint on partially forcing a thunk. Specifying one observable narrows which graph rewrites remain consistent; the complementary observable loses determinate status.
No fact before measurement: no node yet in the DAG. Collapse = when an interaction creates a stable node, that value becomes shared context for descendants.
Entanglement: not "instantaneous influences" but "multiple downstream paths querying the same upstream subgraph." Nonlocal correlations from shared ancestry, not superluminal signals.
Free Energy and Time
Friston: systems minimize free energy over time.
The move here: each LOOKUP-FETCH-SPLICE IS one tick. Time is the sequence of free-energy-reducing graph rewrites. No external clock.
Markov blankets become local graph cuts defining which edges carry surprise and which updates count as "inside."
Distance as Path Cost
Distance = ticks needed to route a free-energy gradient from here to there.
- Speed of light = upper bound on how fast free energy shuffles into new nodes
- Planck scale = lower bound on node granularity
Physics Citations
🟡 Friston, K. (2010). The free-energy principle: a unified brain theory? Nature Reviews Neuroscience, 11(2), 127-138. https://www.fil.ion.ucl.ac.uk/~karl/NRN.pdf
- ✓ URL accessible: https://www.fil.ion.ucl.ac.uk/~karl/NRN.pdf...
- ⚠ Incomplete metadata
📋 Raw verification data
{
"citation": {
"raw": "Friston, K. (2010). The free-energy principle: a unified brain theory? Nature Reviews Neuroscience, 11(2), 127-138. https://www.fil.ion.ucl.ac.uk/~karl/NRN.pdf",
"line_number": 1,
"metadata": {
"author": "Friston, K.",
"year": "2010"
},
"identifiers": [
{
"type": "url",
"value": "https://www.fil.ion.ucl.ac.uk/~karl/NRN.pdf"
}
],
"format": "apa"
},
"verification": {
"status": "basic",
"checks": {
"url_https://www.fil.ion.ucl.ac.uk/": {
"accessible": true,
"status_code": 200,
"content_type": "application/pdf"
}
},
"level": "\ud83d\udfe1",
"messages": [
"\u2713 URL accessible: https://www.fil.ion.ucl.ac.uk/~karl/NRN.pdf...",
"\u26a0 Incomplete metadata"
],
"score": "1/2"
}
}
🟡 Fuchs, C.A. (2017). On Participatory Realism. In Information and Interaction (pp. 113-134). Springer. https://arxiv.org/abs/1601.04360
- ✓ URL accessible: https://arxiv.org/abs/1601.04360...
- ⚠ Incomplete metadata
📋 Raw verification data
{
"citation": {
"raw": "Fuchs, C.A. (2017). On Participatory Realism. In Information and Interaction (pp. 113-134). Springer. https://arxiv.org/abs/1601.04360",
"line_number": 3,
"metadata": {
"author": "Fuchs, C.A.",
"year": "2017"
},
"identifiers": [
{
"type": "url",
"value": "https://arxiv.org/abs/1601.04360"
}
],
"format": "apa"
},
"verification": {
"status": "basic",
"checks": {
"url_https://arxiv.org/abs/1601.043": {
"accessible": true,
"status_code": 200,
"content_type": "text/html; charset=utf-8"
}
},
"level": "\ud83d\udfe1",
"messages": [
"\u2713 URL accessible: https://arxiv.org/abs/1601.04360...",
"\u26a0 Incomplete metadata"
],
"score": "1/2"
}
}
🔴 Wheeler, J.A. (1990). Information, Physics, Quantum: The Search for Links. In Complexity, Entropy, and the Physics of Information. Westview Press.
- ⚠ Incomplete metadata
📋 Raw verification data
{
"citation": {
"raw": "Wheeler, J.A. (1990). Information, Physics, Quantum: The Search for Links. In Complexity, Entropy, and the Physics of Information. Westview Press.",
"line_number": 5,
"metadata": {
"author": "Wheeler, J.A.",
"year": "1990"
},
"identifiers": [],
"format": "apa"
},
"verification": {
"status": "unverified",
"checks": {},
"level": "\ud83d\udd34",
"messages": [
"\u26a0 Incomplete metadata"
],
"score": "0/1"
}
}
🟡 Rovelli, C. (1996). Relational Quantum Mechanics. International Journal of Theoretical Physics, 35(8), 1637-1678. https://arxiv.org/abs/quant-ph/9609002
- ✓ URL accessible: https://arxiv.org/abs/quant-ph/9609002...
- ⚠ Incomplete metadata
📋 Raw verification data
{
"citation": {
"raw": "Rovelli, C. (1996). Relational Quantum Mechanics. International Journal of Theoretical Physics, 35(8), 1637-1678. https://arxiv.org/abs/quant-ph/9609002",
"line_number": 7,
"metadata": {
"author": "Rovelli, C.",
"year": "1996"
},
"identifiers": [
{
"type": "url",
"value": "https://arxiv.org/abs/quant-ph/9609002"
}
],
"format": "apa"
},
"verification": {
"status": "basic",
"checks": {
"url_https://arxiv.org/abs/quant-ph": {
"accessible": true,
"status_code": 200,
"content_type": "text/html; charset=utf-8"
}
},
"level": "\ud83d\udfe1",
"messages": [
"\u2713 URL accessible: https://arxiv.org/abs/quant-ph/9609002...",
"\u26a0 Incomplete metadata"
],
"score": "1/2"
}
}
🟢 Müller, M. (2020). Law without law: from observer states to physics via algorithmic information theory. Quantum, 4, 301. https://arxiv.org/abs/1712.01826
- ✓ URL accessible: https://arxiv.org/abs/1712.01826...
📋 Raw verification data
{
"citation": {
"raw": "M\u00fcller, M. (2020). Law without law: from observer states to physics via algorithmic information theory. Quantum, 4, 301. https://arxiv.org/abs/1712.01826",
"line_number": 9,
"metadata": {},
"identifiers": [
{
"type": "url",
"value": "https://arxiv.org/abs/1712.01826"
}
]
},
"verification": {
"status": "verified",
"checks": {
"url_https://arxiv.org/abs/1712.018": {
"accessible": true,
"status_code": 200,
"content_type": "text/html; charset=utf-8"
}
},
"level": "\ud83d\udfe2",
"messages": [
"\u2713 URL accessible: https://arxiv.org/abs/1712.01826..."
],
"score": "1/1"
}
}
Provenance
Document
- Status: 🔴 Unverified
Fences
wanderland-as-native-attention-citations-fence-0
- Status: 🔴 Unverified
wanderland-as-native-attention-physics-citations-fence-0
- Status: 🔴 Unverified
North
slots:
- slug: bidirectional-attention-thesis
context:
- Native attention implements the bidirectional attention thesisWest
slots:
- slug: universe-as-context-accumulating-dag
context:
- Same ontology, implementation perspectiveSouth
slots:
- slug: wanderland-paper
context:
- This is the theoretical framing for the paper