The idea: The simplest hash-based signature (Lamport, 1979): pick pairs of random secrets and publish their hashes as your public key. To sign, go through the bits of the message's hash and reveal one secret from each pair: the first for a 0, the second for a 1. Anyone can hash what you revealed and compare. Each key can sign only once, since revealing more secrets would let others mix and match. SPHINCS+ (SLH-DSA) builds a huge tree of such one-time keys, so you can sign many messages without keeping track of which keys you've used.
Why it matters: A conservative quantum-safe choice for signing software and firmware.
Signing by revealing secrets
A toy Lamport signature with an 8-bit hash (real ones use 256). For each bit of the message's hash you reveal one of two secrets. Checking only needs hashing. Signing a second, different message would reveal secrets from the other row too, letting a forger mix and match, so each key is used once. SPHINCS+ (SLH-DSA) organizes a huge tree of one-time keys so that a signer never needs to remember which keys it has used.
Nothing on the map depends on it: it is an end point, something people use directly.
References
NIST. Stateless hash-based digital signature standard. NIST FIPS 205, 2024. doi:10.6028/NIST.FIPS.205
Daniel J. Bernstein, Andreas Hülsing, Stefan Kölbl et al. The SPHINCS + Signature Framework. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security. doi:10.1145/3319535.3363229
A. Huelsing, D. Butin, S. Gazdag et al. XMSS: eXtended Merkle Signature Scheme. RFC 8391, 2018. rfc-editor.org/rfc/rfc8391
D. McGrew, M. Curcio and S. Fluhrer. Leighton-Micali Hash-Based Signatures. RFC 8554, 2019. rfc-editor.org/rfc/rfc8554
David A. Cooper, Daniel C. Apon, Quynh H. Dang et al. Recommendation for Stateful Hash-Based Signature Schemes. National Institute of Standards and Technology, 2020. doi:10.6028/NIST.SP.800-208