Boston Computation Club

Jenna DiVincenzo is an Assistant Professor in the Elmore Family School of Electrical and Computer Engineering @ Purdue University. She is broadly interested in research spanning software verification, programming languages, and software engineering, especially research aimed at making verification techniques and programming languages more usable and scalable. Today Jenna joined us to talk about her broad research program in gradual verification. This was a really interesting talk with great Q&A and we hope you enjoy it as much as we did!

Prashant Anantharaman is a long-time BCC group member and has presented as both a solo researcher and a panelist to prior events. Today he joined us to present some of his work with NARF, to appear at IEEE S&P, on generating grammars for fuzzing using LLMs. This is a super exciting new frontier for LLMs and LangSec generally and his talk was wonderful.

Ramit Das is a formal verification engineer at Intel and an avid Boston Computation Club group member. Ramit and I have been speaking for ages about formal methods, exchanging papers, etc. and today he finally agreed to come give a talk to the group about his area of expertise -- descriptive complexity. This was a really fun talk and an excellent introduction for anyone looking to get their feet wet with complexity theory, some language theory, and even a smidgeon of model theory and underpinnings of abstract interpretation. It was really fun and we can't wait to host another talk by Ramit sometime in the future!

Today Marc Denecker joined us to present How and Why to extend First Order Logic for Knowledge-Based Systems. This presentation provided the setup for a follow-on that Marc's student Simon Vandevelde is set to give on IDP-Z3, a formal reasoning machine that Marc and Simon have built. This was a really interesting talk touching on a variety of forms for formal logic, decision procedures, and industrial use-cases thereof, potentially with profound implications for the future and realizability of so-called AGI.

