4 ms·
My problem with all of this is I don't care about having the "best name". I want to make a new name, and then work increasing it's value. This system seems lik
by CJefferson 10y ago
My problem with all of this is I don't care about having the "best name". I want to make a new name, and then work increasing it's value.
This system seems like anyone who wants to make a name but not monitise it will lose. How much of the value of (picking the first things that come into my head) the names FSF, GPL, GCC and clang come from the organisations and products? I bet those names would be worth much more to someone willing to use adverts and spam.
And even if we raised enough money to keep the names out of the hands of spammers, all that's happening is that lbry gets to charge a tax to anyone who has a name that has got even slightly popular.
- OJFord 10y agoIsn't that addressed by this FAQ entry? > Rest assured, we’re implementing permanent URLs that are always yours. https://lbry.io/faq/no-auction-options https://lbry.io/faq/no-auction-options
- CJefferson 10y agoYes, but they will just be randomly generated strings, that doesn't really sound appealing. Also they don't exist yet.
- kauffj 10y agoThat FAQ article is old and I'm going to update it to point at https://lbry.io/faq/naming https://lbry.io/faq/naming. You can get names as short as: lbry://name#a Where #a can actually be that short. If you want a name with no identifiers or filters at all, the voting system will continue to be used.
- tyingq 10y agoWhat are valid characters for an identifier? Can I have lbry://foo## for example?
- kauffj 10y agoIt matches by claim id, which is a much longer hash, but the system will do partial matches. In the case of conflicting partial matches, the first claim (temporally) is resolved.
- tyingq 10y agoEdit: Ignore below...you already said earliest claim is preferred. I need to stop skimming. (or I missed a stealth edit?) Ah, so everything after the # is random then. And if you choose to abbreviate, you are risking whatever the collision likelihood is, in 4 bit increments, assuming the hash is hex digits. There doesn't appear to be a throttle on claims, so choosing to abbreviate with just one character could be risky? Or does your substring match prefer earliest claim?
- kauffj 10y agoYes, substring matches prefer earlier claims.
- CJefferson 10y agoSo i can still quickly camp on all the single letter extensions to popular names?
- tyingq 10y agoWell, a-f and 0-9, and they are randomly assigned.