fix: resolve merge conflicts after cyb/ subgraph extraction

cyb/ pages deleted (moved to ~/git/cyb), proof.md kept concise HEAD version

Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>

Author: mastercyb

CLAUDE.md

@@ -71,7 +71,7 @@ Domain tags: `article`, `cybernomics`, `compound`, `ticker`, `person`,
 
 Never write `[[term]]s` with a floating `s` outside the link. Every
 concept page that has a meaningful plural must include both forms in its
-`alias::` line (e.g. `alias:: isomorphisms` on the `isomorphism` page).
+`alias:` line (e.g. `alias: isomorphisms` on the `isomorphism` page).
 Then link the plural directly: `[[isomorphisms]]` instead of
 `[[isomorphism]]s`. This keeps links clean and resolvable.
 ## Shell: Nushell
@@ -116,6 +116,7 @@ Scripts:
 - `analizer/trikernel.nu` — compute tri-kernel (diffusion, springs, heat) over wiki-link graph, write focus + gravity + density to frontmatter. Runs on new moon only (±1 day); use `--force` to override, `--dry-run` to preview
 
 - `analizer/dangling.nu` — alias-aware dangling wiki-link detector (basenames, paths, alias: frontmatter; case-insensitive; top 50 + stats)
+- `analizer/add-footer.nu` — append `discover all [[concepts]]` footer to core-tagged pages missing it
 - `analizer/codematter.nu` — add comment-frontmatter to code files (.rs, .nu, .toml, .py, .sh, .yml), integrating source into cybergraph as particles
 
 When adding a new script: place it in `analizer/`, accept `graph_path` as first

analizer/add-footer.nu

@@ -0,0 +1,23 @@
+def main [graph_path: string] {
+  let pages_subdir = if (($graph_path | path join "root") | path exists) { "root" } else if (($graph_path | path join "graph") | path exists) { "graph" } else { "pages" }
+  let pages_dir = ($graph_path | path join $pages_subdir)
+
+  let files = (glob $"($pages_dir)/**/*.md" | where {|f|
+    let content = (try { open --raw $f } catch { "" })
+    let has_core = ($content =~ "tags:.*core")
+    let has_discover = ($content =~ "discover all")
+    $has_core and (not $has_discover)
+  })
+
+  print $"found ($files | length) core pages without footer"
+
+  $files | each {|f|
+    let content = (open --raw $f | str replace -r '\s+$' '')
+    let new_content = ($content + "\n\ndiscover all [[concepts]]\n")
+    $new_content | save -f $f
+    let stem = ($f | path parse | get stem)
+    print $"  added footer: ($stem)"
+  }
+
+  print "done"
+}

root/$ETH.md

@@ -9,4 +9,16 @@ heat: 0.00014455737288700745
 focus: 0.00018005462472170703
 gravity: 7
 density: 0
----
+---
+
+$ETH is the native token of the [[Ethereum]] network, serving as the fundamental unit of value for gas fees, [[staking]], and economic security across the ecosystem.
+
+Validators stake $ETH to participate in [[proof of stake]] consensus, earning rewards for honest block production and facing slashing for misbehavior. Every transaction on [[Ethereum]] requires $ETH to pay for computational resources measured in gas.
+
+$ETH functions as pristine collateral across [[DeFi]] protocols, underpinning lending markets, liquidity pools, and synthetic assets. Its monetary premium derives from simultaneous utility as fee currency, staking yield asset, and collateral backbone.
+
+In the [[cyber]] ecosystem, $ETH is one of the external assets bridged into [[bostrom]] via [[IBC]] relayers. This bridge enables [[neurons]] to bring [[Ethereum]] liquidity into the [[cyber]] economy while maintaining exposure to the broader crypto ecosystem.
+
+The EIP-1559 burn mechanism makes $ETH deflationary under sufficient network demand, aligning the token economics with long-term value accrual for holders and [[staking]] participants.
+
+discover all [[concepts]]

root/Avogadro.md

@@ -0,0 +1,17 @@
+---
+tags: article
+crystal-type: measure
+alias: Avogadro's number, mole
+---
+
+# Avogadro
+
+Avogadro's number (6.022 x 10^23) defines the count of constituent particles in one [[mole]] of substance.
+
+Named after Amedeo Avogadro, this fundamental constant bridges atomic and macroscopic scales. One mole of [[carbon]]-12 atoms weighs exactly 12 grams, and each of those atoms contributes to the ensemble measured by this number.
+
+The constant enables [[chemistry]] to translate between individual molecular events and laboratory-scale quantities. Stoichiometric calculations, gas laws, and [[thermodynamics]] all rely on Avogadro's number as a unit-conversion anchor.
+
+In 2019, the SI redefinition fixed the value at exactly 6.02214076 x 10^23 mol^-1, removing its dependence on the kilogram prototype.
+
+discover all [[concepts]]

root/CAP theorem.md

@@ -2,7 +2,7 @@
 tags: comp, distributed systems
 crystal-type: entity
 crystal-domain: comp
-alias:: Brewer's theorem, CAP
+alias: Brewer's theorem, CAP
 ---
 # CAP theorem
 

root/CRDT.md

@@ -2,7 +2,7 @@
 tags: comp, distributed systems
 crystal-type: entity
 crystal-domain: comp
-alias:: CRDTs, conflict-free replicated data type, conflict-free replicated data types
+alias: CRDTs, conflict-free replicated data type, conflict-free replicated data types
 ---
 # CRDT
 

root/DAS.md

@@ -2,7 +2,7 @@
 tags: comp, data availability
 crystal-type: entity
 crystal-domain: comp
-alias:: data availability sampling
+alias: data availability sampling
 ---
 # DAS
 

root/G-Set.md

@@ -2,7 +2,7 @@
 tags: comp, distributed systems
 crystal-type: entity
 crystal-domain: comp
-alias:: G-Sets, grow-only set, grow-only sets
+alias: G-Sets, grow-only set, grow-only sets
 ---
 # G-Set
 

root/Kurt Goedel.md

@@ -2,7 +2,7 @@
 tags: person
 crystal-type: entity
 crystal-domain: cybics
-alias:: Goedel
+alias: Goedel
 stake: 7491202206265963
 diffusion: 0.00028856545926880816
 springs: 0.00024360512080315392

root/LogUp.md

@@ -0,0 +1,18 @@
+---
+tags: cyber, core
+crystal-type: pattern
+alias: logarithmic lookup, lookup argument
+---
+
+# LogUp
+
+A logarithmic derivative lookup argument used in [[starks]] and zero-knowledge proof systems.
+
+LogUp reduces table lookup verification to a single randomized check using logarithmic derivatives.
+The prover demonstrates that a multiset of queried values is contained in a predefined lookup table.
+This technique replaces expensive permutation arguments with summation-based polynomial identities.
+Efficiency gains make LogUp suitable for circuits with millions of lookup gates.
+Applications include range checks, hash function decomposition, and memory consistency proofs.
+Integration with [[cyber]] proof infrastructure enables scalable verification of [[cyberlink]] validity.
+
+discover all [[concepts]]