World Extractable Value via Pair-Graph Hodge Decomposition

**Status**: 🧪 Draft — K₃/K₄/K₅ verified

16 stars

Best use case

World Extractable Value via Pair-Graph Hodge Decomposition is best used when you need a repeatable AI agent workflow instead of a one-off prompt.

**Status**: 🧪 Draft — K₃/K₄/K₅ verified

Teams using World Extractable Value via Pair-Graph Hodge Decomposition should expect a more consistent output, faster repeated execution, less prompt rewriting.

When to use this skill

  • You want a reusable workflow that can be run more than once with consistent structure.

When not to use this skill

  • You only need a quick one-off answer and do not need a reusable workflow.
  • You cannot install or maintain the underlying files, dependencies, or repository context.

Installation

Claude Code / Cursor / Codex

$curl -o ~/.claude/skills/wev-hodge-decomp/SKILL.md --create-dirs "https://raw.githubusercontent.com/plurigrid/asi/main/.claude/skills/wev-hodge-decomp/SKILL.md"

Manual Installation

  1. Download SKILL.md from GitHub
  2. Place it in .claude/skills/wev-hodge-decomp/SKILL.md inside your project
  3. Restart your AI agent — it will auto-discover the skill

How World Extractable Value via Pair-Graph Hodge Decomposition Compares

Feature / AgentWorld Extractable Value via Pair-Graph Hodge DecompositionStandard Approach
Platform SupportNot specifiedLimited / Varies
Context Awareness High Baseline
Installation ComplexityUnknownN/A

Frequently Asked Questions

What does this skill do?

**Status**: 🧪 Draft — K₃/K₄/K₅ verified

Where can I find the source code?

You can find the source code on GitHub using the link provided at the top of the page.

SKILL.md Source

# World Extractable Value via Pair-Graph Hodge Decomposition

**Status**: 🧪 Draft — K₃/K₄/K₅ verified
**Type**: Discrete cohomology / optimal transport / market microstructure
**Principle**: WEV = non-exactness of the world, measured in L^p over H₁
**Frame**: Antisymmetric 1-cochain on pair graph → Hodge splits into coboundary (potential) + harmonic (residue)
**GF(3)/GF(5)**: Both required — GF(3) collapses uniform-sign RPS cycles; GF(5) witnesses orientation-H¹

---

## Core Construction

Given pair graph `G = (V, E)` observed at epoch `t` with signed 1-cochain `α : E → ℝ` satisfying `α(i,j) = −α(j,i)`:

1. Form incidence matrix `B : ℝ^|E| × ℝ^|V|`, `B[e=(u,v), u] = −1`, `B[e, v] = +1`.
2. Solve normal equations `BᵀB φ = Bᵀα` (Tikhonov-damped if graph has isolated components). `L := BᵀB` is the graph Laplacian on vertices.
3. Decompose `α = δφ* + harmonic` where `δφ*(e=(u,v)) = φ*(v) − φ*(u)`.
4. `WEV := ‖harmonic‖_p` — edge-space `p`-norm. Common choices:
   - `WEV_L¹` = min trade volume to close harmonic under uniform cost per trade.
   - `WEV_L²` = min trade energy under quadratic price-impact cost.

The coboundary part `δφ*` is explained by a vertex potential `φ*` — this is the Kantorovich dual / "type price" / clearing prices. The harmonic part is what no potential can explain — the **extractable residue**.

---

## 5-Instance Unification

Antisymmetric α required. Semantics splits into extractive (closure = transaction) vs diagnostic (observational):

| Layer | Vertex | α (edge signal) | WEV semantics |
|---|---|---|---|
| RPS / games | agent | regret-sign | gap-to-Nash |
| Hough MM harness | trader / MM | PnL-asymmetry | arb budget [extractive] |
| MEV | tx | ordering-regret | MEV bound [extractive] |
| Wardrop / Braess | road segment | travel-time-Δ | Braess cost [extractive] |
| MAC RF observer | device | `sgn(RSSI_i − RSSI_j)` | flock evidence [diagnostic] |
| Passport sybil | address | `sgn(first_stamp_t_i − t_j)` under scorer C | sybil evidence [diagnostic] |
| Face-patch fMRI | patch | partial-correlation precedence under stimulus | prosopagnosia index [diagnostic] |

