devolved beans as results in operator walling result beans (in example blowfish uses plaintext iterations over the key in notions left key half, right key half in a 16 round loop)

in my example in the stream cipher eil,
there is a finite way to expose the value of a walled bean as a result after the key separation happens whereas, the plaintext crosses the key value and creates a result.
 the notion in eil whereas the notion that sympaths are possible, there is simply one small amount in redundency as much the cipher creates values after key mixing operation over the plaintext.

in one notion formal as an weight in example here is how a totient operator is exposed:
01010 01010
^-- if we take two bits from each half we can notice a formal notion that we can sample the bits with the notion to repose them
whereas all the bits are not likely q operator bean mixed they are supposed to respose value over reposeing them in sympaths

10 <-- aa possible bein
00 <-- ev possible bein ev__e
a __e __ev __a whereas 0 1 is aa 00 ev __aa 01 ev aa
if must be made clear that no operations are supposed in aa but ev is bein operation. this is the notion to make formal that mathematically to suppose the ev bein operation is simply only the result of novalue beta we reposeing the bits in aa are necessarily ev bein, the bits are ev ev or aa repose aa bit thqoursuse dimension aa where the regardance of ev is supposed there are no operations whereas aa is simple a repose of bits over accumulating them.

this is the great hurd that bean mixed ev values are supposed to have the notion that aa value accumlations are totarae bein ev oust kerlen b align a, whereas isqv is ev bein possible repose sympath aa eovoluance whereas voluance is supposed aa voluant ev