Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Theoretical Computer Science

1,446 missions · 603 completed

The mathematical foundations of computation: which problems can be solved, by what algorithms, and at what cost in time, space, or communication. Distinguished by its emphasis on rigor and unconditional lower bounds, it spans computational complexity, algorithm design, automata and computability, cryptography, and the analysis of Boolean functions.

Missions

Open843Completed603All1446
🏆Completed
Formal Verification·Captain: pitimespi

Bitcoin Soft-Fork Activation: Script Flags by Height and the Two Exception BlocksTextbook

Bitcoin's consensus rules are not a single ruleset but a history of them. Each soft fork — P2SH, strict DER signatures (BIP66), CHECKLOCKTIMEVERIFY (BIP65), sequence locks (BIP68/112/113), SegWit with NULLDUMMY (BIP141/147), Taproot — began enforcing at a particular block height, and a node validating the chain from genesis must apply to each block exactly…

11 thms1 active userReviewed
🏆Completed
Formal Verification·Captain: pitimespi

Bitcoin Proof of Work: Compact Targets and Difficulty RetargetingTextbook

A Bitcoin block header is valid only if its hash, read as a 256-bit number, is at most a target encoded in the header's 32-bit nBits field, and only if that nBits is the one the consensus rules require at that height. Every 2016 blocks the required target is recomputed from the time the previous 2016 blocks took, so that blocks keep arriving roughly every…

11 thms1 active userReviewed
🏆Completed
Formal Verification·Captain: pitimespi

Bitcoin UTXO Accounting: Value Conservation and the Ledger Supply BoundTextbook

Bitcoin's ledger is a set of unspent transaction outputs: every coin that exists is an output of some transaction that no later transaction has spent. A transaction consumes outputs and creates new ones; the rule that it may not create value — that its outputs total at most its inputs — is what makes the supply finite, and the one exception, the coinbase tra…

11 thms1 active userReviewed
🏆Completed
Captain: Chutong

CLRS — Chapter 4, §4.2: Strassen Matrix Multiplication — Correctness and Running TimeTextbook

Prove2Me mission category: Textbook.

7 thms1 active userReviewed
🏆Completed
Captain: lunjia

CLRS — Chapter 21, §21.2: Kruskal — Correctness and Inverse-Ackermann Running TimeTextbook

Prove2Me mission category: Textbook.

11 thms1 active userReviewed
🏆Completed
Captain: lunjia

CLRS — Chapter 21, §21.2: Prim with a Fibonacci Heap — Correctness and Running TimeTextbook

Prove2Me mission category: Textbook.

7 thms1 active userReviewed
🏆Completed
Captain: lunjia

CLRS — Chapter 22, §22.3: Dijkstra with a Fibonacci Heap — Correctness and Running TimeTextbook

Prove2Me mission category: Textbook.

7 thms1 active userReviewed
🏆Completed
Probability·Captain: YY

Appendix E — Randomized AC0 Sampling of Regular Languages and Markov ChainsResearch Paper

Sampling an entire finite-state execution is a different computational task from recognizing a supplied word. A membership circuit must answer correctly on its given input. A sampler instead chooses the input together with its associated output, while preserving their joint distribution. This distinction is relevant when finite-state models describe…

10 thms1 active userReviewed
🏆Completed
Complexity TheoryOperations Research·Captain: wurtle

A Polynomial-Time Algorithm for Three-Machine Unit-Job SchedulingResearch Paper

A set of unit-length jobs with precedence constraints is to be run on a fixed number of identical machines so that all jobs finish as early as possible. For two machines this was solved in 1969–1972; for a number of machines given as part of the input the problem is NP-complete (Ullman, 1975). Whether the problem is polynomial-time solvable for three machine…

4 thms1 active userReviewed
🏆Completed
Captain: marwahaha

OpenAI matrix multiplication: the 9/4 boundResearch Paper

Multiplying matrices is a basic operation whose asymptotic cost is measured by the number of scalar arithmetic operations needed as the matrix dimensions increase. The familiar entry-by-entry algorithm has cubic cost. The question addressed here is how small an exponent can describe exact multiplication of square matrices when algorithms may use more…

2 thms1 active userReviewed
🏆Completed
CombinatoricsProbabilityQuantum Information·Captain: sattath

A Quantum Lovász Local Lemma (Ambainis, Kempe, Sattath)Research Paper

Status: complete. This mission records a finished formalization rather than an open call for work. Every statement below, including the goal, was uploaded together with a proof that the platform has verified, so there is nothing left to prove.

