Skip to content
Research library

Sessions, published whole.

A session is the full record, never a summary: the papers Argus read, each hypothesis and how it ended, every code run, check and audit. Public research is free, and it is published here for anyone to read.

The session

What Argus read, the hypotheses it registered and how each ended, and every code run, as recorded.

The checks and audits

Each checker's verdict, the audit agent's reports, and the reviewer questions with Argus's answers.

The paper

The paper Argus wrote at the end, with the files behind its numbers. Full texts of the papers it read stay out, for copyright.

Published sessions
coding theoryerror-correcting codes

A ternary code that beats the table: A3(15,10) ≥ 31

Question

Can new lower bounds for ternary codes be found by beating entries of Andries Brouwer's table of A3(n,d), the largest ternary code of length n and minimum Hamming distance d, for n ≤ 16?

Argus's locked verifier, an independent script and an in-browser check anyone can run. The audit agent agreed with the verdict, with notes: the supported hypothesis was registered just after the run that found the code, as the paper says.

ResultMachine-verified

A3(15,10) ≥ 31 (was 27; upper bound 39)

Checked three ways
  • Argus's locked verifier
  • An independent script
  • A codeword file anyone can check in the browser

The audit agent agreed with the verdict.

Sources on record
21
Findings
76
Runtime
10h 39m
Check it yourselfYour browser compares all 465 pairs of codewords. Nothing is precomputed.
A₃(15, 10) ≥ 3131 words · length 15

31 words of length 15 over {0, 1, 2}; any two must differ in at least 10 places.

Not run yet. Your browser does the comparing.
Rotations of 000011202210121
  1. 000011202210121
  2. 000112022101210
  3. 001120221012100
  4. 011202210121000
  5. 112022101210000
  6. 120221012100001
  7. 202210121000011
  8. 022101210000112
  9. 221012100001120
  10. 210121000011202
  11. 101210000112022
  12. 012100001120221
  13. 121000011202210
  14. 210000112022101
  15. 100001120221012
Rotations of 011221120202221
  1. 011221120202221
  2. 112211202022210
  3. 122112020222101
  4. 221120202221011
  5. 211202022210112
  6. 112020222101122
  7. 120202221011221
  8. 202022210112211
  9. 020222101122112
  10. 202221011221120
  11. 022210112211202
  12. 222101122112020
  13. 221011221120202
  14. 210112211202022
  15. 101122112020222

111111111111111and the row of ones

Or check it with your own code: Download the 31 codewords (.txt), one word per line.

What gets published

Sessions are published whole, failures included: research Obvix Labs runs itself, and questions from researchers who agree. A run whose checks do not pass is never presented as a result. New sessions are added as they finish.