truth table g0^{-1}(+1): [(-1, -1, -1, -1, 1), (-1, -1, 1, 1, -1), (-1, 1, -1, 1, 1), (-1, 1, 1, -1, -1), (-1, 1, 1, 1, 1), (1, -1, -1, -1, -1), (1, -1, -1, -1, 1), (1, -1, -1, 1, -1)]
depends on all coordinates: True  mu = -1/2  level-1 = ['-1/8', '-1/8', '-1/8', '0', '0']
h = {(1, 1, 1): '-1', (1, 1, -1): '-1', (1, -1, 1): '-1', (1, -1, -1): '1/2', (-1, 1, 1): '0', (-1, 1, -1): '-1/2', (-1, -1, 1): '-1/2', (-1, -1, -1): '-1/2'}  ||h||^2 = 1/2
best k=1 Boolean decoder value (unnormalised, must be <= 0): 0
best k=2 Boolean decoder value (unnormalised, must be <= 0): 0
g0 verified: s^U_{g0} nontrivial, and no k<=2 Boolean labelled certificate exists (value 0 is attained).
