WimⓂ️ on Nostr: npub1qu5vz…64evr It does not look like a real optimisation to me. If ε is small, ...
npub1qu5vzh27f2j25c8k7z68kz2uugfau5e4u77fks445hr249pzhagqv64evr (npub1qu5…4evr) It does not look like a real optimisation to me. If ε is small, it means p,q and r will have to be large primes.
As far as I understand, what this algorithm does is multiply the fractions with a fraction of unused primes with a large exponent, which is compensated by multiplying the accumulator with the largest of these exponents. This way, the fractions will still match the accumulator. But every fraction now requires more work to compute.
As far as I understand, what this algorithm does is multiply the fractions with a fraction of unused primes with a large exponent, which is compensated by multiplying the accumulator with the largest of these exponents. This way, the fractions will still match the accumulator. But every fraction now requires more work to compute.