This is to announce a new electronic preprint concerning instruction sequences. The paper entitled “On the complexity of the correctness problem for non-zeroness test instruction sequences” (arXiv:1805.05845v1 [cs.LO]) has now been archived. In this paper, we investigate the complexity of the problem of deciding whether a finite instruction sequence that contains only instructions to set and get the content of Boolean registers, forward jump instructions, and a termination instruction correctly implements the function modeling the non-zeroness test on natural numbers less than 2* ^{n}* with respect to their binary representation by bit strings of length

*n.*