== full-trace divergence (160 table indices per AES-128 block) ==
len t0=160 t1=160 t2=160
K (key[0]=00) round1 idx[:16]=0050a0f04090e03080d02070c01060b0
K' (key[0]=80) round1 idx[:16]=8050a0f04090e03080d02070c01060b0
K vs K': differing index positions: round1=[0], total 136/160
K vs K'': differing index positions: round1=[3], total 137/160
K vs K' total bitwise hamming distance over 160 indices: 534/1280 bits
identity idx[i]==key[j]^pt[j] for K,K',K'': [True, True, True]
== idxr1 matrix: 0 samples satisfy index==key^pt exactly, 40 failures of 40 parsed ==
distinct round-1 Te0 index byte values observed across matrix: 8 (0x00..0xff range -> 0x0..0x7)