Re:Spork: Peer-to-peer socket magic in the air
by redleader55 on Tuesday October 19, 2021 @10:55AM
(#28918741)
The first thing that pops in my mind is choosing a dictionary of 2^n words and making an identifier that maps the 256 bit hash space to a k-tuple of words, where k = 256/n.
Re:Spork: Peer-to-peer socket magic in the air
by djbusby on Tuesday October 19, 2021 @11:08AM
(#28918904)
Like this? https://github.com/singpolyma/mnemonicode
Re:Spork: Peer-to-peer socket magic in the air
by RL_Quine on Tuesday October 19, 2021 @11:27AM
(#28919166)
You might like bech32, which encodes data (nominally hashes) into strings which include error detection and error correction, while being optimized for human use and typing by avoiding homogylphs and capitalization.
Any implementations of this you'd recommend? I write a lot of hash (content addressable/etc) code in my spare time and i'd be curious to toy with identifiers (256bit hashes) being provided to humans in human-friendly ways.