HackerPapers

arXiv:2304.03039cs.DM

A computation of D(9) using FPGA Supercomputing

Lennart Van Hirtum, Patrick De Causmaecker, Jens Goemaere, Tobias Kenter, Heinrich Riebler, Michael Lass, Christian Plessl

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.

arXiv comments
Journal reference
DOI
Subjects
cs.DMDiscrete Mathematics math.COCombinatorics

On Hacker News

Linked by 2 identifiable commenters in 2 comments across 1 thread, from Jun 2023 to Jun 2023.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. Ninth Dedekind number discovered: long-known problem in mathematics solved 2 comments

    • the van Hirtum paper now refers to that one as confirmation of its result https://arxiv.org/abs/2304.03039 beaten to the punch by a couple of days!

      bazzarghView on HNParent context

    • > The problem: The calculation of these terms on normal processors is slow and also the use of GPUs as currently the fastest hardware accelerator technology for many AI applications is not efficient for this algorithm. > https://arxiv.org/pdf/2304.03039.pdf At this rate, a…

      vlovich123View on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.