Sounds like you're asking about the Fawkes signature scheme, based on a series of hash commitments.
(No bloom filters involved, only hashes)
The basic idea is that you start with a secret and a hash commitment of that secret. You publish only the commitment hash.
You then write a message that contain the ...
In general, the second explanation is a bit sloppier, however both appear to gloss over a crucial detail:
In the first example, notice how the secret value is modulo q, the subgroup, whereas in the second example, the secret value, x, is not modulo anything. Which is correct?
Pedersen commitments only work if $x$ is in the range $(0, q-1)$; given an ...