The two certificates for n = 10 are not included (the DRAT proofs are about 420 MB and 390 MB).
They are produced deterministically by the search code (Glucose 4.1 through python-sat 1.9.dev15):

    sh regenerate_n10.sh                  # runs the two commands below and prints the sha256

    cd ../search
    python3 certify.py 10 9               # about 70-80 s; writes bigcerts/n10_D9.cnf and .drat
    python3 certify.py 10 9 orientable    # about 65-70 s; writes bigcerts/n10_D9_orientable.cnf and .drat

(certify.py also runs tools/drat_check2 on the result, so build the checkers first, see ../README.md.)
A rerun from a clean copy of the search code reproduced all four files bit for bit:

file                        bytes        sha256
n10_D9.cnf                  1637577      eb31f84fda4abbc907a672d74e97cdc815c8d1efdbbd9f05bb35ea5ac70a46f9
n10_D9.drat                 420508265    981f0ccea17976710a4f242624938dcd393b57e8cd0854d7fbf3bfce90a2daa6
n10_D9_orientable.cnf       1684455      a9c517ef3717ab275e2862fd9c5e9f68cd0dc953136f06c0c7337f108dc56646
n10_D9_orientable.drat      390126062    bfb60eca8e1a40ee109ad694d3a048d607c651c612be72447173422c1ce879be

(The same four hashes were recorded when the certificates were first produced.)

Checks of these four files (outputs in ../audit/outputs/n10_checks.txt):
  * search/tools/drat_check2 (forward DRAT, deletions applied): s VERIFIED for both
    (1609977 and 1448064 lemmas checked, RAT: 0).
  * audit/rupcheck.c with deletions applied (-d): s VERIFIED for both (about 2 min each).
  * audit/rupcheck.c with deletions ignored: s VERIFIED for both (about 16-19 min each).
  * audit/cnf_audit.py: n10_D9.cnf = base encoding E(10,9) (95426 clauses) + 2098 link cuts;
    n10_D9_orientable.cnf = E_or(10,9) (97946 clauses) + 2014 link cuts; AUDIT PASS for both.
