Provably Secure: Math Against Superintelligent Hackers

Name: Provably Secure: Math Against Superintelligent Hackers
Start: 2026-11-17T21:30:00+00:00
End: 2026-11-17T23:30:00+00:00
Location: Building 32 155

Make a free account to save this and get a reminder before it starts.Sign up

When: Tuesday, November 17, 20264:30 PM – 6:30 PM ESTAdd to calendar Google Calendar
Where: Building 32 15532 VASSAR ST, Cambridge, MA 02139Open in Maps
Hosted by: MIT Schwarzman College of Computing

Reminders arrive as notifications from the NextToU iPhone app. Get the app

Computer Science & TechHackathonsAI & Machine Learning

About

Worry is growing around AI agents escaping containment and acting against the interests of the organizations that built them. The latest LLMs are also finding cybersecurity vulnerabilities in important software at an alarming pace.

Against this backdrop, join the Social and Ethical Responsibilities of Computing on November 17 for a panel discussion exploring whether mathematical proofs could work to thwart superintelligent cyberattackers.

Bringing together experts from academia, government, and industry, the conversation will survey an old computer-science technique with new promise: formal verification, mathematical proof about the behavior of programs. Can such proofs be applied to important computing infrastructure, to guarantee agent containment and find all security bugs of certain kinds, future-proofing against more-powerful LLMs?

The panel will be moderated by Adam Chlipala, Arthur J. Conner (1888) Professor of Computer Science at MIT, and will feature Byron Cook, vice president and distinguished scientist at Amazon Web Services; Noah Evans, principal member of technical staff at Draper; and Armando Solar-Lezama, Distinguished Professor of Computing at MIT.

Open the original listing

This event is organized by MIT Schwarzman College of Computing, not by NextToU. Details come from a public MIT event listing and may change — check the original event for the latest information.