Today’s systems operate at huge scales, but meaningful computation remains essential at the scale of kilobytes, kilohertz, and nanowatts. We're gathering a small, interdisciplinary group of researchers, engineers, and practitioners to explore systems that operate outside the mainstream: vintage computers, weird machines, biological computing, and beyond.
To attend, just email lrc-group@dartmouth.edu that you're interested!
To lead a project or give a talk/lightning talk, email the following to lrc-group@dartmouth.edu:
- Who you are
- A short note (a few paragraphs) outlining what you'd like to talk about or work on and its impact on the future of constrained computing
- Your availability during the conference (August 16-19)
Please send presentation and project applications by July 15, 2026. Acceptances will be sent out by July 20, 2026. The workshop is free; travel and lodging will be covered based on our budget, with priority given to presenters.
Instead of a formal paper submission, we are asking for brief, informal pitches for talks or discussion sessions. Please keep it conversational! We are looking for talks that will spark debate over coffee, not just lectures. We look forward to hearing what you're working on and hope you'll join us to help define the science of sufficiency!
To get ideas flowing, we've been thinking about the following areas. Please treat these as inspiration, not as limitations. If you are working on something wild in the low-resource space that doesn't fit these boxes, we want to hear about it!
- In-Situ Modernization: How can we creatively hack memory vs. compute tradeoffs to upgrade legacy, rigid, or vendor-locked hardware?
- Strategic Sufficiency: Instead of asking how powerful we can make a system, how little does it actually need to succeed?
- Thriving in the Margins: What novel tasks become possible at the extreme edge or in austere environments?
- Persistent Compute: How do we design "deploy-and-forget" systems capable of running autonomously for a century?
We will be in touch shortly!