- September 20: Circuit minimization problem, presented by Valentine Kabanets
- September 27: Learning Algorithms from Natural Proofs, presented by Marco Carmosino
- October 4: Power from Random Strings, presented by Eric Allender
- October 11: On the (Non) NP-Hardness of Computing Circuit Complexity, presented by Cody Murray
- October 25: NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD Circuits, presented by Shuichi Hirahara
- November 1: Minimum Circuit Size, Graph Isomorphism, and Related Problems, presented by Andrew Morgan
- November 8: Hardness magnification near state-of-the-art lower bounds, presented by Igor Carboni Oliveira
- November 15: Open Problems Session
- November 29: A Closed Problem, presented by Avishay Tal