It does seems so, both seems to compute the Dedekind number by using sums over equivalence classes of lower number of variables functions. Before [0][1] It was

It does seems so, both seems to compute the Dedekind number by using sums over equivalence classes of lower number of variables functions. Before [0][1] It was only possible to compute D(n+2) from Rn and Jäkel gave way to compute D(n+3) and D(n+4) from Rn and that seems to be major speed improvement. The D(n+3) computed D(8) in 17.56s, he couldn't use the same method for presumably because R(7) is 30,000 times R(6) and he is using matrix multiplication so it will take stupid long. Edit: I didn't read carefully enough, it is not new at all see [2] or [3] for examples. [0]: Yusun, T.J.: Dedekind numbers and related sequences (2008) page 19 [1]: Lennart Van Hirtum. A path to compute the 9th dedekind number using fpga supercomputing. https://hirtum.com/thesis.pdf https://hirtum.com/thesis.pdf, 2021. KU Leu- ven, Masters Thesis page 51 "While it would be nice to pick k = 3 and just compute D(9) from the structure of 6, at this time no efficient methods exist for computing P(n,k,α,β) for k ≥ 3. So we have to use k = 2" [2]: F. a Campo, Relations between powers of Dedekind numbers and exponential sums related to them, J. Integer Seq. 21 (2018), article 18.4.4, https://cs.uwaterloo.ca/ https://cs.uwaterloo.ca/ journals/JIS/VOL21/Campo/campo3.pdf and https://cs.uwaterloo.ca/journals/ https://cs.uwaterloo.ca/journals/ JIS/VOL21/Campo/campo3-corrigendum.pdf. [3]: Pieter-Jan Hoedt, Parallelizing with MPI in Java to Find the ninth Dedekind Number, preprint, 2015 https://web.archive.org/web/20150911060239/http://people.cs.kuleuven.be/~bart.demoen/WVKULAK/firstdraftofPaper_Hoedt.pdf https://web.archive.org/web/20150911060239/http://people.cs....