References

[1] A. Singh et al., "Evolution of AI agent registry solutions: Centralized, enterprise, and distributed approaches," arXiv preprint, arXiv:2508.03095v3, Oct. 2025.

[2] R. Raskar et al., "Upgrade or switch: Do we need a next-gen trusted architecture for the Internet of AI agents?" arXiv preprint, arXiv:2506.12003v2, Jul. 2025.

[3] Morgan Stanley, "Humanoids: A $5 trillion market," May 2025. [Online]. Available: https://www.morganstanley.com/insights/articles/humanoid-robot-market-5-trillion-by-2050

[4] Intercognitive Foundation, "Making the physical world accessible to AI," 2025. [Online]. Available: https://www.intercognitive.com

[5] R. Raskar et al., "Beyond DNS: Unlocking the Internet of AI agents via the NANDA index and verified AgentFacts," arXiv preprint, arXiv:2507.14263v1, Jul. 2025.

[6] J. Zinky, H. Seshadri, M. Lambe, P. Chari, and R. Raskar, "NANDA adaptive resolver: Architecture for dynamic resolution of AI agent names," arXiv preprint, arXiv:2508.03113, Aug. 2025.

[7] Market Reports World, "Game servers market size, share, growth, and industry analysis, by type (dedicated servers, virtual private servers, cloud game servers), by application (online gaming, game developers, esports), regional insights and forecast to 2033," Nov. 2025.

[8] S. Bonifield, "'A game, once sold, belongs to the customer': Prominent EU politician stands up for Stop Killing Games," PC Gamer, Jul. 13, 2025. [Online]. Available: https://www.pcgamer.com/gaming-industry/a-game-once-sold-belongs-to-the-customer-prominent-eu-politician-stands-up-for-stop-killing-games/

[9] L. Baird, "The Swirlds hashgraph consensus algorithm: Fair, fast, Byzantine fault tolerance," Swirlds Inc., Tech. Rep. SWIRLDS-TR-2016-01, May 2016.

[10] K. Crary, "Formal verification of the hashgraph consensus algorithm," Carnegie Mellon Univ., 2021. [Online]. Available: https://www.cs.cmu.edu/~crary/papers/2021/hashgraph.pdf

[11] L. Lamport, R. Shostak, and M. Pease, "The Byzantine generals problem," ACM Trans. Program. Lang. Syst., vol. 4, no. 3, pp. 382-401, Jul. 1982.