pith. sign in

arxiv: 2304.03039 · v3 · pith:KMR7MGORnew · submitted 2023-04-06 · 💻 cs.DM · math.CO

A computation of D(9) using FPGA Supercomputing

classification 💻 cs.DM math.CO
keywords valuefilefpgaverifiedacceleratoravailablebuildingclaim
0
0 comments X
read the original abstract

This preprint makes the claim of having computed the $9^{th}$ Dedekind Number. This was done by building an efficient FPGA Accelerator for the core operation of the process, and parallelizing it on the Noctua 2 Supercluster at Paderborn University. The resulting value is 286386577668298411128469151667598498812366. This value can be verified in two steps. We have made the data file containing the 490M results available, each of which can be verified separately on CPU, and the whole file sums to our proposed value.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Automating Boundary Filling in Cubical Type Theories

    cs.LO 2024-02 conditional novelty 7.0

    Presents solvers for contortion (via poset maps for Dedekind/De Morgan) and Kan problems (via CSP) in cubical type theory, implemented in Haskell and demonstrated on Eckmann-Hilton.