@realprosdiscuss@RevengerWizard@schteppe trimming means its trivially easy to find different inputs with the same hash, that seems unwise for a crypt function to be doing. Better to just fail and leave it up to the user to decide if trimming is appropriate for their use case
@RevengerWizard@schteppe this specific hash function rejects values beyond a certain length (256 iirc) and instead returns *.
The reason it does this is to prevent DOSing
@carlassmann The point is that by knowing the expected type when parsing, you can make the actual parsing significantly faster (e.g. you no longer need your parser to iterate an arbitrary list of keys, since all keys are known at "compile" time). An opt in validator looses that speedup
@entropy_error@Arikalabs@straceX size_t is used to represent sizes. Naturally, since a negative size is nonsensical, size_t is unsigned.
Since it's unsigned it can never be negative, meaning that it will always pass the >=0 check.
@BeachyBro@stupidtechtakes By default a comparison in js (==) performs type coercion. If you want a strict comparison that doesn't do type coercion you instead use (===). And then it just follows the standard pattern for negation.
a != b <=> !(a == b)
a !== b <=> !(a === b)
@markasual5@SpaceKoala It actually orbits both! If you trace the path the moon takes around the sun you'll see it actually only ever curves towards the sun, never away from it. Minute physics has a video about it if you want a more visual explanation.
@whb4ker@PAHoyeck@2oovy The rule isn't an if and only, it allows multiple letters to map to 3. The requirement is only A->3 so to verify/disprove you need to
- flip A to confirm it maps to 3
- flip 7 to confirm that A isn't mapped to 7
@CraftyMasterman@TAltheorist 50 mspt is your budget.
in an empty world you could easily be running a single digit mspt.
If you're running at 50 mspt with only 1 machine in the world then that machine would absolutely be qualified as laggy (even 20 mspt is a lot for a single machine tbh)