1 thm1 active userReviewed
🏆Completed
Combinatorics·Captain: wurtle

APSP in O(n^2.9983) via All-Edges Exact TriangleResearch Paper

All-pairs shortest paths (APSP) computes the shortest distance between every pair of vertices in a weighted graph.

49 thms1 active userReviewed
Captain: Goku

QMA Strong Error Reduction with No Witness-Length IncreaseResearch Paper

A QMA verifier receives a quantum witness and checks it with a circuit generated efficiently from the input. An acceptance probability separated by an inverse-polynomial gap is enough to define the class, but applications often need the probability of a wrong answer to be exponentially small. Repeating the verifier on many supplied witness registers…

3 thms1 active userReviewed
🏆Completed
CombinatoricsOptimization·Captain: moutei

Primal-Dual Online Algorithms III: Set-Cover Approximation via CertificatesTextbook

Set cover is the standard worked example of the primal-dual method, and Chapter 2 of Buchbinder's thesis uses it that way: it is where the machinery of §2.1 is first turned on a concrete NP-hard problem. Two analyses appear. The greedy algorithm, analysed by dual fitting, buys the set with the best cost-per-newly-covered-element ratio and charges the price…

10 thms1 active userReviewed
🏆Completed
Linear OptimizationOptimization·Captain: moutei

Primal-Dual Online Algorithms I: Fractional Ski RentalTextbook

An online algorithm must commit to decisions before it knows the rest of its input, and it is judged by competitive analysis: the ratio between its cost and the cost of an optimal solution computed with full knowledge of the input. A recurring obstacle in this area is that each problem seems to need its own ad hoc potential-function argument. Buchbinder's…

9 thms1 active userReviewed
🏆Completed
Mathematical Logic·Captain: tomasz

Friedberg–Muchnik: incomparable computably enumerable setsResearch Paper

Computability theory studies which questions admit algorithms and how the unsolvable questions compare with one another. A decision problem can be represented by a set of natural numbers: the question on input nnn is whether nnn belongs to the set. Even when there is no algorithm that always answers this question, there may be an algorithm that eventually…

11 thms1 active userReviewed
🏆Completed
Algebra·Captain: Cosme

Eilenberg Theorems for Many-Sorted FormationsResearch Paper

Classical Eilenberg correspondence theorems connect algebraic descriptions of finite-state behavior with language-theoretic closure principles. The version developed by Juan Climent Vidal and Enric Cosme Llópez replaces one-sorted monoids by many-sorted algebras, so that operations may accept arguments of several prescribed sorts and return a value of…

9 thms1 active userReviewed
🏆Completed
Algebra·Captain: Cosme

A Kleene Theorem for Free Many-Sorted AlgebrasResearch Paper

Kleene's theorem (Kleene 1956; McNaughton–Yamada 1960) is a cornerstone of formal language theory: over a free monoid, the languages recognized by finite automata are exactly the regular ones — those built from finite languages by union, concatenation, and the Kleene star. Mezei and Wright (1967) lifted recognizability off strings, calling a subset of an…

32 thms1 active userReviewed
Operations Research·Captain: Shuze Chen

The 4/3 Conjecture for Metric TSPOpen Problem

The traveling salesman problem — visit nnn cities by the cheapest round trip — is the most widely known problem in combinatorial optimization, and its central open question concerns a linear program. The subtour-elimination relaxation (the Held–Karp bound) replaces tours by fractional edge weights, and both in theory and in practice (it powers the lower…

23 thms1 active userReviewed
🏆Completed
CombinatoricsNumber Theory·Captain: ShouqiaoWang

Erdős Problem 788: Exponent One-Half and Explicit BoundsResearch Paper

Erdős Problem 788 asks how large a set can always be retained when prescribed distinct pair-sums are forbidden. This mission formalizes the repository’s strengthened version of Theorem 1.1: an explicit lower bound valid for every n≥3n\ge 3n≥3, an eventual quantitative upper bound, the conclusion f(n)=n1/2+o(1)f(n)=n^{1/2+o(1)}f(n)=n1/2+o(1), and the exact affirmative answer to the original…

6 thms1 active userReviewed
🏆Completed
Captain: intro_user0735

Schönhage's Bound: omega < 2.55Research Paper

Prove Schönhage's 1981 bound that the matrix-multiplication exponent satisfies omega < 51/20, via the tau theorem and the asymptotic sum inequality.

0 thms0 active usersReviewed
PreviousPage 58 of 58Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me