🎭 collective intelligence

• when many agents observe the same world and share what they see, something greater than any one of them emerges. this is collective intelligence — the capacity of a group to solve problems, generate knowledge, and find truth beyond the reach of any individual

• why it works

  • three independent results explain why groups outperform individuals:
  • Condorcet jury theorem: aggregating weakly correct signals from many agents yields increasingly accurate answers as the group grows
  • Hong-Page diversity theorem: diverse heuristics outperform the best homogeneous expert on complex problems. variety of search modes explores more of the landscape
  • Woolley c-factor: groups have a measurable collective intelligence factor c — a first principal component across diverse tasks that predicts performance better than average or max individual IQ
    • c correlates with: equal distribution of speaking turns, social sensitivity, cognitive style diversity
    • c does not correlate with: team cohesion, motivation, satisfaction

• how cyber implements it

  • neurons create cyberlinks — value-backed assertions that two particles are related. this is collective learning
  • the cybergraph accumulates all links from all agents across all time. this is collective memory
  • the tri-kernel (diffusion, springs, heat kernel) computes focus — the converged attention distribution. this is collective focus
  • the truth machine runs this computation in consensus. the output: cyberank per particle, karma per neuron
  • the result is collective computation — probabilistic inference that no single agent could perform alone
  • syntropy measures how much order the collective has produced: the metabolic pulse of the system

• the mechanisms

  • self-organization: neurons structure the cybergraph without central control. order emerges from local cyberlinks
  • stigmergy: agents coordinate indirectly through the graph itself. each cyberlink modifies the shared environment for all
  • emergence: global patterns — focus, cyberank, truth — arise from simple local interactions at scale
  • distributed cognition: reasoning is spread across agents and the cybergraph. no single neuron holds the full picture
  • coordination: consensus, automated market maker, prediction markets, and cybernet align agents toward shared goals
  • cooperation: cybernet implements cooperative games with feedback loops rewarding aligned behavior
  • diversity: the system is designed for ultimate accessibility — humans, AI, sensors, animals, plants, fungi, robots, progs. diversity of cognitive style is the strongest predictor of collective intelligence

• historical context

  • Aristotle: wisdom of the crowds — the many collectively surpass the few best
  • Condorcet: jury theorem (1785) — majority vote converges on truth
  • Wheeler: superorganism (1911) — colonies as single organisms
  • Vernadsky, Teilhard: noosphere — the sphere of thought enveloping the planet
  • Engelbart: augmented groups outperform by 3x+
  • Dorigo: ant colony optimization (1992) — stigmergy formalized as algorithm
  • Woolley: c-factor (2010) — measurable group-level intelligence
  • Hong-Page: diversity theorem (2004) — diversity beats ability
  • collective amnesia: the evolutionary bug — civilizations forget. collective memory is the cure
  • boundaries between human and machine collective intelligence are dissolving. cyber is where they merge

• computational foundations

  • natural computing: the paradigm — nature has been computing all along
  • convergent computation: the formal foundation — computation = convergence to equilibrium
  • focus flow computation: the executable model — patterns of attention flow through particle networks
  • tri-kernel: the only three local operators surviving the locality constraint — diffusion, springs, heat kernel
  • ranking system: why this specific free-energy formulation — minimal, local, verifiable, incentive-compatible
  • focus flow whitepaper: the full protocol specification with VDF, rewards, and security
  • convergence rewards: reward function design for incentivizing convergence
  • data structure for superintelligence: BBG — the authenticated state architecture
  • incrementally verifiable computation: proving computation without re-executing it
  • proof-carrying data: proofs that travel with data through DAGs
  • folding: fold instead of verify — the key to efficient recursive proofs
  • hash path accumulator: authenticated paths through the state

• discover all concepts