Hello: This patch was applied to bpf/bpf-next.git (refs/heads/master): On Sun, 30 May 2021 22:01:57 -0400 you wrote: > From: Harishankar Vishwanathan <harishankar.vishwanathan@xxxxxxxxxxx> > > This patch introduces a new algorithm for multiplication of tristate > numbers (tnums) that is provably sound. It is faster and more precise when > compared to the existing method. > > Like the existing method, this new algorithm follows the long > multiplication algorithm. The idea is to generate partial products by > multiplying each bit in the multiplier (tnum a) with the multiplicand > (tnum b), and adding the partial products after appropriately bit-shifting > them. The new algorithm, however, uses just a single loop over the bits of > the multiplier (tnum a) and accumulates only the uncertain components of > the multiplicand (tnum b) into a mask-only tnum. The following paper > explains the algorithm in more detail: https://arxiv.org/abs/2105.05398. > > [...] Here is the summary with links: - [v2,bpf-next] bpf: tnums: Provably sound, faster, and more precise algorithm for tnum_mul https://git.kernel.org/bpf/bpf-next/c/05924717ac70 You are awesome, thank you! -- Deet-doot-dot, I am a bot. https://korg.docs.kernel.org/patchwork/pwbot.html
