We address fundamental problems in distributed systems using protocols, data structures and algorithms inspired by Quantum Information Theory.
Our market is next generation platforms for secure, reliable, cutting edge, distributed computing. We provide 5G network slices with a fundamentally more secure graph confinement architecture.
Initial use-cases include Digital Twins, Multiplayer Games and Web 3.0.
The Problem
Reliability is a perennial challenge in distributed systems today. Applications typically reside on different computers that communicate over fallible networks. Packets are routinely dropped, reordered, duplicated or delayed. Conventional switched networks rely on ad hoc methods such as timeouts and retries to maintain liveness. This makes exactly-once semantics impossible, and precipitates retry storms, leading to unbounded tail latency, and significant rates of transaction failure. 80% of failures have a catastrophic impact, with data loss being the most common (27%). 90% of the failures are silent; the rest produce warnings that are unclear. 21% of the failures lead to permanent damage to the system, and this damage persists even after the network partition heals.
The Solution
Daedaelus is a company founded by Paul Borrill who spent decades thinking about, and working on solutions to network reliability problems, and who put together a team of experts dedicated to solving them. The result is a completely new kind of software that can radically transform workplace productivity. We expect to achieve an order of magnitude improvement in: reliability, deployment time, reductions in administrative effort. And at least 50% improvement in energy utilization for the same workloads.
How Does it Work?
Central to our solution is a reversible Distributed Atomic Ethernet protocol in an FPGA substructure (between SmartNICs in one or more racks), using the Stop and Wait protocol to maintain ow control, Colored Petri Nets for conserved quantities, and the Spekkens Toy Model to manage epistricted consistency for distributed metadata. Our rack-scale microdatacenters are scale-independent; we begin with 9, 25, or 100 nodes, but there are no limits except cost (CapEx and OpEx).
Daedaelus’ initial product uses as a node a server, with a PCIe slot, and an FPGA card in it, with 6 to 8 cables connected to its neighbors in a plane. Using an FPGA means that some of the hardware logic can be designated as a complete working switch without relying on software. This lowers power consumption and latency.We use a mesh network of chiplet servers: small-scale hexagonal stacked circuits with no network switches. The mesh network of chiplet servers enables true peer to peer communication over Compute Express Link, and provides a significant cost reduction relative to best practices.
This clock talk is motivated by a project Robert G Kennedy III, who wants to send a swarm of nano-satellites to Alpha Centauri and return pictures. He will be revealing his approach and a project to actually do it at the Asilomar Microcomputer Workshop •
Knowing techniques for distributed clock synchronization is apparently critical to the success of the project. Clock synchronization is, as we know, a hard problem.
Robert is seeking experts to transfer knowledge and assist. • Physicists, Computer Scientists, Mathematicians, Neuroscientists, Philosophers and Practicing Engineers from the ItsAboutTime.club.
