🗿 SAT solver wrappers for Kotlin
-
Updated
Mar 2, 2024 - Kotlin
🗿 SAT solver wrappers for Kotlin
Looking for solutions of certain sizes with Glucose, Kissat and CaDiCaL
A collection of tools to study the inversion or collision of truncated versions of MD4, MD5, SHA-256 with SAT solving using techniques such as Cube-and-Conquer, programmatic SAT, Dobbertin's Attack, and differential cryptanalysis.
Mathematical formalization and C++ CNF encoder mapping Minesweeper board states to Boolean Satisfiability (SAT) for automated deduction using industrial solvers (CaDiCaL). Developed for Logic for Computer Science at UFCA.
Sudoku solver using CaDiCaL SAT solver
Automorphism group classification and symmetry breaking for Conway's 99-graph (srg(99, 14, 1, 2)) via Lean 4 formalization and certified SAT refutations.
SAT + verified LRAT certificate for a covering-system lower bound (Erdős #273), plus a segmented sieve extending verified ranges for #385 and #647 to 1.0011e12
Undergraduate research project: encoding the Untouchable 11 puzzle as SAT and comparing three CNF encodings (pairwise, hybrid channeling, sequential counter).
A length-22 permutation that three stacks in series cannot sort, with a machine-checkable DRAT certificate. Superseded by Pantone-Vatter (2026).
Testing boolean expressions for equivalence
To associate your repository with the cadical topic, visit your repo's landing page and select "manage topics."