~/talk

MCSat Approaches for Solving Non-linear Modular Arithmetic

links:none on file
slides:none on file

Presents two concrete MCSat-based solvers: PolySAT in Z3, a word-level bitvector solver that keeps variable domains as symbolic intervals, extracts forbidden intervals from linear occurrences, and already handles some 256-bit smart-contract patterns though many shapes still fall back to bit-blasting; and FFSAT prototype, a finite-field engine that builds explanations by eliminating the top variable using subresultant regular subchains (SRS) computed via Sage, compares against Gröbner-basis runs, and shows promise on random q benchmarks but currently struggles to scale to larger field sizes.

AI-written summary · about

  1. 0:00Start
  2. 2:30Solving polynomial equations
  3. 5:27MCSAT based approaches for non-linear modular arithmetic
  4. 8:20MCSat - Idea
  5. 15:37Variable Elimination
  6. 16:43Single incompatibility
  7. 18:05Coefficient based explanation generation
  8. 21:46Example: SRS
  9. 32:28Bitvector Pitfalls
  10. 34:04Solving Approaches
  11. 34:52Bitvector Constraints in PolySAT
  12. 36:51How to choose values?
  13. 39:00Forbidden Interval Lemma
  14. 40:57Conflict Resolution Strategy
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.