NP-Hard trolling

What is the maximum amount of trolling a text with informational content of N bits can contain
(assuming ternary bits with maximum compression which would make it 2/3 the size of equivalent binary bits)

1 FV per bit. More is possible with infinite compression,
but it will overflow the Turing machine, since the poor thing wasn't designed for such abuse.