Distributed execution without a central broker

Investigating broker-free distributed compute through a concrete Rust mesh rather than abstract decentralization claims.

Research question

Can a peer mesh with gossip membership, sandboxed execution, and content-addressed artifacts provide useful distributed compute without a trusted scheduler?

Hypothesis

If membership and artifact identity are decentralized, useful workloads can still complete under intermittent connectivity — at the cost of harder trust and incentive problems.

Methodology

Prototype mesh (Chimera): gossip discovery, QUIC transport, Wasm job bounds, content-addressed results. Observe membership churn and job completion qualitatively on small peer sets.

Results

Early prototypes demonstrate the architectural loop. Systematic large-scale benchmarks are not published here — treat findings as exploratory, not validated production claims.

Limitations

Small peer counts, incomplete incentive/trust model, no independent third-party evaluation yet.