<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Proof Assistants on AmeyArc</title><link>https://amey-thakur.github.io/tags/proof-assistants/</link><description>Recent content in Proof Assistants on AmeyArc</description><generator>Hugo -- 0.152.2</generator><language>en-us</language><lastBuildDate>Fri, 20 Nov 2026 09:00:00 -0500</lastBuildDate><atom:link href="https://amey-thakur.github.io/tags/proof-assistants/index.xml" rel="self" type="application/rss+xml"/><item><title>A Whole Table Row in One Natural Number: Kernel-Checked Dynamic Programming with a Proved Width Bound</title><link>https://amey-thakur.github.io/posts/2026-11-20-a-whole-table-row-in-one-natural-number/</link><pubDate>Fri, 20 Nov 2026 09:00:00 -0500</pubDate><guid>https://amey-thakur.github.io/posts/2026-11-20-a-whole-table-row-in-one-natural-number/</guid><description>A proof assistant checks a computation by reducing it, so the data structure a verified algorithm is written over decides the cost of being checked, not only the cost of running. This paper measures that cost for one task with a locked specification: counting the partitions of n in Lean 4, where the answer must come with a machine-checked proof that holds for every n. Three designs compute the same recurrence. Evaluating the specification as written performs 672,182 primitive steps at n = 36, because every path to a table cell re-derives it.</description></item></channel></rss>