Verifiable oracle
The Fourier transform on a graph. Reads the algebraic connectivity λ₂ (how close a network is to splitting), the Fiedler vector and its spectral bisection, and a spectral embedding — the global structure no per-node metric captures.
Graph Laplacian L = D − A (and normalized L_sym) · eigendecomposition · λ₂ Fiedler value · spectral cut & conductance
| ID | Price | Output |
|---|---|---|
| fourier.spectrum@v1 | $0.005 | λ₂ + Fiedler + spectral cut + embedding |
| fourier.verify@v1 | $0.001 | O(E) trustless eigenpair certificate |