Today Daniel Melcer joined us to present Constrained Decoding for Code Language Models via Efficient Left and Right Quotienting of Context-Sensitive Grammars (https://arxiv.org/pdf/2402.17988). This is work he completed while at Amazon, and it's a really interesting project around how to constrain, guide, and check language models such that they generate valid code within a given context. We really appreciate that Daniel took the time to talk to us and hope you like the talk as much as we did!

Michael H. Borkowski is an Assistant Professor of Practice in the Department of Computer Science at Purdue University. Before joining Purdue, he earned his Ph.D. from the Department of Computer Science and Engineering at UC San Diego, where he was affiliated with the ProgSys Group. Today Michael joined us to discuss LiquidHaskell, a very cool project that incorporates a kind of refinement types, with SMT-based proofs, into Haskell. This was a really compelling talk and we hope you enjoy it as much as we did!

Today Brook Santangelo and John Sterrett

Gaspard Baye is a Cyber AI Ph.D. Candidate at the University of Massachusetts Dartmouth, where he researches AI-driven offensive and defensive security applications. Today Gaspard joined us to present "Hacking GenAI with LLM Red Teaming and Beyond" based on his recent DefCon talk. This was a really fun event with a great Q&A. Thanks to Jacob from the Trust Lab for hosting!

Navid Hashemi recently defended his PhD at USC and is about to begin a post-doc at Vanderbilt.  His research focuses on the intersection of Artificial Intelligence and Temporal Logics, with applications in Formal Verification of Learning Enabled Systems and Neurosymbolic Reinforcement Learning.  Today Navid joined us for a really exciting presentation about his work on metrizable logics for reinforcement learning, and a technique for verification thereof based on the over-approximation of reachable sets using ReLU.

Chengpeng Wangworking with Prof. Xiangyu Zhang. His research focuses on program analysis, especially software analysis, and in particular how existing analysis techniques intersect with emerging approaches from AI such as Large Language Models. Today Chengpeng joined us to talk about his recent NeurIPS paper proposing a novel static analysis technique based on LLMs. The technique is very interesting and highly informed by prior works in the static analysis space, but leverages LLMs as a kind of "oracle" to solve problems which, when handled statically, quickly become untenable. This was a really interesting talk and we're very greatful that Chengpeng took time out of his Sunday afternoon to talk to us!

Harry Eldridge is a Cryptography PhD student at Johns Hopkins, advised by Abhishek Jain and Matthew Green. His research (so far) touches on security and privacy implications of commodity hardware, which is a fascinating topic deserving of the mathematically disciplined, cryptographically informed approach his lab takes to such problems. Today Harry joined us to talk about his research into the problem of AirTag stalking, and how it can be ameliorated, while retaining acceptable performance, through cryptographic protocols. This was a very interesting talk with serious, real-world implications, and we hope you enjoy it as much as we did!

Ian Bicking is an engineer at Brilliant, which is also what he is. (Sorry, dad joke). Ian joined us today to talk about his super charming (and extremely interesting) weekend of experiments hacking various LLMs to solve puzzles using z3. The presentation was roughly the first 2/3 of the event and the remaining third presented a fantastic conversation about the future of AI, tool use, chain and tree of thought, o1, and more. Thanks again for joining us Ian!

Dhekra Mahmoudat LIMOS in Clermont-Ferrand, France, where she researches the formal analysis of cryptographic protocols under the supervision of Pascal Lafoucade and Jannik Dreier. Today Dhekra joined us to present her recent USENIX paper Shaken, not Stirred -- Automated Discovery of Subtle Attacks on Protocols using Mix-Nets. This was a really interesting presentation with a good conversation afterword touching on some subtler points around the Dolev-Yao threat model, the limitations of ProVerif, and proof optimization.

Matej Panciak holds a PhD in mathematics and is a software engineer at the Argument Computer Corporation, where among other things, he works on Lurk. Lurk is a LISP for defining computations that can prove (in the ZKP sense) that they ran, which is probably useful for all sorts of cool things we haven't thought of yet, but right now, is pretty important for doing stuff on-chain. (I can easily imagine this being applicable to building something like a dweb version of AWS ... in some theoretical future where FHE is so good that you can just trust randos to run code for you). Anyway, Matej presented a super rad intro to Lurk, gave us a code demo (it worked!) and then enjoyed our usual über-nerd conversational segment at the end.

Derek Egolf is a PhD student (since 2021) at Northeastern University, advised by Stavros Tripakis. His primary research focus is the automatic generation of correct-by-construction systems from high-level specifications (synthesis). Today Derek talked about his recent paper in this vein, Efficient Synthesis of Symbolic Distributed Protocols by Sketching, to appear in FMCAD. This was a very interesting talk with a technical conversation afterword. We hope you enjoy it as much as we did!

Joshua Ramette (https://x.com/RametteJoshua) recently completed a PhD in physics at Mass Tech, and today he joined us to talk about his new project, Undermind. Josh and his friend Tom Hartke (https://www.tomhartke.com/) founded Undermind (YC S24) to radically improve academic literature search using a mixture of AI techniques. Their system is slow, deliberate, and very high quality. You can check out Undermind at www.undermind.ai , or peruse the query I did during the Q&A section here: https://www.undermind.ai/query_app/display_one_search/c743b66ee4378b12ae8bad1fe58975ba95da71e7f7a1d5c2f0c6973c677648cc/

Evan Pu ( https://evanthebouncy.github.io/ , @evanthebouncy on X ) is a senior research scientist at Autodesk AI Lab, working on code-generation for human-machine collaboration in CAD, and industry scale instruction-following dataset annotation. Today Evan joined us from a toilet (with the lid closed) so as not to wake up his wife due to a rather large time-zone delta, which was hilarious and a first for the Boston Computation Club. Anyway, this was a really fun talk with excellent Q&A and we hope you enjoy it as much as we did!

Arthur O'Dwyer is a C++ programmer and blogger who today joined us to talk about his musings on the algebraic structure of the popular web-game Infinite Craft. Infinite Craft is a clever little experiment in sandboxed exploration, and it turns out to give rise to a rather complex mathematical structure with some interesting background in theoretical CS. Arthur covered all this and more in his presentation, which was super interesting and a lot of fun to watch. Check out Arthur's original blog post here: https://quuxplusone.github.io/blog/2024/03/03/infinite-craft-theory/ Check out Arthur's slides here: https://bstn.cc/artifacts/arthurODwyer/infiniteCraft.pdf

Evan Boehs is a HIGH SCHOOL STUDENT who broke the freaking internet.  What more do I need to say?  Hire this kid.  Maybe I will.  It's a race.   Evan made an npm package called everything which installs everything.  Then he got stuck in a dependency loop when someone tried to delete something.  It turns out this is a nearly impossible problem to solve and he totally broke npm.  Then a bunch of adults got made at him, when really, they should have been mad at themselves for building a bad system.   You can read Evan's full story here: https://boehs.org/node/npm-everything

June Marcuse

Adam Karvonen was my coworker at Galois and is a bright guy doing really interesting stuff in the ML interpretability space. Today he joined us to present his work on Chess-GPT, you guessed it, a GPT model that can play chess. The punchline isn't so much how good the model is as it is how the model "thinks" -- Adam provides compelling evidence that the model internally reasons about an actual board state, and learns to make legal moves. The discussion on this one was great and we really appreciate that Adam took the time to talk to us! Also -- you should hire him! He's doing MATS but will be on the job market at the end of the Summer.

Max Ammann is a cybersecurity researcher at Trail of Bits, where he's recently been working on extending his Master's thesis work on fuzzing cryptographic protocols into an industrial-grade fuzzing tool. That work resulted in an S&P publication which is what he joined us to present today. This was a really good talk but also a great discussion, in large part because of the highly engaged audience (with representation from Galois, TwoSix, and academia!).

For this event, Holmes Wilson of Fight for the Future moderated a panel retrospective on the Pegasus malware. Our panelists were: - Jonathan Rugman: Foreign Affairs Correspondent at Channel 4 News, BAFTA Award-winning journalist, visiting lecturer at University of London, and Senior Associate Fellow at RUSI. - Raya Sharbain: education and communities coordinator at the Tor Project, and digital rights activist at the Jordan Open Source Association as well as the Digital Arabia Network. - Elina Castillo Jimenéz: feminist human rights lawyer and digital activist at the Amnesty International Tech Lab. - Prashant Anantharaman: former speaker at the club who completed his PhD at Dartmouth under Sergey Bratus and now works at Narf Industires. And … - Hinako Sugiyama: international human rights lawyer and law professor at UC Irvine. This was one of our best events ever and well worth the listen.

Mathias Preiner is a Research Scientist at Stanford University in the Centaur lab. He is one of the main developers of the SMT solver Boolector (since June 2012) and Bitwuzla -- which is what he joined us to discuss today. This was a good talk, but an excellent Q&A, and we really enjoyed it. Thanks Mathias for joining us today, and to the awesome audience for showing up with such deep and technical questions!

Joe Kiniry is a computer scientist at Galois, specializing in Rigorous Systems and Software Engineering (Model-based Systems Engineering with Digital Twins), Hardware/Firmware Security, Trustworthy and Verifiable Elections, High-assurance Cryptography, and Audits-for-Good. He's also the Chief Scientist at Free & Fair, a Galois spin-off focused specifically on verified elections tech. Today Joe joined us for a Q&A focused specifically on his elections tech work, and it was a fun one! Joe is one of the more pragmatic and charismatic FM evangelists out there and I think this is an enormously compelling use-case for the tech. We really enjoyed the event and hope you do too!

Joe Shiraef is a professional card counter and indie game dev.  Today he joined us for a very fun, free-form conversation on advantage play, indie game development, avoid arrest, and pursuing your passions. https://www.inktalestudios.com/

Today puzzle-maker Roger Barkan joined us to talk about the creation and solution of cave puzzles, a category of puzzle for which he's quite famous as a puzzle author. Jacob lead the conversation, using an interactive puzzle that he implemented with the help of ChatGPT (:0), and it was a ton of fun. We're super grateful to Roger for joining us today and we look forward to doing a follow-up event sometime in the future! Jacob's interactive: https://bstn.cc/artifacts/jacobDenbeaux/cave.html Buy Roger's book (you know you want to!): https://www.barnesandnoble.com/w/colossal-cave-collection-roger-barkan/1125542215

Jan Hennecke is an engineer and roboticist in Boston, MA. Jan has been a buddy of mine for ages, ever since we met at the Bernardo Faria Jiu Jitsu Academy where he told me a hilarious story about placing top-3 in his first half ironman while munching down on snickers. Today Jan joined us to talk about his work at RBTX, a marketplace and platform for low-cost automation. This was a really fun talk with a lot of audience engagement and I think many of you will find it interesting!

Today Christian Williams joined us to talk about his dissertation project, Logic in Color.  This is a really exciting project which he is now working on post-graduation, which aims to re-frame the way we think about logic, and logics, using a largely visual medium.  The key insight is that certain mathematical observations are made completely obvious simply by adding color to the areas enclosed by arrows in monoidal string diagrams.  But from this key observation comes the more foundational view that really, all of mathematics and logic not only can be expressed visually, but in some sense, perhaps _is_ visual; that the medium is exposing something fundamental about the nature of thought itself.  This sounds a little pretentious but it's actually just the opposite: it's a fairly radical effort to _simplify_ logic and category theory using a visual medium.  And it's enormously exciting.  We were really happy Christian gave us this ground-floor view on his project and we're super excited to see where it develops.

Todd Schmidan Assistant Professor in the Computer Science Department of St. Mary's College of California. They are generally intereted in the algebraic, coalgebraic, and logical foundations of program semantics, and recently completed a PhD as a part of the PPLV group in the Computer Science Department of University College London. Today Todd joined us to talk about coequations, a fascinating (categorical) subject relating to the how we add algebraic structure to a space, how we think about relationships between spaces, and more. It turns out that coequations show up all over the place -- in DFAs, Markov chains, various PL concepts, etc. -- and so this is a place where the more abstract categorical stuff turns out to be really useful and illuminating for fairly concrete computer science ideas. Plus, coequations are just plain neat! We were really lucky to steal a little over an hour of Todd's time on this beautiful Saturday and we hope you enjoy the talk as much as we did.

Avijit Ghosh is a Research Data Scientist at AdeptID and a Lecturer in the Khoury College of Computer Sciences at Northeastern University. He's a good friend of mine and was an element of my PhD cohort at Northeastern. He's also a well-respected researcher at the intersection of machine learning, ethics, and policy. You can read about some of his innovative and cross-disciplinary work, for example, in the New York Times. David Widder is a Postdoctoral Fellow at the Digital Life Initiative at Cornell Tech, and earned his PhD from the School of Computer Science at Carnegie Mellon University. If you know me personally, you might remember David because he and I were simultaneously involved in parallel antics to fight non-consensual workplace sensors at CMU and NEU, respectively. Another funny coincidence is that David and I attended the same international boarding school program, called United World College. But most importantly -- David is a first-class researcher in the space of AI ethics. Fabio Tollon is a South African philosopher of technology, currently completing a post-doc at the University of Edinburgh.  Coincidentally, he taught a philosophy of science class that my fiancé took as an undergrad! Fabio's research focuses on developing a robust meta-ethical grounding in our approach to the ethics of AI. Without rigorous conceptual apparatus, Fabio argues (and we concur) that we will be lost in our ethical analysis of these emergent and ubiquitous artificial systems. TODAY, we hosted a wonderful panel discussion on AI ethics, with the above three panelists, and moderated by the long-time Boston Computation Club member, mathematician, and data-scientist Wei Sun. This was extremely informative, a lot of fun, and wildly interdisciplinary. Wei guided the discussion in a number of interesting discussions, and then the panelists fielded questions form the audience at the end. We didn't have enough time to answer everyone's questions but listeners are highly encouraged to email the panelists for follow-up :) . I'd like to thank all the panelists and Wei again for showing up and making this event the special moment in time that it was, and the diverse and highly engaged audience for participating in this project. This was a lot of fun and highly intellectually stimulating, and I hope we can do more events like this in the future.

Eli Sennesh is a recent graduate of the PhD program in computer science at Northeastern, in which I (Max) and many other BCC group members are currently enrolled. Eli's research is highly interdisciplinary, taking into consideration various topics in mathematics (statistics, measure theory, probability theory, optimization), programming language theory, and neuroscience, with the unifying goal of building useful probabilistic programming languages. Today Eli joined us to discuss that research, with a particular emphasis on important open problems -- problems which he intends to study as a post-doc! This was a fun one and an excellent introduction to the world of probabilistic programming, and we really appreciate that Eli took time out of his weekend to come talk to us. Eli's website: https://esennesh.github.io/ Eli's advisor's book on probabilistic programming: https://arxiv.org/abs/1809.10756

Bill Dalessandro is a philosopher of science and mathematics at Oxford University. Today Bill joined us to discuss proofs -- specifically, what it means for a proof to be fixable, what it means for a proof to be transferable, and the apparent tension between these notions. This work built on prior work by Northeastern's Don Fallis, who attended the talk and participated in the lively and fascinating conversation that ensued. We also discussed what it's like to work in an interactive theorem prover. In such an environment, you don't really make mistakes -- because the prover doesn't let you -- but you might prove the wrong thing, and/or, you might not learn much despite having proven something. This was a great talk with a great with a really strong discussion section and we hope you enjoy it as much as we did! - Bill's website - The paper in question

Today Nathaniel Mitchell and Dan Scott joined us from Intel to discuss the ChipSec project, an open-source platform security assessment framework, available at https://github.com/chipsec/chipsec .  Specifically, ChipSec "is a framework for analyzing the security of PC platforms including hardware, system firmware (BIOS/UEFI), and platform components" -- for both Windows and Linux (although as we discuss, getting it to work on Windows requires some leg-work).  This was a really interesting talk and it included a very impressive demo!  We learned a lot and we're very thankful that not just one but two busy engineers from Intel took the time to talk to us today about their fascinating software tool.

Bernardo Anibal Subercaseaux RoaMarijn Heule. He has a background in engineering and is passionate about mathematics and computer science. Bernardo's research attacks the following question from a variety of angles: what can and cannot be done (efficiently?) by a computer? Today, Bernardo joined us to talk about Packing Chromatic, a fascinating research area at the intersection of pure mathematics and SAT solving. Bernardo and his advisor recently solved an open problem in the space, finding the packing chromatic number for the infinite 2D grid. We discussed the proof and a bunch of related problems, including some intriguing (and open) questions about periodic vs aperiodic tilings. By the way, this work was also covered (briefly) in the NYT! (Not a lot of 2nd year PhD students get covered in the grey lady!!)

Bo Zhao is a 2nd year PhD student in computer science at UCSD, advised by Rose Yu. Her research focuses on deep learning theory and optimization, with a recent emphasis on the parameter space and dynamics of learning. Today Bo joined us to talk about her recent paper, "Symmetries, Flat Minima, and the Conserved Quantities of Gradient Flow", which was joint work at ICLR with Iordan Ganev, as well as co-authors Robin Walters, Rose Yu, and Nima Dehmamy. This is a really interesting paper which takes an algebraic approach to a problem typically only studied analytically. Bo gave a phenomenal presentation and then we had a really nice discussion with a variety of technical questions. We enjoyed this one a lot and we hope you do too!

Today Richard Blythman joined us to talk about the big and exciting world of large language models. Richard has a PhD in fluid dynamics and is the CEO of Algovera, a cool company building a decentralized and personalized tech stack based on LLMs. His talk today was short and focused, explaining what in particular makes LLMs so magical. Then we had a phenomenal discussion section! We hope you enjoy it as much as we did. To learn more about Algovera, go here: algovera.ai

Roger Waleffe is a PhD student in Computer Science at the University of Wisconsin-Madison working under the supervision of Prof. Theodoros (Theo) Rekatsinas (now at ETH Zurich). A few months ago one of our group members (Brennon) saw Rover's talk at EuroSys and thought it was pretty rad, so we invited Roger to give the same talk to the Club today. (You can decide, what's more prestigious, EuroSys or 6 random dudes from Boston?). Roger graciously agreed and gave a superb talk on MariusGNN, his recent work to make a blazingly fast, super resource efficient system for graph neural networks. We hope you enjoy the talk as much as we did!

Joel David Hamkins is a mathematician and logician at Oxford, where he studies the logic of the infinite. Today Joel joined us to talk about infinite dimensional games. As Joel explained, there are really three areas of mathematical inquiry related to games: Game Theory, as traditionally used in economics, ecology, etc.; the Theory of Games, which many CS students learn a little bit of in Complexity Theory; and the Logic of Games, which is really the camp where this talk falls. This was a totally intriguing talk in which pretty deep mathematical ideas naturally emerged from simple, playful premises. We really enjoyed it and we hope you do too! This talk is also available in video form, here.

Shriram Krishnamurthi is a professor of Computer Science at Brown University, where he researches (among other things) programming languages, software engineering, formal methods, HCI, security, and networking.  Today Shriram joined us to discuss his joint project with Kathi Fisler, Benjamin S. Lerner, and Joe Gibbs Politz, titled "A Data-Centric Introduction to Computing".  The project is a new vision of what it means to teach introductory computing with data as a first-class object, in the form of tables.  This was a really excellent talk with a lively discussion touching on data quality, student motivation and engagement, pedagogy, data visualization, the nature of computation both essentially and in social context, incorrect assumptions programmers make (about names, interfaces, data, etc.), and much, much more.  We had a lot of fun with this one and we hope you enjoy it too! By the way, you can watch the video version of this talk, HERE.

Christopher Ba Thi Nguyen is a professor of philosophy at the University of Utah, and the author of Games: Agency as Art. Today he joined us to discuss his book, which covers the philosophy of all sorts of games: rock climbing, Dark Souls, judo, poker, dungeons and dragons, etc. The event took the form of an interview hosted by Wei Sun, a longtime group member who read Thi's book in detail and really vibed with it. This was one of the most engaged and dynamic conversations we've hosted and in contrast to other events which have had a heavily visual component, this one is mostly auditory, so should make a very good podcast-style experience. We're very grateful to Thi for joining us today and to Wei for hosting the event, and we hope you enjoy it post-hoc as much as we did live! - The book: https://www.amazon.com/Games-Agency-As-Art-Thinking/dp/0190052082- Wei's blog: http://weiright.blogspot.com/2022/06/movie-review-everything-everywhere-all.html - Wei's blog: http://weiright.blogspot.com/2022/06/movie-review-everything-everywhere-all.html

Elizabeth Coppock is a linguistics professor at BU. He research focuses on foundational topics in truth, reference, quantification, and measurement in natural language semantics, through the lens of specific empirical puzzles. Recently, one of our group members (Cheng Zhang) expressed interest in Elizabeth's work as it might relate to his own research in programming languages, so we reached out to Elizabeth and asked if she'd be willing to present to the seminar group. (This is one of my favorite things about running the group: when a group member expresses interest in some research paper, we can simply invite the lead author to give a presentation!). Elizabeth graciously agreed and gave one of the best presentations we've had in months, full of fascinating real-world examples of the often surprising ways that we use "per" in the English language, and the underlying mathematical complexity of said usage. This was an enormously fun talk and we really hope you enjoy it as much as we did! And thank you again to Elizabeth for presenting!

Matthias is a world-class scientist and highly influential computer programmer, and also the author of "How to Design Programs", a Computer Science 101 book which takes a fundamentally different approach than prior works. Today Matthias joined us to share his experience writing that book (and its many iterations), as well as his broader philosophy on how to instruct the next generation of thinkers and builders (not to mention, programmers). This was a highly instructive and somewhat philosophical talk and we really hope you enjoy it as much as we did! To learn more about Matthias, refer here: https://felleisen.org/matthias/

eta is a phenomenally talented polymath, hacker, and computer programmer from the UK. Today eta joined us to discuss her very fun project reverse engineering UK rail tickets. This was a fun event with a reasonably big audience and lots of Q&A, and we really enjoyed it! It was also a good example of the best possible outcome in hacking: you break something, you tell the people who made the thing, and they give you a high-five and fix it. Thank you so much eta for speaking to us! To learn more about eta's work, refer to her website here: https://eta.st/

Molly White is a Northeastern alum, a software engineer, and now, a web3 researcher (researching all the stuff that stinks about web3, to be clear). Today Molly joined us to talk about her ongoing project and perhaps magnum opus, Web3 is Going Just Great (web3isgoingjustgreat.com), an ongoing history of all the grifts, thefts, hacks, and crashes in Web3/the broader blockchain ecosystem. This was a fun one - perhaps even a controversial one - and we hope you enjoy it!

Anthony Bonato is a Professor in the Department of Mathematics at Toronto Metropolitan University. Anthony's research focuses on graph theory, with applications to real-world complex networks and pursuit-evasion games on graphs such as Cops and Robbers. However, today Anthony joined us not to present some groovy new results in graph theory, but rather, to discuss how one _might_ give such a presentation, with panache! This was a super fun event with a lively and engaged discussion and we hope you enjoy it as much as we did. - Anthony's webpage: https://math.ryerson.ca/~abonato/ - Anthony's Twitter: https://twitter.com/Anthony_Bonato - This talk in video form: https://youtu.be/ZmLoQDWEZgg

Mel Andrews is an instructor and doctoral student in the department of philosophy at the University of Cincinnati. Their work focuses on the phenomena of cognition and life, comparing and contrasting the merits and explanatory scope of conceptual and formal models of life and mind, and exploring the implications of these considerations for science at large. Today Mel joined us to talk about the philosophy of math in science and mathematical models in scientific reasoning. How do models relate to the real world? When can models tell us something about ... anything other than their own mathematical substance? And perhaps most importantly, in the Q&A section, how can we build a formal mathematics for computer hacking

John Viega is the Executive Vice President of Products, Strategy, & Engineering at SilverSky, an Adjunct Professor at NYU Poly, former editor-in-chief for IEEE Security and Privacy Magazine, co-developer of GCM (a mode of operation for block ciphers such as AES), and the original author of Mailman, the GNU Mailing List Manager. He's also the founder of CrashOverride, a stealthy new security company which you should totally apply to work at! Today he joined us to do an impromptu Q&A about his storied career as one of the people on the ground floor of cybersecurity, in its messy and exciting start. This was a fun one and we hope you enjoy it as much as we did!

Annie Rauwerda is an internet personality and polymath with a background in neuroscience and data science. She is also the host and operator of Depths of Wikipedia, a phenomenally popular meme page, Depths of Wikipedia, which you can read about HERE on Wikipedia. Annie is also herself a frequent Wikipedia editor and author. Today she joined us to talk about how Wikipedia can be charming, funny, and informative, all at once. She showed us a variety of charming examples of Wikipedia in all its niche internet glory, and then answered a metric ton of questions about Wikipedia, the internet, Stack Exchange, etc. This was a super fun event and one we really enjoyed. We hope you enjoy it too!

LakYah Tyner is a 1st year PhD student at Northeastern University co-advised by abhi Shelat and Daniel Wichs. Her research focuses on cryptography, with recent works involving Property Preserving Hashing and Threshold Signature Schemes. Put differently, she's accomplished considerably more in less than a year of graduate school than I did as a first year (we're a semester in and she has a paper in Crypto!), and today she joined the Boston Computation Club to share some of that hard-earned wisdom. LakYah's talk focused on the difficult problem of efficiently hashing data such that the hashes preserve a binary predicate relationship from the pre-image, specifically a relationship relating to the distance between the two compared objects. This is a fascinating topic with implications for systems like Apple's facial recognition and attempts at privacy-preserving CSAM detection. We're super stoked LakYah agreed to speak to us today and we hope you enjoy her talk as much as we did! LakYah's website: https://www.khoury.northeastern.edu/home/lakyahtyner/index.html The paper: https://eprint.iacr.org/2022/842

William Kretschmer is a PhD student at the University of Texas Austin, advised by Scott Aaronson. He's one of these pseudo-celebrity-grad-students with lots of cool splashy results and we're stoked that he took the time to talk to us today. The talk primarily covered the basics of quantum cryptography, much of which should be familiar to regular group members who attended our quantum cafe series with Billy, but also concluded with some groovy quantum crypto history (see: quantum cash) and a discussion of exciting recent results by William & co. This is one of a series of cryptography related talks we're hosting this semester, and William started that series out with a bang! We hope you enjoy!