{"version":"1.0","type":"rich","title":"Gist 278715","description":"This example demonstrates sequential and parallel generation of RSA cryptographic tuples, each containing an encryption exponent, decryption exponent, and modulus derived from two 200-digit prime numbers. The code contrasts a straightforward sequential approach with a parallelized version that uses `ForkedFeeder` from the stream library to generate random primes in two child processes, while `ent.random_prime` supplies the primes and `ent.rsa_init` constructs the tuples. The parallel pipeline collects primes via `PCollector` and groups them into pairs with the `chop` operator before printing each RSA tuple.","provider_name":"VizHub AI Studio","provider_url":"https://next.vizhub.com","html":"<iframe src=\"https://next.vizhub.com/viz/gist-278715?mode=embed\" width=\"960\" height=\"500\" scrolling=\"no\" frameborder=\"1\"></iframe>","width":960,"height":500,"cache_age":3600}