Regenerative Digital Infrastructure through Mycelial Economics
Building distributed systems that share resources like fungal networksβregenerative, resilient, and owned by communities.
Univrs.io advocates for publicly-funded cloud infrastructure where every person's data is stored safely and not owned by anyone else. We combine technology exploration with policy advocacy, drawing on mycelial economics principlesβdistributed coordination without centralized control.
- Data Sovereignty β Your data belongs to you, not corporations
- Regenerative Economics β Systems that increase capacity over time
- Decentralized Coordination β No central control points
- Democratic Governance β Community-defined algorithms
- Bioregional Integration β Economic flows connected to ecological health
univrs-site/
βββ index.html # Homepage
βββ vision.html # Mission & mycelial principles
βββ technology.html # Tech stack (Holochain, hREA, Cyclos...)
βββ evidence.html # Real-world examples (Sardex, Mondragon, WIR)
βββ roadmap.html # Implementation phases
βββ collaborate.html # How to contribute
βββ resources.html # Books, tools, organizations
βββ css/
β βββ styles.css # Design system
βββ js/
βββ main.js # Interactions & animations
- Fork this repository
- Connect to Cloudflare Pages
- Configure build settings:
- Build command: (none required for static)
- Build output directory:
/
- Deploy
# Clone the repository
git clone https://github.com/YOUR-USERNAME/univrs-site.git
cd univrs-site
# Serve locally (any static server works)
npx serve .
# or
python -m http.server 8000Design:
- Pure HTML/CSS/JS (no build step)
- CSS custom properties for theming
- Dark/light mode support
- Responsive mobile-first design
- Scroll-triggered animations
Typography:
- Syne (display)
- Crimson Pro (body)
Aesthetic:
- Organic bioluminescence theme
- Mycelial network canvas animation
- Inspired by forest floor with glowing accents
We welcome contributions! See collaborate.html for ways to help:
- Technical Development β Rust, Holochain, distributed systems
- Economic Modeling β Research, analysis, game theory
- Community Organizing β Pilot deployments, facilitation
- Policy & Advocacy β Government relations, coalition building
- Fork the repo
- Create a feature branch (
git checkout -b feature/amazing-improvement) - Make your changes
- Commit (
git commit -m 'Add amazing improvement') - Push (
git push origin feature/amazing-improvement) - Open a Pull Request
- CryptoSaint.io β Mycelial economics framework
- book.univrs.io β Technical documentation
- Holochain β Agent-centric distributed computing
- ValueFlows β Economic vocabulary standard
MIT License β See LICENSE for details.
- Email: ardeshir.org@gmail.com
- GitHub: @univrs
"Every person deserves to have their data stored safely and not owned by anyone else."
π Building infrastructure of the people, by the people, for the people.
This is a fantastic find for the Univrs.io vision. PlanetServe addresses exactly the infrastructure scaling problem youβve been working on, and its architecture has remarkable alignment with mycelial economics principles. Let me break this down and map the integration points.
PlanetServe is a decentralized overlay network for LLM serving that solves the scalability bottleneck facing small organizations and researchers who canβt afford or access centralized cloud infrastructure. The key insight is treating idle computing resources across organizations as a shared commons.
Four Core Research Problems Solved:
- Overlay Network Organization - Dynamic user nodes form peer networks, model nodes contribute GPU resources, and a verification committee ensures quality through BFT consensus
- Anonymous Communication - A novel hybrid of Onion routing and Secure Information Dispersal Algorithm (S-IDA) that splits messages into βclovesβ across multiple paths, achieving both privacy and resilience
- Overlay Forwarding via Hash-Radix Trees - A distributed data structure for KV cache sharing across nodes without centralized coordination, reducing latency 40-50%
- Reputation-Based Verification - Sampling-based verification using perplexity scoring to detect dishonest model nodes, with reputation scores that decay faster for bad behavior than they accumulate for good behavior
Performance Results:
- 50%+ latency reduction compared to non-sharing baselines
- 95%+ delivery success rate even with 3% node failure rates
- Confidential Computing adds only ~1ms overhead
- Works across consumer and datacenter GPUs
The convergence with your Univrs.io vision is striking:
| PlanetServe Mechanism | Mycelial Economics Equivalent |
|---|---|
| Reputation scores based on contribution quality | Credit creation through verified contribution |
| Resources flow to nodes with available capacity | Abundance-based distribution patterns |
| No central scheduler - emergent coordination | Decentralized coordination without hierarchy |
| Verification committee with BFT consensus | Transparent, auditable governance algorithms |
| Contribution credit proportional to resources shared | Mathematical reward for ecosystem participation |
Your existing StateStore trait architecture can incorporate their reputation scoring:
pub trait ReputationStore: StateStore {
async fn update_reputation(
&self,
node_id: &NodeId,
epoch: Epoch,
credit_score: f64, // Normalized perplexity from verification
) -> Result<ReputationScore, StoreError>;
async fn apply_punishment(
&self,
node_id: &NodeId,
window: &[f64], // Sliding window of scores
gamma: f64, // Punishment threshold
) -> Result<ReputationScore, StoreError>;
}Their formula: R(T) = Ξ±Β·R(T-1) + Ξ²Β·C(T) with asymmetric punishment maps directly to mycelial credit scoring where reputation influences resource allocation priority.
The HR-tree data structure solves a problem youβll face with distributed container scheduling - how to route workloads to nodes with relevant cached state without centralized knowledge. Adaptation for RustOrchestration:
- Instead of KV cache prefixes β Container image layers and configuration states
- Instead of prompt matching β Workload affinity matching
- Load Balance Factor β Already aligns with your MutualCreditScheduler concept
Their (n,k) threshold scheme where k-of-n cloves reconstruct messages could secure:
- Credit transactions between nodes
- Sensitive workload specifications
- Ecological impact data that shouldnβt be visible to individual nodes
Their Tendermint-based BFT committee provides a template for:
- Auditing node behavior against protocol expectations
- Maintaining canonical reputation/credit state
- Preventing Sybil attacks through credential verification
What worked for them:
- Reputation punishment >> reward asymmetry (ensures consistent good behavior)
- Delta updates for distributed state (vs. full broadcasts) - 10x reduction in network cost
- Session affinity for consecutive requests (preserves cache benefits)
- Ξ³ = 1/5 punishment threshold detected dishonest nodes within 5 epochs
What they explicitly defer:
- Model partitioning across nodes (complementary research)
- Blockchain integration (they use lighter BFT but note blockchain adds transparency/auditability)
- Non-text modalities
PlanetServe validates several of your core architectural bets:
- Rust for distributed systems - Their entire prototype is Rust-based, confirming performance/safety alignment
- Contribution-based resource access - Their incentive model where contribution credit determines what you can deploy is essentially mutual credit for compute
- Decentralized verification is tractable - 45+ verifications/minute on high-end hardware, 20+ on standard - sufficient for production networks
- Consumer hardware is viable - They explicitly show 20x cost reduction vs. AWS using consumer GPUs
The paper also provides academic validation language you could incorporate into the a16z pitch - this is published research (arXiv, appears headed for a systems venue) demonstrating that decentralized AI infrastructure achieves competitive performance.