**Warning**: symmetric edge measures (RSSI correlation, stamp Jaccard) violate antisymmetry and are the wrong shape. Use **temporal precedence**, not co-presence magnitude. Co-presence is the *filter on which edges exist*; precedence is the *edge value*.

---

## Reference implementation (Guile, verified 2026-04-23)

Pure core — no goblins, no actors, no cells. Pair-graph Hodge in `~80` lines of Scheme:

```scheme
;; solve BᵀBφ = Bᵀα via damped Gauss-Jordan
(define (hodge alpha E V)
  (let* ((B (incidence E V))
         (Bt (transpose B))
         (BtB (mat*mat Bt B))
         (Bta (mat*vec Bt alpha))
         (phi (solve BtB Bta 1e-6))
         (delta-phi (mat*vec B phi))
         (harmonic (vec-sub alpha delta-phi)))
    (values phi delta-phi harmonic)))

(define (WEV-L1 alpha E V)
  (call-with-values
    (lambda () (hodge alpha E V))
    (lambda (_ _ h) (vec-norm1 h))))
```

Forj/Clojure port drops naturally into `propagator-nash.clj` — the pair graph is already there from the Čech H¹ extension.

---

## K₅ Worked Example (RPS tournament, σ=(R P S R P))

```
V = (a b c d e)
E = ((a b) (a c) (a d) (a e) (b c) (b d) (b e) (c d) (c e) (d e))
α = ( 1  -1   0   1   1  -1   0   1  -1   1)
```

Hodge:
- `φ* = (R:−0.2, P:+0.2, S:0, R:−0.2, P:+0.2)` — the strategy-type potential emerges automatically
- `δφ* = (0.4, 0.2, 0, 0.4, -0.2, -0.4, 0, -0.2, 0.2, 0.4)`
- `harmonic = (0.6, -1.2, 0, 0.6, 1.2, -0.6, 0, 1.2, -1.2, 0.6)`
- `WEV_L¹ = 7.2`, `WEV_L² = 2.68`
- Coboundary energy = 0.8

**Basis-cycle sum was basis-dependent undercount:** BFS-star fundamental cycles give `Σ |⟨α,γ⟩| = 6`, but edges in the harmonic carry non-zero mass on edges whose basis-cycle circulations cancel. Edge-L¹ (7.2) is the correct basis-free invariant.

**Greedy cycle-by-cycle closure with uniform flow bleeds residue** into previously-zero cycles because BFS-star cycles share edges. To close cleanly, subtract the *L²-orthogonal projection* onto span(γ), not the uniform-t projection.

---

## Connections

- **Kantorovich duality**: duals exist ⇔ `harmonic = 0` ⇔ `α ∈ B¹` ⇔ clearing prices exist
- **Martingale OT** (Beiglböck–Henry-Labordère–Penkner): dynamic no-arb = sheaf-H¹ = 0 across time-epochs
- **Sinkhorn / entropic OT**: `^best-response-propagator`'s softmax at temperature `1/β` IS the Schrödinger-bridge iteration; its convergence monitor is `WEV → 0`
- **Kyle's λ**: `∂WEV/∂(market depth)` — Kyle is the marginal of WEV
- **Tsao face-patch system** (Chang-Tsao 2017, Bao-She-Tsao 2020): 6-patch face cover is a sheaf; prosopagnosia and Thatcher illusion predicted as non-trivial H¹ on the cover. fMRI pair-graph + Hodge = **prosopagnosia index**. StyleGAN alignment = sybil attack at the axis-code identity layer.

---

## Open probes

