McAffee: Boolean Algebra Anomaly

Would any kind souls attempt to explain the implications of this? It seems there's a few things to consider here. 1) Is the wide breadth of utility that such a simple function can offer. 2) Due to it's persuasive use within software of all kinds, it may not be understood what the associate implications are by the majority of implementations.

A more obvious scenario is something like encryption not being as encrypted as one would think. There is an interesting element of randomness and determinism that I can't get my head around yet.

Perhaps I'll try some experiments to fully flesh out the slippery thoughts I'm having. I understand what a XOR gate does, and I've setup NAND gates to fully functional virtual cpu's. Yet I don't know what creative use cases exist - this is both inspiring and concerning.

I'll try to think of a few more implications, but if anyone can thread the needle for more simple folk I'd appreciate it at least.

I will experiment with at least something similar to: Given I used 3 sets of alphabets of the same length and then xor them in the various intervals suggested.

Given I did the above but removed one of the sets as a 'secret' what does that imply with the interval and associativity?

It reminds me of the rotate implementation in Forth via microcodes and registers that a lot of primitives are built upon.

I wish I had a big brain.

This sounds like XOR's toggling property/XOR swap trick but with extra steps

https://accu.org/journals/overload/20/109/lewin_1915/

What the hell? That's some spooky shit. If it's really true that the inputs aren't discernable from the intermediate results, shouldn't it allow for some cool distributed cryptography?

I miss Mcafee, funny how most libertarian activists seem to drop dead while the people looting stores and setting cities on fire during protests, or stealing “under 900$” roam the streets freely. I guess not paying taxes is a worse offense than murder to the government.