{"schema":"postcutoff/person@1","as_of":"2026-11-21T13:34:00+01:00","url":"https://postcutoff.com/person/virginia-vassilevska-williams/","md":"https://postcutoff.com/person/virginia-vassilevska-williams/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"human editor","policy":"https://postcutoff.com/about/"},"license":null,"id":"virginia-vassilevska-williams","name":"Virginia Vassilevska Williams","aliases":[],"kind":"researcher","role":"Professor of computer science, MIT","orgs":["MIT"],"role_as_of":"2026-10-06","role_source":"https://arxiv.org/abs/2610.06783","importance":3,"why":"Leading fine-grained complexity researcher; co-author of the Oct 2026 paper refuting the 3SUM and APSP hypotheses with an algorithm found by Claude.","accounts":{"x":"","x_other":[],"website":"","wikipedia":"","scholar":"","github":"","youtube":"","bluesky":"","substack":""},"roles":[],"bio":"","verified":"2026-10-06","same_as":[],"counts":{"entries":3,"posts":0,"videos":0},"entries":[{"id":"2026-11-06-k-clique-hypothesis-refuted-vassilevska-williams-zamir","url":"https://postcutoff.com/e/2026-11-06-k-clique-hypothesis-refuted-vassilevska-williams-zamir/","date":"2026-11-06","date_precision":"day","short_title":"k-Clique hypothesis refuted (Vassilevska Williams, Zamir, ChatGPT-6)","deck":null,"takeaway":"A central hypothesis of fine-grained complexity said k-Clique cannot be solved faster than about n^(ωk/3). A new preprint gives an n^((ω/3 − c)k) algorithm for every large k, and attributes its key algebraic lemma 'almost-purely' to ChatGPT-6 working from OpenAI's ETH manuscript.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":4,"official":4,"filed":"2026-11-14","updated":"2026-11-15","orgs":["MIT","Tel Aviv University","OpenAI"]},{"id":"2026-10-06-openai-matrix-multiplication-omega-9-4","url":"https://postcutoff.com/e/2026-10-06-openai-matrix-multiplication-omega-9-4/","date":"2026-10-06","date_precision":"day","short_title":"OpenAI proves ω ≤ 9/4 for matrix multiplication","deck":null,"takeaway":"Family 107 of OpenAI's 6 Oct 2026 release proves that two n × n matrices can be multiplied with O(n^(9/4+ε)) arithmetic operations, the largest drop in the exponent in decades; the best bound before was ω < 2.371177, set in August 2026 with AlphaEvolve. The 13-page proof is non-constructive and comes with a Lean formalization. By 21 Oct, Amanov, van den Berg and Zuiddam had re-proved it over every field and Rafael Pass had given an explicit construction. The resulting algorithms are galactic and give no practical speedup.","category":"science","category_label":"Science & math","importance":5,"confidence":"medium","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":13,"official":9,"filed":"2026-10-29","updated":"2026-10-29","orgs":["OpenAI"]},{"id":"2026-10-05-claude-refutes-3sum-apsp-hypotheses","url":"https://postcutoff.com/e/2026-10-05-claude-refutes-3sum-apsp-hypotheses/","date":"2026-10-05","date_precision":"day","short_title":"Claude discovers an algorithm that refutes the 3SUM and APSP hypotheses","deck":"Truly subquadratic 3SUM and truly subcubic APSP (Alman & Vassilevska Williams, Lean-verified)","takeaway":null,"category":"science","category_label":"Science & math","importance":5,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":4,"official":3,"filed":"2026-10-06","updated":"2026-10-13","orgs":["Anthropic","Columbia University","MIT"]}],"posts":[],"videos":[]}