undefined | Better HN

0 pointsfloatingatoll7y ago0 comments

Not as readable, but each inter-character spot is a bit, and if you have 11 bits, you can represent 2^11 addresses.

EDIT: Assumes Zero or One periods per bit-gap; if you can chain them, the sky’s the limit.

0 comments

ixwt7y ago

I just tested it with a bunch of periods. I got rejected with just two periods adjacent, and with quite a few more periods adjacent. So only bits. Looks like it can be used for filtering too.

dimensi0nal7y ago

Dots cannot appear consecutively in the local-part unless quoted.

j / k navigate · click thread line to collapse

0 comments

ixwt7y ago

I just tested it with a bunch of periods. I got rejected with just two periods adjacent, and with quite a few more periods adjacent. So only bits. Looks like it can be used for filtering too.

dimensi0nal7y ago

Dots cannot appear consecutively in the local-part unless quoted.

j / k navigate · click thread line to collapse