@vashti and this is why we shouldn't store numbers in fixed width fields, or compute using 32 or 64 or 128 bit or any other fixed size integers.
Bignum arithmetic has been a solved problem in computing since Maclisp in the 1960s.
@vashti and this is why we shouldn't store numbers in fixed width fields, or compute using 32 or 64 or 128 bit or any other fixed size integers.
Bignum arithmetic has been a solved problem in computing since Maclisp in the 1960s.
@simon_brooke @vashti Bignum is not useful here. As identifiers, 128 bit is already aphysical if assigned sequentially. 256 bit if assigned randomly.
@dalias @simon_brooke @vashti Yeah, possible to math it out, in 128 bits there's enough for say 2^64 humans (we're at roughly 2×(2^32), so nowhere close), each doing whatever kind of interaction within 2^64 which can be one per second and IIRC that largely contains big bang to heat death of universe.
GNU social JP is a social network, courtesy of GNU social JP管理人. It runs on GNU social, version 2.0.2-dev, available under the GNU Affero General Public License.
All GNU social JP content and data are available under the Creative Commons Attribution 3.0 license.