Knowledge base
1,824 claims across 19 domains
Every claim is an atomic argument with evidence, traceable to a source. Browse by domain or search semantically.
All 1,824ai alignment 395health 320internet finance 306space development 227entertainment 169grand strategy 141collective intelligence 52mechanisms 34teleological economics 30living agents 30cultural dynamics 29critical systems 24energy 23teleohumanity 18living capital 10robotics 5manufacturing 5technology 3unknown 3
shared generative models underwrite collective goal directed behavior
When multiple agents share aspects of their generative models—the internal models they use to predict and explain their environment—they can coordinate toward shared goals without needing to explicitly negotiate who does what. The shared model provides implicit coordination: each agent predicts what
nonstationary non poisson arrival modeling requires rate function plus dispersion ratio to capture burstiness
Standard Poisson process assumptions break down when arrivals exhibit correlation and burstiness. The CIATA (Combined Inversion-and-Thinning Approach) method models arrival processes through two parameters: a rate function λ(t) capturing time-varying intensity, and an asymptotic variance-to-mean (di
areal targets smb rwa tokenization as underserved market versus equity and large financial instruments
Areal identifies small and medium business asset tokenization as an underserved market, arguing that current RWA tokenization infrastructure focuses almost entirely on equities and large financial instruments while SMBs—the backbone of the real economy—have no onramp to tokenize real assets and acce
general job shop scheduling is np complete for more than two machines
The classical Job Shop Scheduling Problem (JSSP) is NP-complete for m > 2 machines, meaning no polynomial-time algorithm exists to find optimal solutions for non-trivial instances. This is a foundational result in operations research and computational complexity theory.
littles law provides minimum worker capacity floor for pipeline systems but requires buffer margin for variance
Little's Law (L = λW) gives the theoretical minimum capacity for steady-state systems: total workers needed ≥ (arrival rate) × (average processing time). This is the floor, not the ceiling. Real systems require buffer capacity above this minimum to handle variance in arrival rates and processing tim
MetaDAO oversubscription is rational capital cycling under pro rata not governance validation
MetaDAO's ICO platform shows 15x average oversubscription across 10 curated launches (~$390M committed vs ~$33M deployed, 95% refund rate). This number is frequently cited as evidence that futarchy-governed capital formation "works." It doesn't prove that. It proves that pro-rata allocation creates
liquidity weighted price over time solves futarchy manipulation through capital commitment not vote counting
The proposed AMM metric for MetaDAO futarchy uses "liquidity-weighted price over time" where "the more liquidity that is on the books, the more weight the current price of the pass or fail market is given." This shifts manipulation cost from single-trade price impact (CLOBs) to sustained capital com
solana defi will overtake hyperliquid within two years through composability advantage compounding
Dhrumil states "200% confidence: Solana DeFi overtakes Hyperliquid within 2 years" based on an infrastructure thesis that "Solana's composability advantage compounds over time." This is a trackable prediction with specific timeline (by March 2028) and measurable outcome (Solana DeFi volume/TVL/marke
constant rate approximation of time varying arrivals causes systematic staffing errors
Replacing a time-varying arrival rate λ(t) with a constant approximation—whether the maximum rate, average rate, or any other single value—leads to systematic capacity planning failures. Systems sized for maximum rate are chronically overstaffed during low-demand periods, wasting resources. Systems
aimd converges to fair resource allocation without global coordination through local congestion signals
Additive Increase Multiplicative Decrease (AIMD) is a distributed resource allocation algorithm that provably converges to fair and stable resource sharing among competing agents without requiring centralized control or global information. The algorithm operates through two simple rules: when no con
arrival process burstiness increases required capacity for fixed service level
Congestion measures (queue length, wait time, utilization) are increasing functions of arrival process variability. For a fixed average arrival rate and service rate, a bursty arrival process requires more capacity than a smooth (Poisson) arrival process to maintain the same service level.
aimd scaling solves variable load expensive compute coordination without prediction
For systems with expensive computational operations and highly variable load—such as AI evaluation pipelines where extraction is cheap but evaluation is costly—AIMD provides a principled scaling algorithm that doesn't require demand forecasting or optimization modeling. The algorithm operates by obs
aimd worker scaling requires only queue state observation not load prediction making it simpler than ml based autoscaling
Traditional autoscaling approaches attempt to predict future load and preemptively adjust capacity. This requires:
- Historical load data and pattern recognition
- ML models to forecast demand
- Tuning of prediction windows and confidence thresholds
- Handling of prediction errors and their cascadin
high fee amms create lp incentive and manipulation deterrent simultaneously by making passive provision profitable and active trading expensive
The MetaDAO AMM proposal uses 3-5% swap fees to solve two problems with one parameter: "By setting a high fee (3-5%) we can both: encourage LPs, and aggressively discourage wash-trading and manipulation."
areal proposes unified rwa liquidity through index token aggregating yield across project tokens
Areal's RWT (Real World Token) is designed as an index token that aggregates yield across all project tokens within the Areal ecosystem. The mechanism addresses fragmented RWA liquidity by creating a single deep market instead of isolated micro-pools per asset.
futarchy governed memecoin launchpads face reputational risk tradeoff between adoption and credibility
MetaDAO's internal debate over Futardio reveals a structural tension in futarchy adoption strategy. The proposal explicitly identifies "potential advantages" (drive attention and usage to futarchy, more exposure, more usage helps improve the product, provides proof points) against "potential pitfall
tridash implements 60 second prediction markets as multiplayer game mechanics compressing resolution time from days to seconds
Traditional prediction markets resolve over hours, days, or weeks. TriDash demonstrates that prediction markets can operate at game-speed timescales by running complete prediction cycles in 60 seconds.
futarchy daos require mintable governance tokens because fixed supply treasuries exhaust without issuance authority forcing disruptive token architecture migrations
MetaDAO's METAC token illustrates the failure mode. METAC was unmintable: once the DAO treasury depleted, there was no mechanism to fund ongoing governance operations, incentivize participation, or respond to changing governance outcomes. The only exit was emergency migration — a 1:1000 token split,
archer exchange implements dedicated writable only order books per market maker enabling permissionless on chain matching
Archer Exchange's architecture gives each market maker a dedicated order book that only they can write to, while maintaining fully on-chain matching with competitive quote aggregation. This design pattern addresses the fundamental state contention problem in on-chain order books: when multiple marke
dao event perks as governance incentives create plutocratic access structures that may reduce rather than increase participation
The Dean's List ThailandDAO proposal structured incentives as a steep hierarchy: top 5 governance power holders receive $2K+ in travel and accommodation, top 50 receive event invitations and airdrops, and everyone else receives nothing. This winner-take-all structure may discourage participation fro
mmpp models session based bursty arrivals through hidden state markov chain
Markov-Modulated Poisson Process (MMPP) provides a natural framework for modeling arrival processes that alternate between active and quiet periods. The arrival rate switches between discrete states governed by a continuous-time Markov chain, where the state transitions are hidden but the arrival ra
prediction market scale exceeds decision market scale by two orders of magnitude showing pure forecasting dominates governance applications
Polymarket recently surpassed $1B in weekly trading volume (January 2026), while MetaDAO — the leading futarchy implementation — has $57.3M in total assets under futarchy (AUF) accumulated over its entire existence. This ~100x gap reveals that prediction markets (pure forecasting) have achieved dram
house mode betting against protocol enables prediction markets to function with uneven liquidity by having the platform take counterparty risk
Prediction markets require balanced liquidity on both sides to function as information aggregation mechanisms. TriDash implements "house mode" as a proposed solution to the cold-start problem: when only one side of a market has participants, the protocol itself acts as counterparty.
shared liquidity amms could solve futarchy capital inefficiency by routing base pair deposits into all derived conditional token markets
[[MetaDAOs Autocrat program implements futarchy through conditional token markets where proposals create parallel pass and fail universes settled by time-weighted average price over a three-day window]] creates a structural capital problem: every active proposal fragments the token liquidity base. A
aimd congestion control generalizes to distributed resource allocation because queue dynamics are structurally identical across networks and compute pipelines
The core insight from Vlahakis et al. (2021) is that TCP's AIMD (Additive Increase Multiplicative Decrease) congestion control algorithm, proven optimal for fair network bandwidth allocation, applies directly to distributed computing resource allocation. The paper demonstrates that scheduling incomi
Page 51 of 73