All blogs / Algorithms / data structures
Wonderings of a SAT geek
A blog about SAT solving and cryptography
- Posts
- 155 from 12 Sep 2008 to 3 Oct 2026
- Posting
- now and then (3 in the last year)
- Kind
- personal blog
- Feed
- https://www.msoos.org/feed/
2026 3
2025 3
2024 3
2023 2
2022 4
2021 1
2020 1
2019 4
2018 5
2017 4
2016 6
2015 8
2014 12
- Faster cleaning of the learnt clause database
- TreeLook and transitive reduction
- On using less memory for binary clauses in lingeling’s watchlists
- CryptoMiniSat 4.2 released
- SMT Competition’14 and STP
- Multi-threading and startup speed
- Final polish of my SAT competition entry
- My SAT Competition 2014 entry
- Multi-threading
- Why it’s hard to eliminate variables
- CryptoMiniSat 4 released
- Speeding up MiniSat with a one-liner
2013 15
- On variable renumbering
- A note on learnt clauses
- MiniSat in your browser
- My SAT solver fuzzing setup
- Why CryptoMiniSat 3.3 doesn’t have XORs
- Handling disconnected components
- CryptoMiniSat 3.3 released
- Clause glues are a mystery to me
- CryptoMiniSat 3.2.0 released
- GCC 4.5.2 at the SAT Competition’13
- Certified UNSAT and CryptoMiniSat
- A variable elimination improvement
- CryptoMinisat 3.1 released
- CryptoMiniSat 3.0 released
- On benchmark randomization
2012 8
2011 19
- Thoughts on SAT@home
- CCC Camp’11
- Failed literal probing and UIP
- Note to self: higher level autarkies
- Learnt clause graphs
- Fun facts about SAT solving (part 1)
- CryptoMiniSat won two gold medals at SAT Comp’11
- Dreaming up a parallel SAT architecture
- Understanding Implication Graphs
- Presentation at Hackito Ergo Sum
- Come to Hackito Ergo Sum’11
- Recovering XORs from a CNF
- CryptoMiniSat in SAT Competition’11
- Visiting Linz
- Delayed updates
- On the New Watchlist Scheme
- CryptoMiniSat 2.9.0 released
- Changing the Watchlist Scheme
- The variable speed of SAT solving
2010 52
- Extended resolution is working!
- CCC madness
- Distributed SAT solving is fun
- Hyper-binary resolution: I was wrong, again
- Dependent Literals
- Caching
- The Cathedral
- Implicit binary clauses
- Wasting cluster time
- CryptoMiniSat 2.7.1 released
- Configuration management at IRILL days
- Open source software? Free software?
- Documenting CryptoMiniSat
- Transitive OTF self-subsuming resolution
- anf2cnf script released
- anf2cnf hell in Sage
- Reinventing the wheel
- FPGA programming and SAT
- Creating a SAT solver from scratch
- Truth table to ANF conversion
- CryptoMiniSat 2.6.0 released
- On-the-fly self-subsuming resolution
- Self-subsuming resolution
- Asymmetric branching
- Propagating faster
- Stats on CryptoMiniSat’s development
- Winning the SAT Race
- The 2010 SAT Conference
- ANF to CNF conversion
- How to bit-stuff pointers
- Propagating binary clauses
- Optimisations, take two
- The Obvious Child
- Why programs fail
- Being dumb is part of the deal
- I must be dumb
- On failed literal probing
- Gaussian elimination is released
- Parallelisation
- Social coding
- Blocked clause elimination implies dependent variable removal
- CryptoMiniSat v2 finally released
- On PrecoSat
- Optimisations
- Tools that I often use
- 216
- A great essay on security in the cyberworld
- The dates of the SAT Race 2010 have been announced!
- On research in general
- Why CryptoMiniSat can’t use MATLAB to do Gaussian elimination
- Could monomials be handled natively from SAT solvers?
- CryptoMiniSat v2