results are ANDed together, on the basis that these chains will tell
if *all* bits in a particular partition are equal.
+Examples:
+
+* p2p1p0 all zeros indicates that the partitions are all closed, turning our 4 input byte-level compares into a 32-bit compare. by ANDing all 4 byte-levrl compares we get a 32-bit result
+* p2p1p0 equal to 0b010 will split into two 16 bit compares. therefore, the first two byte-levrl compares are ANDed to give a hi half-word compare and likewise the lower.
+
# Boolean truth table
[[!table data="""