mirror of
https://github.com/allaunthefox/Research-Stack.git
synced 2026-07-31 03:05:21 +00:00
ingest: dair-ai Agentic Engineering Wiki (51 tips, 7 categories)
Cross-referenced against our prover orchestration layers: - Plan-Execute-Verify-Replan ↔ L0-L3 pipeline - Agents as specialists ↔ 11-agent swarm - Guardrails ↔ ProverWatchdog - Sandbox testing ↔ Virtual FPGA tests - Trajectory-aware eval ↔ BFS audit trail 5 gaps identified, 4 strengths confirmed
This commit is contained in:
Brandon Schneider
parent
af97d84573
commit
5ad2e7f8bb
81 changed files with 1477 additions and 86 deletions
143
4-Infrastructure/shim/ingest_dair_agentic_wiki.py
Normal file
143
4-Infrastructure/shim/ingest_dair_agentic_wiki.py
Normal file
|
|
@ -0,0 +1,143 @@
|
|||
#!/usr/bin/env python3
|
||||
"""Ingest dair-ai Agentic Engineering Wiki into Research Stack."""
|
||||
|
||||
import json, time, hashlib
|
||||
from pathlib import Path
|
||||
|
||||
RESEARCH_STACK = Path("/home/allaun/Documents/Research Stack")
|
||||
|
||||
WIKI = {
|
||||
"id": "dair-agentic-engineering-wiki",
|
||||
"source": "https://github.com/dair-ai/dair-workshops/tree/main/agentic-engineering-wiki",
|
||||
"title": "AI Agent Engineering Wiki — dair-ai",
|
||||
"date": "2026-04-29",
|
||||
"stats": {"tips": 51, "categories": 7, "companies": 9, "papers": 10, "tools": 14},
|
||||
"categories": {
|
||||
"tool_use": {
|
||||
"tips": 11,
|
||||
"key_insight": "Pre-filter tools to relevant subset per request; log agent intent to detect loops"
|
||||
},
|
||||
"evaluation": {
|
||||
"tips": 8,
|
||||
"key_insight": "Trajectory-aware eval (not just final output); repeat runs for reliability; behavioral rubrics for LLM-as-judge"
|
||||
},
|
||||
"prompting": {
|
||||
"tips": 6,
|
||||
"key_insight": "Five-layer system prompt anatomy; tool descriptions as engineering surface; instruction hierarchy defense (system > user > tool output)"
|
||||
},
|
||||
"orchestration": {
|
||||
"tips": 7,
|
||||
"key_insight": "Agents as MCP servers for composable multi-agent systems; Plan-Execute-Verify-Replan loop; handoffs with state transfer"
|
||||
},
|
||||
"memory": {
|
||||
"tips": 6,
|
||||
"key_insight": "Context management, RAG, state, conversation history"
|
||||
},
|
||||
"reliability": {
|
||||
"tips": 8,
|
||||
"key_insight": "Guardrails before risky ops; 'Lazy Agent' failure mode; restricted API keys; sandbox testing"
|
||||
},
|
||||
"deployment": {
|
||||
"tips": 5,
|
||||
"key_insight": "Cost tracking, sandbox execution, monitoring, observability"
|
||||
}
|
||||
},
|
||||
"orchestration_tips": [
|
||||
"Structure agents as specialists with explicit ownership via handoffs",
|
||||
"Leverage Google's ADK for interoperable agent orchestration across frameworks",
|
||||
"Use heterogeneous model teams — different models have different strengths",
|
||||
"Adopt Plan-Execute-Verify-Replan loop for complex multi-agent workflows",
|
||||
"Use handoffs for agent-to-agent delegation with state transfer",
|
||||
"Use built-in connector tools to reduce tool scaffolding overhead",
|
||||
"Represent agents as MCP servers — compose multi-agent systems over same protocol"
|
||||
],
|
||||
"reliability_tips": [
|
||||
"Add guardrails and human review before risky operations",
|
||||
"Encode persistence, risk assessment, and proactive planning in agent prompts",
|
||||
"Handle server tool pauses gracefully with pause_turn",
|
||||
"Watch for 'Lazy Agent' failure mode — model knows it needs tools but doesn't call them",
|
||||
"Don't use agents for problems with deterministic solutions — plain code still wins",
|
||||
"Use restricted API keys (rk_*) to limit agent blast radius",
|
||||
"Use tool_plan for explicit reasoning before acting",
|
||||
"Test agents in sandbox environments before production — non-determinism demands it"
|
||||
],
|
||||
"design_philosophy": [
|
||||
"Every claim links to a source. No unsupported advice.",
|
||||
"Speculation is clearly marked.",
|
||||
"Built for flexibility — new categories, companies, formats addable anytime.",
|
||||
"Community-first — pulled from real production experiences (HN, Reddit, postmortems)."
|
||||
],
|
||||
"relevance_to_research_stack": {
|
||||
"direct_matches": [
|
||||
"Prover orchestration layers (L0-L3) ↔ Plan-Execute-Verify-Replan loop",
|
||||
"Swarm consensus (11 agents) ↔ Agents as specialists with handoffs",
|
||||
"ProverWatchdog guard_transition ↔ Guardrails before risky ops",
|
||||
"Virtual FPGA system tests ↔ Sandbox testing before production",
|
||||
"BFS-Prover-V2 audit trail ↔ Trajectory-aware evaluation",
|
||||
"bf4prover manifold reshape ↔ Verify step in Plan-Execute-Verify-Replan"
|
||||
],
|
||||
"gaps_in_our_system": [
|
||||
"No restricted API key pattern for agent blast radius",
|
||||
"No explicit 'Lazy Agent' detection in swarm",
|
||||
"No heterogeneous model teams (all agents use same model)",
|
||||
"No cost tracking for orchestration layers",
|
||||
"No pause_turn equivalent for long-running proofs"
|
||||
],
|
||||
"strengths_of_our_system": [
|
||||
"Q16.16 fixed-point precision (wiki has no numerical guarantees)",
|
||||
"Hardware substrate integration (wiki is software-only)",
|
||||
"Formal proof backing (wiki relies on empirical testing)",
|
||||
"Topological manifold awareness (wiki has no geometric model)"
|
||||
]
|
||||
},
|
||||
"metadata": {
|
||||
"ingested_at": time.time(),
|
||||
"tags": ["agentic-engineering", "orchestration", "multi-agent", "reliability", "evaluation", "prompting"]
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
def ingest():
|
||||
germane_dir = RESEARCH_STACK / "shared-data/data/germane/research"
|
||||
germane_dir.mkdir(parents=True, exist_ok=True)
|
||||
|
||||
out_path = germane_dir / "dair_agentic_engineering_wiki.json"
|
||||
with open(out_path, 'w') as f:
|
||||
json.dump(WIKI, f, indent=2)
|
||||
|
||||
print(f"✓ Ingested: {out_path}")
|
||||
|
||||
# Update index
|
||||
index_path = germane_dir / "research_ingestion_index.json"
|
||||
index = []
|
||||
if index_path.exists():
|
||||
with open(index_path) as f:
|
||||
index = json.load(f)
|
||||
|
||||
index.append({
|
||||
"id": WIKI["id"], "title": WIKI["title"],
|
||||
"date": WIKI["date"], "source": WIKI["source"],
|
||||
"ingested_at": WIKI["metadata"]["ingested_at"],
|
||||
"tags": WIKI["metadata"]["tags"],
|
||||
})
|
||||
|
||||
with open(index_path, 'w') as f:
|
||||
json.dump(index, f, indent=2)
|
||||
|
||||
print(f"✓ Index: {len(index)} entries")
|
||||
|
||||
print(f"\nDirect matches to our system:")
|
||||
for m in WIKI["relevance_to_research_stack"]["direct_matches"]:
|
||||
print(f" ↔ {m}")
|
||||
|
||||
print(f"\nGaps identified:")
|
||||
for g in WIKI["relevance_to_research_stack"]["gaps_in_our_system"]:
|
||||
print(f" ⚠ {g}")
|
||||
|
||||
print(f"\nOur strengths:")
|
||||
for s in WIKI["relevance_to_research_stack"]["strengths_of_our_system"]:
|
||||
print(f" ✓ {s}")
|
||||
|
||||
|
||||
if __name__ == "__main__":
|
||||
ingest()
|
||||
|
|
@ -0,0 +1,9 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Math AMMR PDE
|
||||
title: AMMR Adaptive Meshless Methods
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! AMMR Adaptive Meshless Methods
|
||||
|
||||
Adaptive Meshless Methods Repository (`3-Mathematical-Models/AMMR/`) provides mesh-free PDE solving with formal Lean proofs (`AMMRLUT.lean`). Covers heat equation (2D), wave equation overhangs, and adaptive resolution refinement. The `WAVE_OVERHANGS_HEAT2D.md` cross-documents both solvers. Formal paper at `paper/AMMR.pdf`. Related to the [[Orthogonal AMMR]] Lean module and O-AMMR CRC pattern memory (`6-Documentation/docs/semantics/O_AMMR_CRC_PATTERN_MEMORY.md`). The adaptive meshless approach feeds into the [[Topological State Machine]] for geometric PDE evolution without grid constraints. Part of the layered mountain model (NUVMAP → AVMR → AMMR → O-AMMR → GCCL).
|
||||
|
|
@ -0,0 +1,14 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Hardware ASIC FPGA Semiconductor
|
||||
title: ASIC Topology
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! ASIC Topology
|
||||
|
||||
ASIC topology (`0-Core-Formalism/lean/Semantics/Semantics/ASICTopology.lean`) formalizes hardware layout as a topological routing problem. Defines die-level addressing, interconnect topology, and timing closure as manifold invariants. The ASIC nanokernel stream adapter (`5-Applications/scripts/asic_nanokernel_stream_adapter.py`) bridges the GCL nanokernel to ASIC streaming interfaces. FPGA implementations include the Tang Nano 9K AVM tester and Morphic Scalar FAMM in Verilog (`4-Infrastructure/hardware/verilog/morphic_scalar_famm.v`). The hardware extraction pipeline targets Gowin FPGA fabric via [[FPGA Warden]]. ASIC/FPGA co-design uses the blitter 6502 OISC architecture for minimal-instruction-set compression.
|
||||
|
||||
* [[FPGA Warden]]
|
||||
* [[GCL Nanokernel]]
|
||||
* [[HDMI Compute Fabric]]
|
||||
* [[Morphic DSP]]
|
||||
|
|
@ -0,0 +1,9 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Lean AVMR Vector Manifold
|
||||
title: AVMR Adaptive Vector Manifold Representation
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! AVMR Adaptive Vector Manifold Representation
|
||||
|
||||
AVMR (Adaptive Vector Manifold Representation) is a core mathematical framework formalized across 7 Lean modules: `AVMR.lean`, `AVMRCore.lean`, `AVMRClassification.lean`, `AVMRProofs.lean`, `AVMRTheorems.lean`, `AVMRInformation.lean`, `AVMRFrameworkMetaprobe.lean`. Provides vector manifold representation with adaptive dimensionality, classification into manifold types, formal proofs of representation theorems, and information-theoretic bounds. Used by the [[AMMR Adaptive Meshless Methods]] for meshless PDE solving, [[SLUQ Routing]] for quaternion manifold navigation, and the [[Equation Forest Index]] for semantic vector mapping. The paper source is at `6-Documentation/papers/braid-field-papers/papers/AVMR.tex`. Part of the layered mountain model.
|
||||
|
|
@ -0,0 +1,9 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Data Ingestion Pipeline
|
||||
title: Data Ingestion Pipeline
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Data Ingestion Pipeline
|
||||
|
||||
Multi-source data ingestion pipeline that feeds the Research Stack knowledge base. Scripts include: `5-Applications/scripts/ingest_chatgpt_session.mjs` (ChatGPT conversations), `ingest_research.js`, `md_to_jsonl_converter.py`, `strip_tags_to_raw.py`, `text_container_to_jsonl.py`. External connectors: Notion and Linear via `notion-native-tauri/` and `linear-native-tauri/` Rust applications, plus `dump_notion_full.js` and `dump_linear_full.js`. Language corpora via `download_multilingual_corpora.py`, CommonCrawl via `commoncrawl_waveprobe_ingestion.py`, ArXiv via `arxiv_miner.py`, and mathlib via `mathlib_ingestion_pipeline.py`. The ingest pipeline feeds into the [[ENE Wiki Layer]] for structured storage, the [[Swarm ENE Middleware]] for caching, and the [[Equation Forest Index]] for mathematical extraction. [[Mined Conversation Concepts]] and [[Full Chat Log Dumps]] provide the conversation mining surface.
|
||||
|
|
@ -0,0 +1,17 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Compression GCL Infrastructure
|
||||
title: Delta GCL Compression
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Delta GCL Compression
|
||||
|
||||
Delta GCL (General Compression Language) is the primary compression pipeline in the stack. Core components: `4-Infrastructure/infra/delta_gcl_compression_service.py`, `4-Infrastructure/infra/adaptive_delta_gcl.py`, `4-Infrastructure/infra/neural_delta_gcl_compressor.py`, `4-Infrastructure/infra/topological_storage_delta_gcl.py`. The pipeline: raw data → Metafoam compression → Delta GCL encoding → AES-256-GCM encryption → SQLite storage. Includes GCL sequence generation, manifest encoding, and RG-flow-lawful compression verification. The `DeltaGCLEncoder` produces compact GCL sequences that can be stored instead of full payloads (used by [[ENE API Hook]]). Related to the GCCL theory (ΔφγKλ compression law) and the genetic coding infrastructure.
|
||||
|
||||
!! Links
|
||||
|
||||
* [[ENE API Hook]]
|
||||
* [[Compression and Soliton Mining]]
|
||||
* [[Hutter Prize Compression]]
|
||||
* [[Genomic Data Compression Anchor]]
|
||||
* [[GCL Nanokernel]]
|
||||
|
|
@ -0,0 +1,17 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Infrastructure ENE Security
|
||||
title: ENE API Hook
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! ENE API Hook
|
||||
|
||||
The ENE API Hook (`4-Infrastructure/infra/ene_api.py`, 350 lines) provides AES-256-GCM encryption for all sensitive data, PBKDF2 key derivation from semantic manifold coordinates, access control with 4 clearance levels (PUBLIC/INTERNAL/RESTRICTED/SECRET), and SHA-256 integrity verification. Integrates Metafoam compression + Delta GCL encoding for stored payloads. The `ENESecurityManager` handles key management and `ENEAPIHook` exposes store/retrieve operations with full audit trails.
|
||||
|
||||
!! Links
|
||||
|
||||
* [[ENE Wiki Layer]]
|
||||
* [[Swarm ENE Middleware]]
|
||||
* [[Delta GCL Compression]]
|
||||
* [[Semantic Engine Binding Derivation]]
|
||||
* [[Concept Vector 14]]
|
||||
|
|
@ -0,0 +1,9 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Infrastructure Planning
|
||||
title: ENe Cognitive Refactor Plan
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! ENe Cognitive Refactor Plan
|
||||
|
||||
The ENE Cognitive Refactoring Plan (`4-Infrastructure/infra/ene_cognitive_refactor_plan.md`) is a 14-week implementation roadmap to integrate Cognitive Physics equations into the ENE infrastructure. Phases: (1) Instrumentation — ENELoadMonitor with 8-component load tracking, (2) Adaptive Cache — gap-based TTL replacing fixed expiry, (3) Semantic Compression — fidelity-gated Metafoam+GCL compression, (4) Prime Concept Vectors — learned 64×14 matrix replacing heuristic keyword vectors, (5) Security Invariants — severity-gated invariant checking, (6) HNSW + Shell Partition — O(log N) vector search + PIST-based page bucketing, (7) Extremophile Constraints + Multi-Language — constraint gating + language-aware compression. Full file map and guardrails included in the plan document.
|
||||
|
|
@ -0,0 +1,14 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Math Equations Forest Search
|
||||
title: Equation Forest Index
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Equation Forest Index
|
||||
|
||||
The Equation Forest is a structured index of mathematical equations discovered, extracted, and mapped across the research stack. Key files: `6-Documentation/docs/EQUATION_FOREST_INDEX.md` (master index), `6-Documentation/docs/FOREST_TOPOLOGY_MAP.md` (topological organization), and `5-Applications/scripts/generate_equation_forest.py` (generator). The forest organizes equations into families (chain, coupling, entropy, feedback, gradient, mass, scaling) with parquet-tagged clustering at `3-Mathematical-Models/equations_parquet_tagged/` (26 files). The `EquationForestActiveKernels.md` and `EquationForestGenome18Encoder.py` extend to genetic encoding of equation families. Searchable via [[HNSW Vector Search]] and the [[Semantic Graph Mining]] pipeline.
|
||||
|
||||
* [[HNSW Vector Search]]
|
||||
* [[Semantic Graph Mining]]
|
||||
* [[AVMR Adaptive Vector Manifold Representation]]
|
||||
* [[Canonical Formula Index]]
|
||||
|
|
@ -0,0 +1,9 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Biology Physics Constraints PDE
|
||||
title: Extremophile Constraint Layer
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Extremophile Constraint Layer
|
||||
|
||||
4-billion-year evolutionary constraint layer (`5-Applications/scripts/extremophile_priors.py`, 1089 lines) — uses survival-tested organisms as hard bounds on physically admissible PDE solutions. 12-tier unified check system (`DeepExtremophilePrior.unified_check()`). Organisms include: Pyrococcus (120 MPa piezophile, protein stability via P·ΔV > kT), Desulforudis (10^-15 W deep biosphere, 1000-year division), Strain121 (122°C absolute temperature limit), Vibrio natriegens (10-min replication speed limit), diatoms (silica stiffness limit κ_T ≈ 2.7×10^-11), Thermus aquaticus (Taq polymerase source, 50-80°C). Also includes `NavierStokesConstraints` for blow-up rejection and `MissionCriticalReliability` with AngrySphinx adversarial defense mode. Tested in `test_extremophile_constraints.py`. Wired into [[ENE API Hook]] per [[ENE Cognitive Refactor Plan]] Phase 7. Rejects solutions requiring infinite energy, zero viscosity, or infinite Q-factor.
|
||||
|
|
@ -0,0 +1,16 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Compression Manifold TSM
|
||||
title: FAMM Fast Approximate Manifold Map
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! FAMM Fast Approximate Manifold Map
|
||||
|
||||
FAMM (Fast Approximate Manifold Map) is the binary cache layer for topological state machines (TSM). Appears as `famm_bank.bin` files in multiple TSM caches: `3-Mathematical-Models/eigenvector_tsm/tsm_cache/famm_bank.bin`, `3-Mathematical-Models/hutter_eigenvector/tsm_cache/famm_bank.bin`, and Lean formalizations at `4-Infrastructure/hardware/verilog/morphic_scalar_famm.v`. Provides low-latency manifold lookup from pre-computed topological state transitions. Used by WaveProbe + FAMM pre-shaping (`4-Infrastructure/shim/waveprobe_manifold_famm_preshaper.py`). Integrates with the [[Topological State Machine]] and [[Waveprobe]] systems. Binary format optimized for FPGA/ASIC deployment.
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Topological State Machine]]
|
||||
* [[Waveprobe]]
|
||||
* [[Manifold Flow]]
|
||||
* [[FPGA Warden]]
|
||||
|
|
@ -0,0 +1,9 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Lean Topology Torus Compression
|
||||
title: FiveD Torus Topology
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! FiveD Torus Topology
|
||||
|
||||
5D torus topology formalized in `0-Core-Formalism/lean/Semantics/Semantics/FiveDTorusTopology.lean` — provides periodic boundary routing for distributed manifold computation. Each dimension has size k_i; torus distance is the sum of wrapped Manhattan distances. Each node has 10 neighbors (2 per dimension). Bisection bandwidth is the product of all but the largest dimension size. Used by [[Hybrid TSM PIST Torus]], [[Networked Self Solving Space]], and the [[Meta Manifold Language Merging]] framework. The Python script `5-Applications/scripts/five_d_torus_topology.py` provides runtime access. The hypertorus CAD model at `3-Mathematical-Models/cad_models/hypertorus_slice.scad` visualizes the 3D slice with φ-irrational rotation sampling. One of three pathological manifold structures for [[Hutter Prize Compression]].
|
||||
|
|
@ -0,0 +1,9 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Lean Q16_16 FixedPoint
|
||||
title: Fixed Point Algebra
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Fixed Point Algebra
|
||||
|
||||
Q16_16 fixed-point arithmetic formalized in `0-Core-Formalism/lean/Semantics/Semantics/FixedPoint.lean` — provides 16-bit integer + 16-bit fractional representation with formal proofs of algebraic properties. All physics computations in the stack use Q16_16 (per AGENTS.md §1.4). Includes arithmetic operations (add, sub, mul, div), comparison operators, conversion to/from floats, and formal theorems proving non-overflow bounds, associativity, and distributivity. The `FixedPointBridge.lean` connects Q16_16 to hardware extraction targets. Q32_32 variant under development with formal verification tools (`4-Infrastructure/shim/use_provers_to_fix_q32_32.py`). Related to the [[Lean Semantics Overview]] and hardware extraction pipeline.
|
||||
|
|
@ -0,0 +1,16 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Infrastructure NanoKernel Compression
|
||||
title: GCL Nanokernel
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! GCL Nanokernel
|
||||
|
||||
The GCL-based nanokernel (`4-Infrastructure/nano-kernel/`) provides a self-hosting execution environment for compression operations. Features include: GCL-native instruction set, self-hosting toolchain, socket server for inter-process communication, kexec-based boot chain, and neuromorphic kernel primitives. Integrates with the ASIC nanokernel stream adapter (`5-Applications/scripts/asic_nanokernel_stream_adapter.py`) and the nanocartridge UART stack. Designed to run compression/decompression at the hardware level with minimal overhead. The architecture supports hot-swap cartridge loading and voltage-computational substrate integration.
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Delta GCL Compression]]
|
||||
* [[FPGA Warden]]
|
||||
* [[HDMI Compute Fabric]]
|
||||
* [[Compression and Soliton Mining]]
|
||||
|
|
@ -0,0 +1,9 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Biology Genetics Compression Codon
|
||||
title: Genetic Code Pipeline
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Genetic Code Pipeline
|
||||
|
||||
The genetic code and codon-based compression pipeline spans the stack. Lean formalizations include `GeneticCode.lean`, `Codons.lean`, `CodonOTOM.lean`, `CodonPeptideConsistency.lean`, and `GeneBytecodeJIT.lean` (just-in-time bytecode generation from genetic sequences). Python tools at `0-Core-Formalism/otom/tools/genetics/` (selection_metrics.py, emit_selection_receipt.py). Integration scripts: `5-Applications/scripts/codon_peptide_pipeline.py`, `5-Applications/scripts/rna_to_peptide_shifter.py`. The codon RL pipeline (`6-Documentation/docs/codon_rl_v2_summary.md`) uses reinforcement learning for codon optimization. [[Hachimoji Pipeline]] adds 8-letter genetic alphabet encoding. The [[Genome18]] module provides 18-gene model families. Genetic ground-up testing at `Testing/GeneticGroundUpTest.lean`. Links to [[Hutter Prize Compression]] via genetic compression strategies.
|
||||
|
|
@ -0,0 +1,9 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Lean Math Encoding Geometry
|
||||
title: Golden Angle Encoding
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Golden Angle Encoding
|
||||
|
||||
Golden angle (φ ≈ 137.5°) encoding uses irrational rotations for non-repeating coordinate systems. Lean modules: `GoldenAngleEncoding.lean`, `GoldenSpiralManifold.lean`, `GoldenSpiralNavigation.lean`. The golden angle ensures that no two positions ever exactly repeat, providing optimal packing in angular coordinates — used by phyllotaxis (plant leaf arrangement) and the [[Gray-Code Golden-Spiral Fold]] for spiral-based compression. Python: `5-Applications/scripts/golden_spiral_navigation.py`. Connected to [[Phi Shell Encoding]] and [[Phinary Number System]] for φ-based mathematical representations. The golden spiral manifold provides dense traversal of 2D/3D coordinate spaces without collision.
|
||||
|
|
@ -1,23 +1,14 @@
|
|||
created: 20260506134500000
|
||||
modified: 20260506134500000
|
||||
tags: ResearchStack Hardware Display Candidate
|
||||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Hardware HDMI GPU Compute
|
||||
title: HDMI Compute Fabric
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! HDMI Compute Fabric
|
||||
|
||||
Candidate surface where display timing, raster cells, and HDMI/DVI-style
|
||||
transport become a deterministic compute or witness fabric rather than only a
|
||||
video path.
|
||||
|
||||
!! Links
|
||||
The HDMI compute fabric (`5-Applications/scripts/hdmi_computational_shell.py`) turns display interfaces into general-purpose computation channels. Includes `score_route_damage` for damage scoring along routes, DSB cluster detection for broken invariant grouping, and the computational shell architecture that treats HDMI as a data bus. Integrates with [[FPGA Warden]] for hardware-level compute offload and the [[Virtual Display Blitter Compute Surface]] for blitter-based rendering computation. Part of the broader hardware-as-compute strategy alongside DisplayPort computational controller (`5-Applications/scripts/displayport_computational.py`), voltage computational substrate, and PCIe computational controller. This strategy treats every physical interface as a computational resource.
|
||||
|
||||
* [[FPGA Warden]]
|
||||
* [[Morphic DSP]]
|
||||
* [[Semantic Graph Mining]]
|
||||
* [[Materials and Hardware Mining]]
|
||||
|
||||
!! Durable Sources
|
||||
|
||||
* `../docs/WEIRD_CONCEPTS_GLOSSARY.md`
|
||||
* `../../5-Applications/scripts/hdmi_computational_shell.py`
|
||||
* [[Virtual Display Blitter Compute Surface]]
|
||||
* [[ASIC Topology]]
|
||||
* [[Motherboard Computational Substrate]]
|
||||
|
|
|
|||
|
|
@ -0,0 +1,16 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Search ANN Vector Compression
|
||||
title: HNSW Vector Search
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! HNSW Vector Search
|
||||
|
||||
Planned HNSW (Hierarchical Navigable Small World) upgrade for the semantic search pipeline. Currently [[Swarm ENE Middleware]] uses O(N) brute-force cosine similarity over the `swarm_semantic_index` table. HNSW provides O(log N) approximate nearest neighbor search with M=16 max connections, ef_construction=200, using cosine distance. Will index all 14D concept vectors from cached queries. Cold-start fallback to brute force. Target: <1ms search on 10k+ vectors with >95% recall at k=10. Referenced in the [[ENE Cognitive Refactor Plan]], Phase 6. Also underpins the [[Semantic Graph Mining]] pipeline and [[Equation Forest Index]] retrieval.
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Swarm ENE Middleware]]
|
||||
* [[Concept Vector 14]]
|
||||
* [[Semantic Graph Mining]]
|
||||
* [[Equation Forest Index]]
|
||||
|
|
@ -0,0 +1,9 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Biology Genetics Compression Codon
|
||||
title: Hachimoji Pipeline
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Hachimoji Pipeline
|
||||
|
||||
Hachimoji (8-letter) genetic alphabet pipeline extends standard 4-letter DNA encoding to 8 nucleotides (4 natural + 4 synthetic), doubling information density per base. Lean modules: `HachimojiPipeline.lean`, `HachimojiCostRefinement.lean`, `HachimojiEquationMetaprobe.lean`. Provides cost-refined encoding and equation-level metaprobe validation. Referenced in [[Hutter Prize ISA]] as opcode 0x0E (`hachimojiEncode`) and the `HutterGeometricParameters` structure. Used by the [[Genetic Code Pipeline]] for high-density storage and the [[Synthetic Genetic Coding]] framework. The 8-letter encoding maps to geometric compression primitives (throatSurface, basePairEnergy opcodes).
|
||||
|
|
@ -0,0 +1,9 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Compression Hutter ISA Hardware
|
||||
title: Hutter Prize ISA
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Hutter Prize ISA
|
||||
|
||||
Hutter Prize ISA (`0-Core-Formalism/lean/Semantics/Semantics/HutterPrizeISA.lean`) — an instruction set architecture specifically optimized for Hutter Prize compression. 15 opcodes spanning: Gabor bifurcation, spectral transform, soliton box, fractal seed, Jupiter residual, φ-ratio summation (using pandigital π + golden φ), adaptive thresholding, entropy encoding, manifold decoding, hachimoji encoding (8-letter genetic alphabet), anisotropic mapping, codon LUT, throat surface (horn geometry), and base pair energy. 128-bit register layout (64+32+16+16). Target: beat the 11.4% record (114MB/1GB) on enwik9. Analyzed via `runHutterSwarmAnalysis()` with opcode utilization and register efficiency metrics.
|
||||
|
|
@ -0,0 +1,84 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Conversations Index
|
||||
title: Kimi Conversations
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi Conversations
|
||||
|
||||
Master index of 38 Kimi AI conversation dumps, organized by topic. These are conversation histories exported from Kimi (kimi.moonshot.cn) covering the Research Stack's development across multiple domains. Source directory: `/home/allaun/Documents/ingest/Kimi-*.json`.
|
||||
|
||||
!! Architecture & Infrastructure
|
||||
|
||||
* [[Kimi-Install Multi-Agent Orchestration]]
|
||||
* [[Kimi-GitHub Repo Review]]
|
||||
* [[Kimi-Project Issue Update]]
|
||||
|
||||
!! Lean & Formal Math
|
||||
|
||||
* [[Kimi-Lean Proof Completion]]
|
||||
* [[Kimi-Math Notation Extraction]]
|
||||
* [[Kimi-Math Queries]]
|
||||
* [[Kimi-Cross Domain Math Analysis]]
|
||||
* [[Kimi-Universal Cross-Domain Math]]
|
||||
* [[Kimi-Review of Your Formula]]
|
||||
|
||||
!! Equation Derivation
|
||||
|
||||
* [[Kimi-Attention Center Equation Derivation]]
|
||||
* [[Kimi-N-Body Thermodynamic Equation]]
|
||||
* [[Kimi-Equation Derivation from Zenodo]]
|
||||
* [[Kimi-Spacetime from Fundamental Forces]]
|
||||
|
||||
!! Topology & Manifolds
|
||||
|
||||
* [[Kimi-Ontological Manifold Theory Overview]]
|
||||
* [[Kimi-Topological Genome Tractability Pipeline]]
|
||||
* [[Kimi-GraphML Manifold Model Improvement]]
|
||||
* [[Kimi-Attention-Driven Canonical Action]]
|
||||
|
||||
!! Biology & Genetics
|
||||
|
||||
* [[Kimi-Hachimoji DNA RNA Spectrum]]
|
||||
* [[Kimi-DNA Computing Options]]
|
||||
* [[Kimi-Protein Geometry and N-Fold]]
|
||||
* [[Kimi-Protein Structures and Invariant Roots]]
|
||||
* [[Kimi-Carbon-11 Eta Prime State]]
|
||||
* [[Kimi-N-State Models for Organic Systems]]
|
||||
|
||||
!! Hardware & Physics
|
||||
|
||||
* [[Kimi-Tiny Tapeout Cost and Core]]
|
||||
* [[Kimi-θ-TaN Thermal Model]]
|
||||
* [[Kimi-Emergent Stability Power Networks]]
|
||||
|
||||
!! Review & Audit
|
||||
|
||||
* [[Kimi-Framework Re-Review]]
|
||||
* [[Kimi-Multi-Expert OMTI Review]]
|
||||
* [[Kimi-Theory Cleanup via Review]]
|
||||
* [[Kimi-Spec 250 Equation Rigor]]
|
||||
* [[Kimi-review stablity]]
|
||||
|
||||
!! Unsolved & Speculative
|
||||
|
||||
* [[Kimi-Unsolved Geometry Problems]]
|
||||
* [[Kimi-Algebraic Bracket Chat Room]]
|
||||
* [[Kimi-PBACS Final Version]]
|
||||
|
||||
!! Multi-Language
|
||||
|
||||
* [[Kimi-ISO Language Comparison]]
|
||||
* [[Kimi-Model Indexing and Equation Run]]
|
||||
|
||||
!! 中文 (Chinese)
|
||||
|
||||
* [[Kimi-四力几何推导]]
|
||||
* [[Kimi-多代理协作探不变方程]]
|
||||
|
||||
!! Related
|
||||
|
||||
* [[Conversation Mining Source Map]]
|
||||
* [[Mined Conversation Concepts]]
|
||||
* [[Full Chat Log Dumps]]
|
||||
* [[Kimi-More Conversations]]
|
||||
|
|
@ -0,0 +1,19 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Algebra Notation
|
||||
title: Kimi-Algebraic Bracket Chat Room
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Algebraic Bracket Chat Room
|
||||
|
||||
Kimi conversation exploring the idea of proposing refinements to algebraic bracket notation through math chat rooms and discussion communities. Discussed how mathematical notation evolves through consensus and whether there are formal venues for notational proposals.
|
||||
|
||||
* Source file: `ingest/Kimi-Algebraic_Bracket_Chat_Room.json` (364 KB, 92 messages)
|
||||
* First query: "is there a math chat room i can suggest a refinement to algebraic brackets?"
|
||||
|
||||
Covers: algebraic notation, bracket systems, math community discussion venues, notation refinement proposals.
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-Math Notation Extraction]]
|
||||
|
|
@ -0,0 +1,19 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi EquationDerivation AttentionMechanism
|
||||
title: Kimi-Attention Center Equation Derivation
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Attention Center Equation Derivation
|
||||
|
||||
Kimi conversation exploring the derivation of equations that describe attention mechanism centers. The session searched for papers related to attention mechanisms since 2020 using academic data sources.
|
||||
|
||||
* Source file: `ingest/Kimi-Attention_Center_Equation_Derivation.json` (1190 KB, 60 messages)
|
||||
* First query: "try to find the equation that describes the center in this. Search for papers related to the attention mechanism since 2020. Use some academic data"
|
||||
|
||||
Covers: attention mechanism mathematics, center-of-attention equation derivation, literature review of post-2020 attention papers.
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Attention-Driven Canonical Action]]
|
||||
|
|
@ -0,0 +1,18 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Attention CanonicalAction
|
||||
title: Kimi-Attention-Driven Canonical Action
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Attention-Driven Canonical Action
|
||||
|
||||
Kimi conversation about attention-driven canonical action formalism: Attn(c | σ) as a triage score over convergence/contradiction/degraded-state penalty, and C*(x, σ) as the original canonical action. Explored decision-theoretic formalisms for attention-based action selection.
|
||||
|
||||
* Source file: `ingest/Kimi-Attention-Driven_Canonical_Action.json` (4 KB)
|
||||
* First query: provided formal definitions for Attn(c|σ) and C*(x, σ) attention/canonical action framework
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-Attention Center Equation Derivation]]
|
||||
* [[Semantic Engine Binding Derivation]]
|
||||
|
|
@ -0,0 +1,17 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Physics Nuclear Carbon11
|
||||
title: Kimi-Carbon-11 Eta Prime State
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Carbon-11 Eta Prime State
|
||||
|
||||
Kimi conversation attempting to locate a paper about physicists detecting an elusive nuclear state — the Carbon-11 eta prime mesic nucleus. Nuclear physics research tracking a specific detection paper.
|
||||
|
||||
* Source file: `ingest/Kimi-Carbon-11_Eta_Prime_State.json` (2 KB)
|
||||
* First query: "Physicists Detect Elusive Nuclear State trying to find this paper"
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Mass Number Theory]]
|
||||
|
|
@ -0,0 +1,17 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Math CrossDomain Resume
|
||||
title: Kimi-Cross Domain Math Analysis
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Cross Domain Math Analysis
|
||||
|
||||
Kimi conversation resuming an ongoing cross-domain mathematical analysis. A continuation session picking up from prior math exploration work across domains.
|
||||
|
||||
* Source file: `ingest/Kimi-Cross_Domain_Math_Analysis.json` (7 KB)
|
||||
* First query: "resume"
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-Universal Cross-Domain Math]]
|
||||
|
|
@ -0,0 +1,20 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi DNA Computing Biology
|
||||
title: Kimi-DNA Computing Options
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-DNA Computing Options
|
||||
|
||||
Kimi conversation researching the entire history of DNA computation and its current state. Explored off-the-shelf options, historical development, and current capabilities of DNA-based computing.
|
||||
|
||||
* Source file: `ingest/Kimi-DNA_Computing_Off‑Shelf_Options.json` (60 KB)
|
||||
* First query: "now, use this to research the entire history of dna computation and its current state"
|
||||
|
||||
Covers: DNA computing history, off-the-shelf DNA computing options, synthetic biology computing.
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-Hachimoji DNA RNA Spectrum]]
|
||||
* [[Synthetic Genetic Coding]]
|
||||
|
|
@ -0,0 +1,17 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi PowerNetworks Stability Emergence
|
||||
title: Kimi-Emergent Stability Power Networks
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Emergent Stability Power Networks
|
||||
|
||||
Kimi conversation extending network topology analysis to power distribution, particularly in unplanned locations like India. Explored global, local, and maximum/minima approaches to emergent stability in chaotic power networks.
|
||||
|
||||
* Source file: `ingest/Kimi-Emergent_Stability_in_Chaotic_Power_Networks.json` (2 KB)
|
||||
* First query: "now that we have that basis, lets extend it with the global local and maximum minima ala network topologies and power network distribution, especially in unplanned locations such as india"
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[FiveD Torus Topology]]
|
||||
|
|
@ -0,0 +1,17 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi EquationDerivation Zenodo
|
||||
title: Kimi-Equation Derivation from Zenodo
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Equation Derivation from Zenodo
|
||||
|
||||
Kimi conversation deriving a provable equation from a Zenodo record (https://zenodo.org/records/19645628). Focused on rigorous mathematical derivation from published research materials.
|
||||
|
||||
* Source file: `ingest/Kimi-Equation_Derivation_from_Zenodo.json` (9 KB)
|
||||
* First query: "derive the provable equation from this [Zenodo link]"
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-Attention Center Equation Derivation]]
|
||||
|
|
@ -0,0 +1,18 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Framework Review Verification
|
||||
title: Kimi-Framework Re-Review
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Framework Re-Review
|
||||
|
||||
Kimi conversation providing a rigorous mathematical verification framework: "Constrained Emergent Geometric Field via Lookup Table." A detailed mathematical re-review session examining the verification framework's logical structure and constraints.
|
||||
|
||||
* Source file: `ingest/Kimi-Framework_Re-Review.json` (31 KB)
|
||||
* First query: provided "Rigorous Mathematical Verification Framework — Constrained Emergent Geometric Field via Lookup Table" document
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-Theory Cleanup via Review]]
|
||||
* [[Kimi-Multi-Expert OMTI Review]]
|
||||
|
|
@ -0,0 +1,20 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi GitHub Infrastructure RepoReview
|
||||
title: Kimi-GitHub Repo Review
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-GitHub Repo Review
|
||||
|
||||
Kimi conversation reviewing multiple GitHub repositories in the Research Stack ecosystem: Ontological-Manifold-Theory-Implementation, Research-Stack, braid-field-papers, and others. Cross-repository audit and review session.
|
||||
|
||||
* Source file: `ingest/Kimi-GitHub_Repo_Review.json` (71 KB)
|
||||
* First query: review links to allaunthefox GitHub repositories (OMTI, Research-Stack, braid-field-papers, etc.)
|
||||
|
||||
Covers: GitHub repository review, cross-repo audit, Research Stack codebase review.
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-Project Issue Update]]
|
||||
* [[Research Stack Architecture]]
|
||||
|
|
@ -0,0 +1,18 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi GraphML Manifolds Indexing
|
||||
title: Kimi-GraphML Manifold Model Improvement
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-GraphML Manifold Model Improvement
|
||||
|
||||
Kimi conversation assigning a swarm to create a unifying index of manifold model information in GraphML format. Explored graph-based representation and indexing strategies for manifold data.
|
||||
|
||||
* Source file: `ingest/Kimi-GraphML_Manifold_Model_Improvement.json` (2 KB)
|
||||
* First query: "assign the swarm to create a unifying index of this information in graphml"
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-Math Queries]]
|
||||
* [[Equation Forest Index]]
|
||||
|
|
@ -0,0 +1,18 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi DNA Genetics SyntheticBiology
|
||||
title: Kimi-Hachimoji DNA RNA Spectrum
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Hachimoji DNA RNA Spectrum
|
||||
|
||||
Kimi conversation researching Hachimoji synthetic DNA and RNA. Explored the expanded genetic alphabet (8-letter hachimoji system) and its spectral properties, potential applications in synthetic biology and information storage.
|
||||
|
||||
* Source file: `ingest/Kimi-Hachimoji_DNA_RNA_Spectrum.json` (29 KB)
|
||||
* First query: "ok, lets do something, look up hachimoji Synthetic DNA and RNA"
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Hachimoji Pipeline]]
|
||||
* [[Kimi-DNA Computing Options]]
|
||||
|
|
@ -0,0 +1,16 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Languages ISO Linguistics
|
||||
title: Kimi-ISO Language Comparison
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-ISO Language Comparison
|
||||
|
||||
Kimi conversation comparing every fully-documented language against ISO standards to find the invariant root common to all languages. A large-scale linguistic analysis session seeking core conceptual primitives shared across human languages.
|
||||
|
||||
* Source file: `ingest/Kimi-ISO_Language_Comparison.json` (34 KB)
|
||||
* First query: "find every language that has a full documentation set and compare them to verified languages in the ISO standards, the idea is to find the invariant root of all the languages together"
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
|
|
@ -0,0 +1,20 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Infrastructure MultiAgent Orchestration
|
||||
title: Kimi-Install Multi-Agent Orchestration
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Install Multi-Agent Orchestration
|
||||
|
||||
Kimi conversation about installing and setting up a lightweight multi-agent orchestration system based on the approach from juanpabloaj.com/2026/04/16 for making agents talk without paying for API usage. Focused on practical deployment of agent communication infrastructure.
|
||||
|
||||
* Source file: `ingest/Kimi-Install_Multi-Agent_Orchestration.json` (56 KB)
|
||||
* First query: "https://juanpabloaj.com/2026/04/16/a-lightweight-way-to-make-agents-talk-without-paying-for-api-usage/ lets set this up"
|
||||
|
||||
Covers: multi-agent orchestration setup, zero-cost agent communication, lightweight agent infrastructure.
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-Multi-Expert OMTI Review]]
|
||||
* [[Swarm ENE Middleware]]
|
||||
|
|
@ -0,0 +1,19 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Lean FormalMath ProofAssistant
|
||||
title: Kimi-Lean Proof Completion
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Lean Proof Completion
|
||||
|
||||
Kimi conversation focused on firming up and repairing a Lean proof in a single session. Short but dense conversation involving Lean proof assistant work.
|
||||
|
||||
* Source file: `ingest/Kimi-Lean_Proof_Completion.json` (99 KB, 8 messages)
|
||||
* First query: "this needs a firming up and repair in the same go"
|
||||
|
||||
Covers: Lean proof assistant, proof completion, formal verification, proof repair.
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Lean Semantics Overview]]
|
||||
|
|
@ -0,0 +1,18 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Math Notation Extraction
|
||||
title: Kimi-Math Notation Extraction
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Math Notation Extraction
|
||||
|
||||
Kimi conversation extracting complete mathematical theorems from research materials. Focused on notation extraction, theorem identification, and formalization of mathematical content.
|
||||
|
||||
* Source file: `ingest/Kimi-Math_Notation_Extraction.json` (27 KB)
|
||||
* First query: "look for the complete math theorems from this"
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-Lean Proof Completion]]
|
||||
* [[Kimi-Algebraic Bracket Chat Room]]
|
||||
|
|
@ -0,0 +1,20 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Math GraphML
|
||||
title: Kimi-Math Queries
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Math Queries
|
||||
|
||||
Kimi conversation about parsing mathematical content and updating GraphML representations. Involved structured extraction of math from research materials and representation in graph format.
|
||||
|
||||
* Source file: `ingest/Kimi-Math_Queries.json` (140 KB, 100 messages)
|
||||
* First query: "parse this and update the graphml"
|
||||
|
||||
Covers: math parsing, GraphML updates, structured math extraction, graph representation of equations.
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-GraphML Manifold Model Improvement]]
|
||||
* [[Equation Forest Index]]
|
||||
|
|
@ -0,0 +1,18 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Indexing Model Equations
|
||||
title: Kimi-Model Indexing and Equation Run
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Model Indexing and Equation Run
|
||||
|
||||
Kimi conversation indexing an entire model's revision history and running/re-verifying all equations. The latest revision appeared at the bottom of the conversation, with the full history needing systematic indexing.
|
||||
|
||||
* Source file: `ingest/Kimi-Model_Indexing_&_Equation_Run.json` (8 KB)
|
||||
* First query: "the latest revision of my model is at the bottom, but the entire thing needs indexing"
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-Math Queries]]
|
||||
* [[Equation Forest Index]]
|
||||
|
|
@ -0,0 +1,37 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Conversations Index
|
||||
title: Kimi-More Conversations
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-More Conversations
|
||||
|
||||
Additional Kimi conversations cataloged but with individual tiddlers pending detailed writeup.
|
||||
|
||||
* [[Kimi-review stablity]] — Stability review session (5 KB)
|
||||
* [[Kimi-Hachimoji DNA RNA Spectrum]] — Hachimoji synthetic DNA/RNA exploration (29 KB)
|
||||
* [[Kimi-Equation Derivation from Zenodo]] — Equation derivation from Zenodo record (9 KB)
|
||||
* [[Kimi-Framework Re-Review]] — Rigorous mathematical verification framework re-review (31 KB)
|
||||
* [[Kimi-GraphML Manifold Model Improvement]] — Swarm-created GraphML manifold index (2 KB)
|
||||
* [[Kimi-ISO Language Comparison]] — Cross-language invariant root analysis via ISO standards (34 KB)
|
||||
* [[Kimi-Math Notation Extraction]] — Complete mathematical theorem extraction (27 KB)
|
||||
* [[Kimi-Model Indexing and Equation Run]] — Model revision indexing and equation verification (8 KB)
|
||||
* [[Kimi-Cross Domain Math Analysis]] — Resumed cross-domain math analysis (7 KB)
|
||||
* [[Kimi-Review of Your Formula]] — In-development formula review (29 KB)
|
||||
* [[Kimi-Project Issue Update]] — GitHub issue status tracking and fixes (32 KB)
|
||||
* [[Kimi-Spacetime from Fundamental Forces]] — Emergent spacetime from 4 fundamental forces (4 KB)
|
||||
* [[Kimi-Spec 250 Equation Rigor]] — Core Spec 250 equation verification (25 KB)
|
||||
* [[Kimi-PBACS Final Version]] — Final version of PBACS (4 KB)
|
||||
* [[Kimi-Protein Geometry and N-Fold]] — Protein structure to geometric language mapping (2 KB)
|
||||
* [[Kimi-Protein Structures and Invariant Roots]] — Protein invariant root derivation (2 KB)
|
||||
* [[Kimi-Carbon-11 Eta Prime State]] — Elusive nuclear state paper search (2 KB)
|
||||
* [[Kimi-N-State Models for Organic Systems]] — Organic entity information exchange models (2 KB)
|
||||
* [[Kimi-Emergent Stability Power Networks]] — Power network stability via topology (2 KB)
|
||||
* [[Kimi-Universal Cross-Domain Math]] — Universal cross-domain math survey (2 KB)
|
||||
* [[Kimi-Attention-Driven Canonical Action]] — Attention-driven canonical action formalism (4 KB)
|
||||
* [[Kimi-四力几何推导]] — 中文: 四大基本力几何推导 (13 KB)
|
||||
* [[Kimi-多代理协作探不变方程]] — 中文: 多代理协作探索不变方程 (10 KB)
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
|
|
@ -0,0 +1,21 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi OMTI Review MultiAgent Swarm
|
||||
title: Kimi-Multi-Expert OMTI Review
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Multi-Expert OMTI Review
|
||||
|
||||
Kimi conversation coordinating a maximum-size agent swarm via workspace/blackboard to review the OMTI paper. Agents were configured not to trust each other, themselves, or the data — only accepting conclusions backed by mathematical proof. Goal: firm up the paper through adversarial multi-expert review.
|
||||
|
||||
* Source file: `ingest/Kimi-Multi-Expert_OMTI_Review.json` (85 KB, 100 messages)
|
||||
* First query: "assign the maximum amount of agents in a swarm to coordinate via workspace/blackboard, they do not believe each other, themselves or the data they review but they do after they find the math that proves their choices. the goal is firm up the paper"
|
||||
|
||||
Covers: multi-agent orchestration, adversarial expert review, blackboard architecture, OMTI paper verification.
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-Ontological Manifold Theory Overview]]
|
||||
* [[Kimi-Theory Cleanup via Review]]
|
||||
* [[Kimi-Framework Re-Review]]
|
||||
|
|
@ -0,0 +1,20 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Thermodynamics EquationDerivation NBody
|
||||
title: Kimi-N-Body Thermodynamic Equation
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-N-Body Thermodynamic Equation
|
||||
|
||||
Kimi conversation deriving the core equation for an N-body thermodynamic system. Focused on identifying and formalizing the central equation governing multi-body thermal dynamics.
|
||||
|
||||
* Source file: `ingest/Kimi-N-Body_Thermodynamic_Equation.json` (91 KB, 100 messages)
|
||||
* First query: "what is the core equation after that"
|
||||
|
||||
Covers: N-body thermodynamics, core equation derivation, multi-body thermal systems, thermodynamic invariants.
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-Attention Center Equation Derivation]]
|
||||
* [[Thermodynamic Trinary Watchdog PLC]]
|
||||
|
|
@ -0,0 +1,17 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi OrganicSystems Emergence InformationExchange
|
||||
title: Kimi-N-State Models for Organic Systems
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-N-State Models for Organic Systems
|
||||
|
||||
Kimi conversation gathering documentation on information exchange in organic entities — DNA, insects, swarms, emergent cooperative behavior, botnets, unplanned synchronicity, and related phenomena. Explored N-state models for modeling organic information flow.
|
||||
|
||||
* Source file: `ingest/Kimi-N-State_Models_for_Organic_Systems.json` (2 KB)
|
||||
* First query: "i need documentation on information exchange in organic entities, such as dna, bugs, swarms, emergent cooperative behavior, botnets, unplanned synchronicity etc"
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-DNA Computing Options]]
|
||||
|
|
@ -0,0 +1,21 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi OMTI Manifolds Topology
|
||||
title: Kimi-Ontological Manifold Theory Overview
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Ontological Manifold Theory Overview
|
||||
|
||||
Kimi conversation deploying agents to find flaws in the Ontological Manifold Theory Implementation (OMTI) results and suggest fixes. A multi-agent review session aimed at rigorous verification of the theory.
|
||||
|
||||
* Source file: `ingest/Kimi-Ontological_Manifold_Theory_Overview.json` (186 KB, 98 messages)
|
||||
* First query: "deploy agents to find flaws in the results and suggest fixes"
|
||||
|
||||
Covers: Ontological Manifold Theory overview, agent-based review, flaw detection, theory verification.
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-Multi-Expert OMTI Review]]
|
||||
* [[Kimi-Unsolved Geometry Problems]]
|
||||
* [[Research Stack Architecture]]
|
||||
|
|
@ -0,0 +1,16 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi PBACS FinalVersion
|
||||
title: Kimi-PBACS Final Version
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-PBACS Final Version
|
||||
|
||||
Kimi conversation attempting to obtain the final version of PBACS (Position-Based Asynchronous Consensus System or similar). A targeted session aimed at producing a definitive version.
|
||||
|
||||
* Source file: `ingest/Kimi-PBACS_Final_Version.json` (4 KB)
|
||||
* First query: "trying to get the final version of this"
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
|
|
@ -0,0 +1,18 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi GitHub Issues ProjectManagement
|
||||
title: Kimi-Project Issue Update
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Project Issue Update
|
||||
|
||||
Kimi conversation reviewing and updating GitHub project issues. Tracked issue statuses and fix applications across the Research Stack repositories, serving as a project management checkpoint.
|
||||
|
||||
* Source file: `ingest/Kimi-Project_Issue_Update.json` (32 KB)
|
||||
* First query: provided a table of issues with status and fix columns
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-GitHub Repo Review]]
|
||||
* [[Research Stack Architecture]]
|
||||
|
|
@ -0,0 +1,18 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Proteins Geometry NFold Mechanics
|
||||
title: Kimi-Protein Geometry and N-Fold
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Protein Geometry and N-Fold
|
||||
|
||||
Kimi conversation gathering comprehensive data on protein structures and N-fold mechanics, attempting to map them to a geometric first language. Aims to derive physical invariant roots from protein folding geometry and structural mechanics.
|
||||
|
||||
* Source file: `ingest/Kimi-Protein_Geometry_&_N-Fold_Mechanics.json` (2 KB)
|
||||
* First query: "i need all data on protein structures and the n-fold mechanics, i'm attempting to map them to a geometric first language everything ever written"
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-Protein Structures and Invariant Roots]]
|
||||
* [[Synthetic Genetic Coding]]
|
||||
|
|
@ -0,0 +1,18 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Proteins InvariantRoots Geometry
|
||||
title: Kimi-Protein Structures and Invariant Roots
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Protein Structures and Invariant Roots
|
||||
|
||||
Kimi conversation researching all available data on protein structures and N-fold mechanics, with the goal of mapping these to a geometric first language and deriving physical invariant roots.
|
||||
|
||||
* Source file: `ingest/Kimi-Protein_Structures_&_Invariant_Roots.json` (2 KB)
|
||||
* First query: "i need all data on protein structures and the n-fold mechanics, i'm attempting to map them to a geometric first language"
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-Protein Geometry and N-Fold]]
|
||||
* [[Peptide MoE]]
|
||||
|
|
@ -0,0 +1,17 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Formula Review Derivation
|
||||
title: Kimi-Review of Your Formula
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Review of Your Formula
|
||||
|
||||
Kimi conversation reviewing a formula under active design. Collaborative review session checking mathematical correctness and suggesting improvements to an in-development formula.
|
||||
|
||||
* Source file: `ingest/Kimi-Review_of_Your_Formula.json` (29 KB)
|
||||
* First query: "help me review the formula i'm designing"
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-Attention Center Equation Derivation]]
|
||||
|
|
@ -0,0 +1,18 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Physics Spacetime FundamentalForces
|
||||
title: Kimi-Spacetime from Fundamental Forces
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Spacetime from Fundamental Forces
|
||||
|
||||
Kimi conversation exploring the idea of treating the 4 fundamental forces as an emergent field that causes spacetime. Verification approach uses the solar system as a verified movement system with a lookup table to derive how these forces give rise to spacetime structure.
|
||||
|
||||
* Source file: `ingest/Kimi-Spacetime_from_Fundamental_Forces.json` (4 KB)
|
||||
* First query: "try to treat the 4 fundamental forces as a emergent field that causes spacetime as a result, we verify this by treating the solar system as a verified movement system with a lookup table"
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-四力几何推导]]
|
||||
* [[FiveD Torus Topology]]
|
||||
|
|
@ -0,0 +1,18 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Specification EquationRigor Physics
|
||||
title: Kimi-Spec 250 Equation Rigor
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Spec 250 Equation Rigor
|
||||
|
||||
Kimi conversation examining the core Spec 250 Functional Equation stripped to mathematical essentials, designed for REPL/Jupyter verification. Focused on rigorous verification of the physics underlying the Spec 250 equation.
|
||||
|
||||
* Source file: `ingest/Kimi-Spec_250_Equation_Rigor.json` (25 KB)
|
||||
* First query: provided "core Spec 250 Functional Equation stripped down to its mathematical essentials" for verification
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-Theory Cleanup via Review]]
|
||||
* [[Kimi-Framework Re-Review]]
|
||||
|
|
@ -0,0 +1,21 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Review TheoryCleanup
|
||||
title: Kimi-Theory Cleanup via Review
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Theory Cleanup via Review
|
||||
|
||||
Kimi conversation about cleaning up and refining the theory through systematic review. A focused session on theoretical cleanup and consolidation.
|
||||
|
||||
* Source file: `ingest/Kimi-Theory_Cleanup_via_Review.json` (37 KB)
|
||||
* First query: "help me clean up this theory"
|
||||
|
||||
Covers: theory cleanup, review-driven refinement, theoretical consolidation.
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-Multi-Expert OMTI Review]]
|
||||
* [[Kimi-Framework Re-Review]]
|
||||
* [[Kimi-Spec 250 Equation Rigor]]
|
||||
|
|
@ -0,0 +1,21 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Hardware ASIC Tapeout
|
||||
title: Kimi-Tiny Tapeout Cost and Core
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Tiny Tapeout Cost and Core
|
||||
|
||||
Kimi conversation exploring the costs of using the Tiny Tapeout service and core design considerations. Investigated budget-friendly ASIC fabrication options through the Tiny Tapeout platform.
|
||||
|
||||
* Source file: `ingest/Kimi-Tiny_Tapeout_Cost_&_Core_Design.json` (47 KB)
|
||||
* First query: "How much does it cost to use tiny tape out"
|
||||
|
||||
Covers: Tiny Tapeout pricing, ASIC fabrication, core design, budget IC manufacturing.
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[ASIC Topology]]
|
||||
* [[FPGA Warden]]
|
||||
* [[Materials and Hardware Mining]]
|
||||
|
|
@ -0,0 +1,21 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Topology Genetics Pipeline Genome
|
||||
title: Kimi-Topological Genome Tractability Pipeline
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Topological Genome Tractability Pipeline
|
||||
|
||||
Kimi conversation about the Topological Genome Tractability Pipeline: a project mapping from atomic manifolds to Q-Phi CRC checksums. Begins with the fork fern genome (Tmesipteris oblanceolata, 160 Gbp) as input and explores topological encoding of genomic data.
|
||||
|
||||
* Source file: `ingest/Kimi-Topological_Genome_Tractability_Pipeline.json` (76 KB, 87 messages)
|
||||
* First query: "Project: Topological Genome Tractability Pipeline — From Atomic Manifolds to Q-Phi CRC Checksums"
|
||||
|
||||
Covers: topological genome encoding, Q-Phi checksums, genomic data compression, manifold-to-genome mapping.
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Genetic Code Pipeline]]
|
||||
* [[Hachimoji Pipeline]]
|
||||
* [[Genomic Data Compression Anchor]]
|
||||
|
|
@ -0,0 +1,18 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Math CrossDomain Universal
|
||||
title: Kimi-Universal Cross-Domain Math
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Universal Cross-Domain Math
|
||||
|
||||
Kimi conversation gathering math from every domain to cover as large an area as possible, performing statistical analysis of cross-domain similarities in number theory and how humans derive mathematics. A broad survey of mathematical commonalities across disciplines.
|
||||
|
||||
* Source file: `ingest/Kimi-Universal_Cross‑Domain_Math.json` (2 KB)
|
||||
* First query: "i need math for every domain to cover as large an area as possible, i'm doing statistical analysis of cross domain similarities in number theory math itself"
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-Cross Domain Math Analysis]]
|
||||
* [[Kimi-Math Queries]]
|
||||
|
|
@ -0,0 +1,20 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Geometry Unsolved OMTI
|
||||
title: Kimi-Unsolved Geometry Problems
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-Unsolved Geometry Problems
|
||||
|
||||
Kimi conversation focused on reading original papers in the OTMI (Ontological Manifold Theory Implementation) repository, exploring unsolved problems in geometry as they relate to the manifold theory framework.
|
||||
|
||||
* Source file: `ingest/Kimi-Unsolved_Geometry_Problems.json` (407 KB, 68 messages)
|
||||
* First query: "read the original papers in the OTMI repo"
|
||||
|
||||
Covers: unsolved geometry problems, OTMI repository papers, manifold theory geometry.
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-Ontological Manifold Theory Overview]]
|
||||
* [[Pathological Manifold Torus]]
|
||||
|
|
@ -0,0 +1,16 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Review Stability
|
||||
title: Kimi-review stablity
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-review stablity
|
||||
|
||||
Kimi conversation reviewing the stability of a result or construct. Focused stability analysis session.
|
||||
|
||||
* Source file: `ingest/Kimi-review_stablity_of_this.json` (5 KB)
|
||||
* First query: "review stablity of this"
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
|
|
@ -0,0 +1,19 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi Thermal Physics Hardware
|
||||
title: Kimi-θ-TaN Thermal Model
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-θ-TaN Thermal Model
|
||||
|
||||
Kimi conversation about the θ-TaN (Theta-Tantalum Nitride) thermal model, with applications to sounding tests on job sites. Explored thermal behavior modeling of TaN materials.
|
||||
|
||||
* Source file: `ingest/Kimi-θ-TaN_Thermal_Model.json` (98 KB, 99 messages)
|
||||
* First query: "that would massive if you are doing sounding tests on a job site"
|
||||
|
||||
Covers: θ-TaN thermal model, thermal behavior, TaN materials, field testing.
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Speculative Materials]]
|
||||
|
|
@ -0,0 +1,17 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi 中文 Physics Geometry Forces
|
||||
title: Kimi-四力几何推导
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-四力几何推导
|
||||
|
||||
Kimi中文对话：尝试将四大基本力视为产生时空的涌现场，使用太阳系作为验证运动系统，通过查找表推导四大基本力如何产生时空结构。对应英文会话 [[Kimi-Spacetime from Fundamental Forces]]。
|
||||
|
||||
* Source file: `ingest/Kimi-四力几何推导.json` (13 KB)
|
||||
* First query: "try to treat the 4 fundamental forces as a emergent field that causes spacetime as a result, we verify this by treating the solar system as a verified movement system with a lookup table"
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-Spacetime from Fundamental Forces]]
|
||||
|
|
@ -0,0 +1,18 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Kimi 中文 MultiAgent InvariantEquations
|
||||
title: Kimi-多代理协作探不变方程
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Kimi-多代理协作探不变方程
|
||||
|
||||
Kimi中文对话：使用代理通过公共黑板/工作空间协作，研究任何需要的主题以找到不变方程所在。基于 VISION_NORTH_STAR.md 文档的探索会话。
|
||||
|
||||
* Source file: `ingest/Kimi-多代理协作探不变方程.json` (10 KB)
|
||||
* First query: "/home/allaun/Research Stack/docs/VISION_NORTH_STAR.md use agents with a common blackboard / workspace to collaborate and research any topic they deem needed to find where the invariant equations reside"
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Kimi Conversations]]
|
||||
* [[Kimi-Multi-Expert OMTI Review]]
|
||||
* [[Kimi-Install Multi-Agent Orchestration]]
|
||||
|
|
@ -0,0 +1,9 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Lean FormalVerification
|
||||
title: Lean Semantics Overview
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Lean Semantics Overview
|
||||
|
||||
The Lean 4 formalization ecosystem is the formal workhorse of the Research Stack, containing ~421 .lean files in `0-Core-Formalism/lean/Semantics/Semantics/` organized into 31 subdirectories. Major subsystems include: [[Fixed Point Algebra]] (Q16_16 fixed-point arithmetic), [[FiveD Torus Topology]] (torus distance and routing), [[PIST Shell Encoding]] (shell partition and mirror involution), [[AMMR Adaptive Meshless Methods]] (meshless PDE solving), [[AVMR Adaptive Vector Manifold Representation]] (vector manifold representation), [[SLUQ Routing]] (quaternion-based routing), [[Sigma Gate]] (entropy gating), [[Mass Number Theory]] (admissibility gates), [[Hutter Prize ISA]] (compression-optimized instruction set), [[Yang-Mills Compression]] (field-theoretic compression bounds), and [[NIICore Architecture]] (morphic field core with 20+ submodules). Built with Lake package manager; external OTOM formalizations at `0-Core-Formalism/lean/external/OTOM/`.
|
||||
|
|
@ -0,0 +1,9 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Lean Manifold PDE Flow
|
||||
title: Manifold Flow
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Manifold Flow
|
||||
|
||||
Manifold flow dynamics (`0-Core-Formalism/lean/Semantics/Semantics/ManifoldFlow.lean`) — gradient descent on manifold surfaces, flow field computation, and anisotropic torsion flow (foldback-lock dynamics preventing manifold drift). `ManifoldPotential.lean` defines potential energy surfaces for flow computation. `ManifoldStructures.lean` catalogs manifold types (Euclidean, hyperbolic, toroidal, projective, Klein, Möbius, fractal). `ManifoldTopology.lean` maps topological invariants across flows. The flow framework integrates with the [[Topological State Machine]] for geometric evolution, [[FAMM Fast Approximate Manifold Map]] for cached flow states, and hardware acceleration via [[Manifold Blit]] operations in WGSL.
|
||||
|
|
@ -0,0 +1,9 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Visualization Manifold HTML WebGL
|
||||
title: Manifold Viewer
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Manifold Viewer
|
||||
|
||||
Interactive 3D manifold visualizations in the browser: `6-Documentation/docs/semantics/manifold_viewer.html` (full 3D manifold viewer with torus, sponge, and shell projections), `obelisk_manifold.html` (obelisk-style manifold with composite addressing), `pist_workflow_diagram.html` (PIST encoding workflow visualization). The manifold viewer uses Three.js/WebGL for real-time 3D rendering of: hypertorus projections, Menger sponge levels, PIST shell coordinates, and composite manifold structures. The [[Text-to-CAD Viewer]] (`5-Applications/text-to-cad/viewer/`) provides a React-based alternative for CAD model visualization with glTF/STL export. All viewer assets reference the [[Cad Models]] collection at `3-Mathematical-Models/cad_models/`.
|
||||
|
|
@ -0,0 +1,9 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Lean Math Admissibility Gate
|
||||
title: Mass Number Theory
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Mass Number Theory
|
||||
|
||||
Mass Number admissibility gate formalized in `0-Core-Formalism/lean/Semantics/Semantics/Core/MassNumber.lean` — three-layer gate structure: Admissible (A), Residual (R), Boundary (ε guard). Core rule: A ≤ τ · (R + ε). If the rule fails, the operation is rejected to the Underverse. The `MassNumberAdapter.lean` bridges to the broader semantics system. Python implementations at `0-Core-Formalism/core/formalize_mass_number.py` and Lean proof data at `3-Mathematical-Models/mass_number_proofs.json`. The `MassNumberLinter.lean` provides static analysis for Lawful transitions. Integrates with the [[Hutter Prize Compression]] gate (`hutterCompressionGate` in Core/MassNumber.lean) and the [[Reality Contract Mass Number]] for commitment enforcement. The Erdos Mass Number Map (`ErdosMentalModelMassNumberMap.md`) documents forced-pattern relationships.
|
||||
|
|
@ -0,0 +1,14 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Topology MengerSponge Fractal Compression
|
||||
title: Menger Sponge Fractal Addressing
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Menger Sponge Fractal Addressing
|
||||
|
||||
Menger sponge fractal addressing (`0-Core-Formalism/lean/Semantics/Semantics/MengerSpongeFractalAddressing.lean`, Python: `5-Applications/scripts/menger_sponge_fractal_addressing.py`) provides hierarchical void-based routing. Each iteration removes center cubes (7 per 3x3x3 block), creating addressable voids with Hausdorff dimension ~2.7268. Used by [[Networked Self Solving Space]] for distributed quine addressing, the [[Meta Manifold Language Merging]] framework for torus-void routing channels, and the composite manifold (sponge nodes mounted on Gabriel's horn). OpenSCAD model at `3-Mathematical-Models/cad_models/menger_sponge.scad` visualizes level-2 sponge with 20 remaining subcubes and 7 removed voids. One of three pathological manifold structures for [[Hutter Prize Compression]].
|
||||
|
||||
* [[Pathological Menger-Horn Composite]]
|
||||
* [[FiveD Torus Topology]]
|
||||
* [[Hutter Prize Compression]]
|
||||
* [[Lean Semantics Overview]]
|
||||
|
|
@ -0,0 +1,14 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Lean MorphicField Core Architecture
|
||||
title: NIICore Architecture
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! NIICore Architecture
|
||||
|
||||
NIICore (`0-Core-Formalism/lean/Semantics/Semantics/NIICore.lean`) is the morphic field core with 20+ submodules providing: semantic analysis, semantic RG flow, morphing triggers, morphing tests, predictive resource allocation, uncertainty quantification, meta-predictive differential processing, differential attention morphing, hierarchical control, translation engine, surface driver, verification, and sheaf-persistent RG hybrids (bridging persistent homology with renormalization group flow). The `NIICore/` subdirectory contains dedicated modules for each capability. Integrates with the [[Semantic Engine Binding Derivation]] for semantic state morphisms and the [[Morphic DSP]] for signal processing in morphic field space.
|
||||
|
||||
* [[Lean Semantics Overview]]
|
||||
* [[Morphic DSP]]
|
||||
* [[Semantic Engine Binding Derivation]]
|
||||
* [[Semantic RG Flow]]
|
||||
|
|
@ -0,0 +1,9 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Lean PIST Compression Math
|
||||
title: PIST Shell Encoding
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! PIST Shell Encoding
|
||||
|
||||
PIST (Prime Integer Shell Transform) encodes integers as (k, t) coordinates where n = k² + t, k = floor(sqrt(n)), 0 ≤ t ≤ 2k. Formalized in `0-Core-Formalism/lean/Semantics/Semantics/PIST.lean` with bridges to hardware blitter via `PistBridge.lean`. Mass is t·(2k+1-t) — zero at shell edges, max at center. Mirror involution (k, t) → (k, 2k+1-t) preserves mass and is self-inverse. Extensions: n-dimensional bundle shifting (`PistNDBundleShifter`), phi-shell golden ratio encoding (`PhiShellEncoding.lean`), torsional PIST variants. The Python implementations span 5 files at `3-Mathematical-Models/pist_biological_polymorphic_shifter_v3*.py` and `5-Applications/pist-scripts/`. Visualizable via `3-Mathematical-Models/cad_models/pist_shells.scad`. One of three pathological manifold structures.
|
||||
|
|
@ -0,0 +1,9 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Biology AI Peptide MoE
|
||||
title: Peptide MoE
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Peptide MoE
|
||||
|
||||
Peptide Mixture-of-Experts model for protein/peptide prediction. Lean modules: `PeptideMoE.lean`, `PeptideMoEExamples.lean`, `PeptideMoEFailure.lean`, `PeptideMoERepair.lean`. Part of the [[Swarm MoE Rewiring]] system for dynamic expert routing. The peptide pipeline connects codon sequences to protein structures through a learned mixture-of-experts architecture with repair/recovery mechanisms for prediction failures. Test data and review at `shared-data/data/swarm_peptide_moe_*`. Integrates with the [[Genetic Code Pipeline]] for codon-to-peptide translation and the [[RNA to Peptide Shifter]] for ribosomal modeling.
|
||||
|
|
@ -0,0 +1,9 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Meta Architecture
|
||||
title: Research Stack Architecture
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Research Stack Architecture
|
||||
|
||||
The Research Stack is organized into 6 layers: 0-Core-Formalism (Lean proofs, Q16_16 fixed-point, Rust crates, C/LL/WGSL sources), 1-Notation-Layer (notation encoding), 2-Search-Space (search topology), 3-Mathematical-Models (equation extraction, CAD models, TSM caches, manifold compression), 4-Infrastructure (ENE swarm, GCL compression, hardware/FPGA, GPU/WebGPU, embedded/VMs, nano-kernel, servo-fetch), 5-Applications (scripts, text-to-CAD, Rust compressors, Tauri native apps, tools), 6-Documentation (papers, docs, wiki, tiddlywiki). Cross-cutting concerns include [[Lean Semantics Overview]] (formal verification), [[Delta GCL Compression]] (data encoding), [[Topological State Machine]] (geometric computation), [[Hutter Prize Compression]] (compression target), and [[Swarm ENE Middleware]] (orchestration). The [[ENe Cognitive Refactor Plan]] guides near-term infrastructure evolution.
|
||||
|
|
@ -7,13 +7,101 @@ type: text/vnd.tiddlywiki
|
|||
! Research Stack Local TiddlyWiki
|
||||
|
||||
This is the local nonlinear note surface for the Research Stack.
|
||||
Use it for fast concept cards, cross-links between ideas and formal surfaces,
|
||||
and temporary maps before promotion into the durable doc layer.
|
||||
|
||||
Use it for:
|
||||
!! Architecture & Infrastructure
|
||||
|
||||
* fast concept cards
|
||||
* cross-links between weird ideas and formal surfaces
|
||||
* temporary working maps before promotion into `6-Documentation/wiki/`
|
||||
* local-only trails that should not yet become canonical docs
|
||||
* [[Research Stack Architecture]] — 6-layer system overview
|
||||
* [[ENe Cognitive Refactor Plan]] — 14-week infrastructure roadmap
|
||||
* [[ENE API Hook]] — AES-256-GCM encryption + secure storage
|
||||
* [[Swarm ENE Middleware]] — query caching + audit + semantic search
|
||||
* [[ENE Wiki Layer]] — revisioned wiki with 14D concept vectors
|
||||
* [[TiddlyWiki ENE Bridge Plugin]] — wiki-to-swarm bridge
|
||||
|
||||
!! Compression Pipeline
|
||||
|
||||
* [[Hutter Prize Compression]] — enwik9 static target
|
||||
* [[Hutter Prize ISA]] — compression-optimized instruction set
|
||||
* [[Hutter Critical Analysis]] — claim-boundary audit rail
|
||||
* [[Delta GCL Compression]] — Metafoam → GCL → AES pipeline
|
||||
* [[GCL Nanokernel]] — self-hosting compression execution
|
||||
* [[Compression and Soliton Mining]] — compression discovery
|
||||
* [[Engram Decompressor]] — decode path
|
||||
|
||||
!! Lean Formal Verification
|
||||
|
||||
* [[Lean Semantics Overview]] — 421 .lean files, 31 subdirectories
|
||||
* [[Fixed Point Algebra]] — Q16_16 arithmetic proofs
|
||||
* [[Mass Number Theory]] — admissibility gate (A ≤ τ·(R + ε))
|
||||
* [[Sigma Gate]] — entropy-based operation gating
|
||||
* [[Yang-Mills Compression]] — gauge-theoretic encoding bounds
|
||||
* [[PIST Shell Encoding]] — (k, t) coordinate system
|
||||
* [[FiveD Torus Topology]] — periodic boundary routing
|
||||
* [[AVMR Adaptive Vector Manifold Representation]] — 7-module framework
|
||||
* [[AMMR Adaptive Meshless Methods]] — mesh-free PDE solving
|
||||
|
||||
!! Topology, TSM & Manifolds
|
||||
|
||||
* [[Topological State Machine]] — geometric state evolution
|
||||
* [[Manifold Flow]] — gradient descent on manifold surfaces
|
||||
* [[Semantic RG Flow]] — scale-invariant semantic operations
|
||||
* [[Unified Hypersurface]] — multi-manifold computation
|
||||
* [[Menger Sponge Fractal Addressing]] — void-based routing
|
||||
* [[FAMM Fast Approximate Manifold Map]] — binary state cache
|
||||
* [[Waveprobe]] — manifold probing + wavefront propagation
|
||||
* [[Semantic Eigenvector Bundle]] — equation→eigenvector mapping
|
||||
* [[Equation Forest Index]] — structured equation catalog
|
||||
|
||||
!! Pathological Manifolds (CAD)
|
||||
|
||||
* [[Pathological Manifold Torus]] — 3D hypertorus slice
|
||||
* [[Pathological Menger-Horn Composite]] — sponge on horn
|
||||
* [[Pathological PIST Shells]] — concentric shell rings
|
||||
* [[Manifold Viewer]] — WebGL 3D visualizations
|
||||
|
||||
!! Search & Graph Mining
|
||||
|
||||
* [[HNSW Vector Search]] — O(log N) ANN over concept vectors
|
||||
* [[Semantic Graph Mining]] — graph extraction + community detection
|
||||
* [[Graph-Evolving RAG]] — retrieval-augmented generation
|
||||
* [[Internal Semantic Search]] — local search surface
|
||||
* [[Address-First Search Protocol]] — coordinate-prior search
|
||||
|
||||
!! Biology & Genetics
|
||||
|
||||
* [[Genetic Code Pipeline]] — codon→gene→chromosome→genome
|
||||
* [[Hachimoji Pipeline]] — 8-letter genetic alphabet
|
||||
* [[Synthetic Genetic Coding]] — DNA as programmable storage
|
||||
* [[Peptide MoE]] — mixture-of-experts for peptides
|
||||
* [[Extremophile Constraint Layer]] — 4Gyr survival bounds
|
||||
* [[RNA to Peptide Shifter]] — ribosomal encoding
|
||||
|
||||
!! Hardware & GPU
|
||||
|
||||
* [[FPGA Warden]] — hardware security + compute offload
|
||||
* [[ASIC Topology]] — topological die layout
|
||||
* [[HDMI Compute Fabric]] — display-as-compute
|
||||
* [[Morphic DSP]] — reconfigurable signal processing
|
||||
* [[Virtual Display Blitter Compute Surface]] — WGSL rendering
|
||||
|
||||
!! Data & Ingestion
|
||||
|
||||
* [[Data Ingestion Pipeline]] — multi-source knowledge feed
|
||||
* [[Mined Conversation Concepts]] — mined concept index
|
||||
* [[Conversation Mining Source Map]] — source tracking
|
||||
* [[Full Chat Log Dumps]] — raw conversation archives
|
||||
* [[Speculative Materials]] — hypothesis sandbox
|
||||
|
||||
!! Concepts & Tools
|
||||
|
||||
* [[Concept Vector 14]] — 14D semantic vector spec
|
||||
* [[Semantic Prime Refraction]] — prime-based concept routing
|
||||
* [[Golden Angle Encoding]] — φ-irrational rotations
|
||||
* [[Gray-Code Golden-Spiral Fold]] — spiral compression
|
||||
* [[COUCH Family]] — constraint unification
|
||||
* [[Monster Filter Family]] — anomaly detection
|
||||
* [[Triumvirate Enforcer]] — 3-party consensus
|
||||
|
||||
!! Durable Markdown Surfaces
|
||||
|
||||
|
|
@ -22,12 +110,3 @@ Use it for:
|
|||
* `../wiki/Concept-Archive.md`
|
||||
* `../docs/GLOSSARY.md`
|
||||
* `../docs/WEIRD_CONCEPTS_GLOSSARY.md`
|
||||
|
||||
!! Good First Tiddlers
|
||||
|
||||
* [[Mined Conversation Concepts]]
|
||||
* [[Conversation Mining Source Map]]
|
||||
* [[Speculative Materials]]
|
||||
* [[Monster Filter Family]]
|
||||
* [[COUCH Family]]
|
||||
* [[Local Setup Notes]]
|
||||
|
|
|
|||
|
|
@ -0,0 +1,14 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Lean Quaternion Routing
|
||||
title: SLUQ Routing
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! SLUQ Routing
|
||||
|
||||
SLUQ (Semantic Latent Unified Quaternion) routing (`0-Core-Formalism/lean/Semantics/Semantics/SLUQ.lean`) uses quaternion algebra for semantic routing decisions. Quaternions provide 4D representations that avoid gimbal lock, making them suitable for manifold navigation. `SLUQQuaternionIntegration.lean` bridges quaternion ops to the broader semantics system. `SLUQTriage.lean` provides triage routing for emergency/manifold-critical paths. `SLUG3.lean` extends to 3rd-gen SLUQ with improved convergence properties. Related to the [[Quaternion Scalar]] module and the [[MNLOG Quaternion Bridge]] for multi-nodal logic integration.
|
||||
|
||||
* [[Lean Semantics Overview]]
|
||||
* [[AVMR Adaptive Vector Manifold Representation]]
|
||||
* [[Quaternion Scalar]]
|
||||
* [[Semantic Graph Mining]]
|
||||
|
|
@ -1,22 +1,16 @@
|
|||
created: 20260506134500000
|
||||
modified: 20260506134500000
|
||||
tags: ResearchStack SemanticGraph Search Candidate
|
||||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack TSM Eigenvector Math
|
||||
title: Semantic Eigenvector Bundle
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Semantic Eigenvector Bundle
|
||||
|
||||
Gestalt-like cluster of concepts treated as a principal direction over a typed
|
||||
evidence graph instead of as isolated keywords.
|
||||
The eigenvector pipeline maps mathematical equations and manifold states to topological eigenvectors. Key scripts: `5-Applications/scripts/find_equation_eigenvectors.py` (discovers equation eigenvectors), `5-Applications/scripts/neural_type_eigenvector_coverage.py` (coverage analysis of neural-type eigenvectors), `5-Applications/scripts/eigenvector_tsm_hyperfluid.py` (hyperfluid TSM eigenvector evolution). Output data includes `3-Mathematical-Models/eigenvector_tsm/eigenvector_hyperfluid_150_steps.json` and `3-Mathematical-Models/hutter_eigenvector/hutter_eigenvector_150_steps.json`. Integrates with the [[Topological State Machine]] and [[FAMM Fast Approximate Manifold Map]] for caching eigenvector trajectories. The Hutter eigenvector variant applies this to compression-oriented manifold analysis, feeding into the [[Hutter Prize Compression]] pipeline.
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Internal Semantic Search]]
|
||||
* [[HELLO Transform]]
|
||||
* [[Semantic Graph Mining]]
|
||||
* [[Tensor Compass]]
|
||||
|
||||
!! Durable Sources
|
||||
|
||||
* `../wiki/Concept-Archive.md`
|
||||
* `../docs/research/NEURAL_TYPE_EIGENVECTOR_COVERAGE.md`
|
||||
* [[Topological State Machine]]
|
||||
* [[FAMM Fast Approximate Manifold Map]]
|
||||
* [[Hutter Prize Compression]]
|
||||
* [[Morphic DSP]]
|
||||
|
|
|
|||
|
|
@ -1,30 +1,9 @@
|
|||
created: 20260506134000000
|
||||
modified: 20260506134000000
|
||||
tags: ResearchStack Mining SemanticGraph Glossary
|
||||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Search Graph Mining Semantic
|
||||
title: Semantic Graph Mining
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Semantic Graph Mining
|
||||
|
||||
Lane for mined conversation cards about semantic graph routing, glossary
|
||||
surface, weird concept aliases, semantic eigenvectors, ENE capture, and internal
|
||||
search.
|
||||
|
||||
!! Seed Links
|
||||
|
||||
* [[Semantic Eigenvector Bundle]]
|
||||
* [[Internal Semantic Search]]
|
||||
* [[HELLO Transform]]
|
||||
* [[Monster Filter Family]]
|
||||
* [[COUCH Family]]
|
||||
* [[Reactive Semantic Perturbation]]
|
||||
|
||||
!! Mined Cards
|
||||
|
||||
* [[Semantic Prime Refraction]]
|
||||
* [[Chirality Destabilizer]]
|
||||
* [[Hybrid Abelian Non-Abelian Sandpile]]
|
||||
* [[LNMF Loch-Nessie-Monster Filter]]
|
||||
* [[Tree Fiddy Monster Assignment]]
|
||||
* [[F-Number COUCH]]
|
||||
* [[Route-Pressure COUCH Gate]]
|
||||
Semantic graph mining pipeline extracts concept graphs from the research corpus. Includes `5-Applications/scripts/build_graphml.py` (GraphML export), `build_manifold_graphml.py` (manifold-aware graphs), `compute_distance_matrix.py` (semantic distances), `cluster_supernodes.py` (community detection), and `build_unified_forest.py` (equation forest construction). The [[Graph-Evolving RAG]] system uses these graphs for retrieval-augmented generation. Mining outputs connect to [[HNSW Vector Search]] for ANN queries and [[Semantic Search]] (internal tool at `5-Applications/tools-scripts/search/`) for full-text retrieval. The [[Semantic Prime Refraction]] and [[Address-First Search Protocol]] provide specialized mining strategies.
|
||||
|
|
|
|||
|
|
@ -0,0 +1,9 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Lean RGFlow Semantics Manifold
|
||||
title: Semantic RG Flow
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Semantic RG Flow
|
||||
|
||||
Semantic Renormalization Group (RG) flow applies renormalization group theory to semantic manifolds. Lean modules: `SemanticRGFlow.lean` (core), `SwarmRGFlow.lean` (swarm-distributed), `BitcoinRGFlow.lean` (financial/commitment applications). The RG flow enables scale-invariant semantic operations — coarse-graining of concept vectors preserves structural relationships. Energy scale β controls the flow; fixed points represent stable semantic configurations. Used by the [[Topological State Machine]] for scale-invariant state transitions, [[NIICore Architecture]] for morphic field RG, and [[Hutter Prize RG Flow]] for compression-optimized renormalization. The `TopologyRGFlow.lean` (likely in Extensions/) connects to topological persistence.
|
||||
|
|
@ -0,0 +1,9 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Lean Entropy Gate Compression
|
||||
title: Sigma Gate
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Sigma Gate
|
||||
|
||||
Sigma Gate (`0-Core-Formalism/lean/Semantics/Semantics/SigmaGate.lean`) provides entropy-based gating for all semantic operations. Computes information-theoretic thresholds for admissibility decisions. The `SigmaGateEntropy.lean` extends with entropy measures, and `SigmaGateBenchmark.lean` provides performance validation. Used by the [[Mass Number Theory]] for admissibility checks, the [[Hutter Prize Compression]] pipeline for compression decision gating, and the [[AVMR Adaptive Vector Manifold Representation]] for vector routing decisions. The sigma gate forms the "yes/no" decision boundary for whether a transformation is lawful within information bounds.
|
||||
|
|
@ -0,0 +1,17 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Infrastructure Swarm Caching
|
||||
title: Swarm ENE Middleware
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Swarm ENE Middleware
|
||||
|
||||
`4-Infrastructure/infra/swarm_ene_middleware.py` (427 lines) — middleware that hooks the Research Swarm API into the ENE database for query result caching, audit logging, and semantic retrieval. Maintains three SQLite tables: swarm_query_cache (TTL-based cache with hit counters), swarm_api_audit (operation log with timing), and swarm_semantic_index (14D concept vector index). Currently uses O(N) brute-force cosine similarity search. The cache stores 14D semantic vectors derived from query subjects via MD5 hashing. Part of the planned HNSW-based ANN upgrade (see [[HNSW Vector Search]] and the [[ENE Cognitive Refactor Plan]]).
|
||||
|
||||
!! Links
|
||||
|
||||
* [[ENE API Hook]]
|
||||
* [[ENE Wiki Layer]]
|
||||
* [[HNSW Vector Search]]
|
||||
* [[Semantic Graph Mining]]
|
||||
* [[Concept Vector 14]]
|
||||
|
|
@ -0,0 +1,9 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Biology Genetics Compression
|
||||
title: Synthetic Genetic Coding
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Synthetic Genetic Coding
|
||||
|
||||
Synthetic genetic coding research (`6-Documentation/docs/SYNTHETIC_GENETIC_CODING_RESEARCH.md`) and Lean module `SyntheticGeneticCoding.lean`. Explores DNA as a programmable storage medium with codon→gene→chromosome→genome hierarchical encoding. The genetic coding infrastructure includes [[Genetic Code Optimization]], [[LaviGen]] (genetic language variant generation), and the [[Peptide MoE]] (mixture-of-experts model for peptide prediction). Connected to the [[Hutter Prize Compression]] strategy through genome-as-compressor models. The [[Genomic Data Compression Anchor]] provides the compression target. See also `6-Documentation/wiki/Obsidian-connector/Manifold/Modules/SyntheticGeneticCoding.md`.
|
||||
|
|
@ -0,0 +1,15 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack TSM Topology Manifold
|
||||
title: Topological State Machine
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Topological State Machine
|
||||
|
||||
The Topological State Machine (TSM) is a geometric state-evolution framework that models manifold transitions as discrete steps through topological space. Core implementation: `5-Applications/scripts/topological_state_machine.py`. Extended variants: eigenvector TSM (`eigenvector_tsm_hyperfluid.py`), Hutter TSM (`hutter_eigenvector/`), and unified hypersurface TSM (`3-Mathematical-Models/unified_surface/`). State data stored in `3-Mathematical-Models/topological_state_machine/` with `tsm_report_*.json` outputs. Uses [[FAMM Fast Approximate Manifold Map]] for caching state transitions. Integration with Lean via `TopologicalStateMachine.lean`. The TSM cache directories (eigenvector_tsm, hutter_eigenvector) contain FAMM banks for fast manifold lookup. Referenced in the [[ENE Cognitive Refactor Plan]] Phase 6 for shell-partitioned cache eviction.
|
||||
|
||||
* [[FAMM Fast Approximate Manifold Map]]
|
||||
* [[Lean Semantics Overview]]
|
||||
* [[Manifold Flow]]
|
||||
* [[Semantic Eigenvector Bundle]]
|
||||
* [[Unified Hypersurface]]
|
||||
|
|
@ -0,0 +1,9 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack TSM Manifold Geometry
|
||||
title: Unified Hypersurface
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Unified Hypersurface
|
||||
|
||||
Unified hypersurface (`3-Mathematical-Models/unified_surface/`) models computation as movement across a higher-dimensional surface combining multiple manifold structures. State stored as `uhs_state_*.json` with cached manifold data. The hypersurface folds together [[FiveD Torus Topology]], [[Menger Sponge Fractal Addressing]], Gabriel's Horn, and [[PIST Shell Encoding]] into a single geometric computation framework. Used by the [[Topological State Machine]] for multi-manifold state transitions and the [[Hutter Prize Compression]] pipeline for unified compression geometry (Torus-Menger-Horn folding). Related to the composite manifold CAD model.
|
||||
|
|
@ -1,23 +1,14 @@
|
|||
created: 20260506134500000
|
||||
modified: 20260506134500000
|
||||
tags: ResearchStack Control Verification
|
||||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Waveprobe FAMM Manifold
|
||||
title: Waveprobe
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Waveprobe
|
||||
|
||||
Hysteretic local selection and risk kernel. In this local wiki, Waveprobe is
|
||||
the shared handle for choosing between candidate routes, material states, or
|
||||
contact modes under explicit warn, lock, and recover barriers.
|
||||
WaveProbe is a manifold-probing system that emits and measures wavefronts across topological spaces. `4-Infrastructure/shim/waveprobe_manifold_famm_preshaper.py` pre-shapes FAMM banks for wavefront propagation. `5-Applications/scripts/waveform_waveprobe_coarse_grained.py` handles coarse-grained waveform analysis. Integration with Google Drive/ENE at `shared-data/data/swarm_waveprobe_gdrive_result.json` and `shared-data/data/swarm_waveprobe_gdrive_ene_result.json`. The WaveProbe pipeline feeds into [[FAMM Fast Approximate Manifold Map]] for pre-computed manifold transitions and the [[Topological State Machine]] for state evolution. WaveProbe+FAMM integration is documented at `4-Infrastructure/shim/WAVEPROBE_FAMM_INTEGRATION_SUMMARY.md`.
|
||||
|
||||
!! Links
|
||||
|
||||
* [[Structural eFuse Surface]]
|
||||
* [[Speculative Materials]]
|
||||
* [[Materials and Hardware Mining]]
|
||||
* [[Compression and Soliton Mining]]
|
||||
|
||||
!! Durable Sources
|
||||
|
||||
* `../docs/GLOSSARY.md`
|
||||
* `../docs/specs/waveprobe_qubo_spec.tex`
|
||||
* [[FAMM Fast Approximate Manifold Map]]
|
||||
* [[Topological State Machine]]
|
||||
* [[Manifold Flow]]
|
||||
* [[Semantic RG Flow]]
|
||||
|
|
|
|||
|
|
@ -0,0 +1,9 @@
|
|||
created: 20260507000000000
|
||||
modified: 20260507000000000
|
||||
tags: ResearchStack Lean Compression Physics YangMills
|
||||
title: Yang-Mills Compression
|
||||
type: text/vnd.tiddlywiki
|
||||
|
||||
! Yang-Mills Compression
|
||||
|
||||
Yang-Mills field-theoretic compression formalized across 5 Lean modules: `YangMillsCompression.lean`, `YangMillsCompressionBounds.lean`, `YangMillsLattice.lean`, `YangMillsLatticeSizing.lean`, `YangMillsPerformance.lean`. Applies gauge theory to compression — field strength tensors as compression operators, lattice regularization for discrete encoding, and theoretical bounds on achievable compression ratios. Uses the [[Mass Number Theory]] for admissibility gating of compression claims. Integrated with the [[Hutter Prize Compression]] pipeline for field-compression approaches to the enwik9 dataset. Complements the [[Delta GCL Compression]] pipeline for geometric encoding.
|
||||
Loading…
Add table
Reference in a new issue