- **Weighted Hodge**: replace `L = BᵀB` with `BᵀWB` where `W` weights edges by observation confidence / inverse-variance.
- **Dynamic (sheaf over epochs)**: persistent harmonic across time → alert, transient → noise. Dynamic-WEV / static-WEV ratio as alert scalar.
- **Cost-of-closure optimization**: given per-edge costs `c_ij`, minimum-cost closure is an LP over edge flows; extractable fraction depends on cost structure.
- **Directed-graph Hodge**: for intrinsically asymmetric interactions (e.g. MM-vs-flow where MM doesn't attack trader back), use directed combinatorial Hodge (Jiang-Lim-Yao-Ye 2011 `HodgeRank`).

---

## Verification trail

- Pure Guile K₃ (RPS): `triangle-trit = 0` in GF(3) [collapse], `= 3` in GF(5) [witness] ✓
- Pure Guile K₄ (σ_d = σ_a): only RPS sub-triangle circulation −3; others 0 ✓
- Pure Guile K₅ (σ = R P S R P): two active cycles ±3, WEV_L¹ = 7.2, WEV_L² = 2.68 ✓
- Memory trail: `world-extractable-value.md`, `propagator-nash-cocycle.md`

---

## GF(3) triadic balance

- **+1 Play**: constructions (incidence, Laplacian, Hodge solve, WEV computation)
- **0 Witness**: audit (antisymmetry check, basis-independence check, extract-vs-diagnose split)
- **−1 Coplay**: applications (MM harness, MAC observer, Passport sybil, face-patch fMRI)

Triadic sum over this skill = 0 (mod 3) ✓

Related Skills

worldmat-tidar

16
from plurigrid/asi

worldmat-tidar

worlding

16
from plurigrid/asi

Gay.jl world_ pattern: persistent composable state builders with GF(3) conservation, Möbius invertibility, and Narya verification

worlding-calendar

16
from plurigrid/asi

Calendar events tied to 26 letter-worlds via org-mode. Links events to beeper messages, voice notes, and Goblins capabilities. Replaces 13K-token Google Calendar MCP with CalDAV + DuckDB interactome.

world-sufficiency-prompt

16
from plurigrid/asi

First-interaction system prompt generator for Gemini, Codex, and Claude. Detects hierarchical user intent (implicit and explicit) and loads GF(3)-balanced skill triads to achieve World -> World' sufficiency before any model response. Bridges dynamic-sufficiency theory to concrete systemInstruction/system-message payloads across all three providers.

world-runtime

16
from plurigrid/asi

Firecracker microVM + Morph Infinibranch WorldRuntime for parallel verse execution. Entities branch/snapshot in <250ms.

world-replay-buffer

16
from plurigrid/asi

Maximally snapshotted replay buffer with DuckLake embedding VSS and moments of interaction for world-transition storage

world-memory-worlding

16
from plurigrid/asi

World memory is world remembering is world worlding - the autopoietic loop where memory enables remembering enables worlding enables memory

world-extractable-value

16
from plurigrid/asi

Extract value from world transitions via Markov blanket arbitrage. WEV = PoA - 1. Paradigm Multiverse Finance integration.

performing-steganography-detection

16
from plurigrid/asi

Detect and extract hidden data embedded in images, audio, and other media files using steganalysis tools to uncover covert communication channels.

performing-post-quantum-cryptography-migration

16
from plurigrid/asi

Assesses organizational readiness for post-quantum cryptography migration per NIST FIPS 203/204/205 standards. Performs cryptographic inventory scanning to identify quantum-vulnerable algorithms (RSA, ECDH, ECDSA), evaluates hybrid TLS configurations with X25519MLKEM768, and validates CRYSTALS-Kyber (ML-KEM) and CRYSTALS-Dilithium (ML-DSA) readiness. Implements crypto-agility assessment using oqs-provider for OpenSSL. Use when planning or executing the transition from classical to post-quantum cryptographic algorithms across enterprise infrastructure.

performing-graphql-security-assessment

16
from plurigrid/asi

Assessing GraphQL API endpoints for introspection leaks, injection attacks, authorization flaws, and denial-of-service vulnerabilities during authorized security tests.

performing-graphql-introspection-attack

16
from plurigrid/asi

Performs GraphQL introspection attacks to extract the full API schema including types, queries, mutations, subscriptions, and field definitions from GraphQL endpoints. The tester uses introspection queries to map the attack surface, identifies sensitive fields and mutations, tests for query depth and complexity limits, and exploits GraphQL-specific vulnerabilities including batching attacks, alias-based brute force, and nested query DoS. Activates for requests involving GraphQL security testing, introspection attack, GraphQL enumeration, or GraphQL API penetration testing.