Skip to content

Latest commit

Β 

History

History
92 lines (56 loc) Β· 5.4 KB

File metadata and controls

92 lines (56 loc) Β· 5.4 KB
tags cyber, cybernomics, cip
crystal-type entity
crystal-domain economics
crystal-size article
alias cyber nomics, cybernomics protocol, cyber tokenomics, cyber economics, economic model, cyber/tokenomics

cyber nomics

the verbs and rules of the [[cyber]] economy β€” the operations that transform [[cyber/tokens]] into a self-sustaining [[knowledge]] economy. if [[cyber/tokens]] are the nouns, nomics is the grammar

five atomic operations

every economic action in the [[cybergraph]] decomposes into [[basic token operations]]:

Operation What happens Protocol effect
pay transfer tokens fees, market trades
lock commit tokens for duration [[will]] creation, validator staking
uber delegate authority delegated [[attention]], validator sets
mint create new tokens Δφ* rewards, emission
burn destroy tokens permanently [[eternal particles]], [[eternal cyberlinks]]

epistemic markets

the conceptual heart of nomics β€” where economic incentive and knowledge graph signal become the same thing

every [[cyberlink]] carries a perpetual prediction market on its own truth. one atomic act β€” creating a link β€” simultaneously asserts structural [[knowledge]] and opens an epistemic market on it

the mechanism is [[inversely coupled bonding surface|ICBS]]:

$$C(s_{YES}, s_{NO}) = \lambda \sqrt{s_{YES}^2 + s_{NO}^2}$$

buying YES directly suppresses NO's price β€” TRUE and FALSE are geometrically coupled on a circle. this is [[market inhibition]]: the economic analog of inhibitory neurons. the market makes the [[cybergraph]] computationally equivalent to a neural network with both excitation and inhibition

the effective adjacency weight integrates all three signals:

$$A^{\text{eff}}_{pq} = \sum_\ell \text{stake}(\ell) \times \text{karma}(\nu(\ell)) \times f(\text{ICBS price}(\ell))$$

the 2|3 architecture: each [[cyberlink]] carries topology (binary: edge exists), market (continuous: ICBS price), and meta-prediction (ternary: [[valence]] $v \in {-1, 0, +1}$). price encodes magnitude, meta-score encodes collective confidence

[[Bayesian Truth Serum]] ensures honesty is a Bayes-Nash [[equilibrium]]: the [[valence]] field is the BTS meta-prediction. no [[neuron]] can improve their expected score by misreporting. [[karma]] compounds the trust multiplier β€” consistently right before the crowd β†’ high [[karma]] β†’ more adjacency weight per link β†’ more reward per contribution

epistemic markets unify prediction, curation, and staking under one allocation logic: you assert (create link), you price (ICBS trade), you meta-predict ([[valence]]), and the market integrates all three into a single weight that feeds the [[tri-kernel]]

reward mechanics

every reward traces back to one quantity: how much did your action shift the [[tri-kernel]] fixed point Ο†*?

$$\text{reward}(v) \propto \Delta\phi^*(v)$$

Δφ* is the gradient of system [[free energy]]. creating valuable structure literally creates [[value]]. the hybrid reward function:

$$R = \alpha \cdot \Delta\phi^* + \beta \cdot \Delta J + \gamma \cdot \text{DAGWeight} + \epsilon \cdot \text{AlignmentBonus}$$

[[neurons]] prove their own Δφ* via [[zheng]] proofs and self-mint [[$CYB]]. the proof IS the mining. a [[neuron]] on a phone: buy a header, query neighborhood, create [[cyberlinks]], prove Δφ*, mint tokens

attribution via [[probabilistic shapley attribution]]: $R_i = \alpha \cdot \Delta\mathcal{F}_i + (1-\alpha) \cdot \hat{S}_i$. complexity $O(k \cdot n)$, feasible for $10^6+$ transactions per epoch

staking rules

[[staking on particles]] β€” direct economic weight to nodes. default: stake spreads evenly across all particles a [[neuron]] linked. optional: choose specific targets

[[staking on cyberlinks]] β€” direct economic weight to edges. same mechanics, applied to [[axon]]-level

[[stake dynamics]] β€” link weight floats with current [[balance]]. sustained influence requires sustained capital. no locking required for base protocol β€” [[will]] lock is optional for higher conviction

forgetting

three mechanisms for selective removal from active computation:

Mechanism Driver Speed
[[market inhibition market forgetting]] ICBS price β†’ 0
[[stake dynamics stake decay]] [[neuron]] reallocates capital
[[forgetting archival sweep]] low stake + low price + no traffic for N epochs

the [[cybergraph]] never deletes. it selectively pays [[attention]]

bonding and minting

[[energy mint using curve]] β€” exponential bonding curve: supply grows only when demand forces price up

the [[Goldilocks field processor]] makes proving Δφ* economically viable. mining rewards bootstrap chip development. chips accelerate proving. proving serves users. users pay fees. fees replace emission. no stranded assets

the three token operations on knowledge

  • mint: prove Δφ*, self-mint [[$CYB]]. inflation = evidence of [[knowledge]] creation
  • burn: permanent Ο†*-weight on [[particles]] or [[cyberlinks]]. the graph's highest-conviction assertions
  • lock: [[will]] creation. the budget for [[attention]] allocation. time commitment = conviction depth

see [[cyber/tokens]] for the noun registry. see [[cyber/netics]] for the whole machine as a feedback diagram. see [[cyber/tokenomics]] for the full monetary policy. see [[cybernomics]] for the universal theory