💡 suppose we want to communicate°hard word message A if event E happens, and message B if event E does not happen.
We calculate°hard word three checksums°hard word: MD°hard word5(A), MD°hard word5(B), and MD°hard word5( "{} if E else {}" % (MD°hard word5(A), MD°hard word5(B)) ).
⚙️ the MD°hard word5 algorithm°hard word is perhaps more reversible°hard word and collisionable°hard word than desired°hard word. If you understand those concerns°hard word, you must also know how to remedy°hard word them.
As a pre-commitment°hard word, we send the three checksums°hard word, without identifying°hard word which is which. After the event occurs (or does not occur), we reveal°hard word the message we want to communicate°hard word - which also reveals°hard word which of the checksums°hard word is the MD°hard word5 of that message.
🔥 the Interactive°hard word element°hard word is whether we must reveal°hard word a second message.
💡 interactive°hard word proofs°hard word are beyond this channel°hard word. The more relevant°hard word concern°hard word is how to construct°hard word predicates°hard word E such that "E did not happen" is substantively°hard word different from "E has not happened yet°hard word".