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.