

CIMC Hackathon: Coherence Maximizing Algorithms
Back again, with a new theme: Coherence Maximizing Algorithms.
Many minds, many nodes, many columns. Coherence Maximizing Algorithms asks how distributed processes — neurons, agents, models, machines — arrive at shared structure without a central conductor. Drawing on neuroscience, distributed systems, and machine learning, the question is: what does it take for many parallel processes to agree on something, and what kinds of agreement matter?
We invite you to build, prototype, or theorize systems where coherence is the central problem — distributed training and inference, consensus algorithms for ML, multi-agent convergence, or related work across any medium.
The criterion is not the sophistication of the components, but the quality of the agreement: your system should make consensus do real work.
Schedule:
10:00 AM — Socialize
10:25 AM — Joel Dietz summarises previous hackathons and projects to work on
10:30 AM — Talk by Joscha Bach from CIMC
11:00 AM — Talk by Trent McConaghy from OceanProtocol
11:30 AM — Hacking Begins!
4:00 PM — Judging (Prize for winning projects 🎉)
Current CIMC Repos:
https://github.com/cimcai/bff-explorer
https://github.com/cimcai/ants-philip
https://github.com/cimcai/spirits