MinekPo1 [it/she]

don’t be a cop , typing quirks are cool

I was originally going to comment that differences in performance between JS and TS appear to be most significant in one challenge

 ___________________________________________________________________________________________________________________ 
|lang|_binary_trees___________|_fannkuch-redux_____________|_fasta_____________________|_normalized_________________|
| JS | 312.14 : 21.349 :  916 |    413.90 :    33.663 : 26 |  64.84 :  5.098 :      30 |     4.45 :    6.52 :  4.59 |
|_TS_|_315.10_:_21.686_:__915_|__6 898.48_:___516.541_:_26_|__82.72_:__6.909_:_____271_|____21.50_:___46.20_:__4.69_|
|diff|___+.9%_:__+1.6%_:_+.1%_|_+15_66.7%_:_+14_34.4%_:_0%_|_+21.6%_:_+35.5%_:_+803.3%_|_+3_83.1%_:_+6_08.5_:_+8.1%_|

however, trying to look to see the typescript code, wanting to translate that to type hinted python code, I’ve been unable to find typescript on CLBG, so I’m confused on how they got that data,

honestly i use lemmy explicitly for the politics , helps me remain sane

honestly uterus transplants , from what ive read its actually developing really well :)

especially if some of the children have a background in cyber crime . this is somehow not a joke , see this video (youtube.com)

YES . its so unhinged . they have an entire page discussing if Obama is actually a Muslim

my first D&D character was a murder hobo cannibal paladin . I will not elaborate

note that the -- -> operator is different than --->

his opsec was trash . he left tons of DNA evidence and he was wearing a very specific backpack making it easy for cops to track him , once he ditched it he had enough cameras behind him that he appeared on that he could have been tracked further plus the showing his face while flirting with a receptionist . see this video by The Hated One (youtube.com , use your preferred privacy friendly front end)

yeah no . sorry but the guy was not as well prepared as it seems , he left a lot of tracks and made a lot of mistakes .

doubt it , since they shorten their username to CY78 , for example on their youtube channel profile or in the vaguely lewd unicode art

also : https://github.com/Kingcy78/NEW/blob/main/1#L551-L570

high quality malware !

the other mentioned repo has the same payload soooo

here is the extracted payload : https://gist.github.com/MinekPo1/af9bfd787c35ea5ff8b22165e9a05a6d

I suspect that’s not the actual payload , the anggur- repo appears to be more suspicious , might try to analyse that

the frames definetly can impact how thick the lenses look . my previous glasses looked quite thick but despite my prescription being higher the new ones look not as thick

yeah thats the point , the cybertruck design is retrofuturism

Agh I made a mistake in my code:

if (recalc || numbers[i] != (hashstate[i] & 0xffffffff)) {
	hashstate[i] = hasher.hash(((uint64_t)p << 32) | numbers[i]);
}

Since I decided to pack the hashes and previous number values into a single array and then forgot to actually properly format the values, the hash counts generated by my code were nonsense. Not sure why I did that honestly.

Also, my data analysis was trash, since even with the correct data, which as you noted is in a lineal correlation with n!, my reasoning suggests that its growing faster than it is.

Here is a plot of the incorrect ratios compared to the correct ones, which is the proper analysis and also clearly shows something is wrong.

Anyway, and this is totally unrelated to me losing an internet argument and not coping well with that, I optimized my solution a lot and turns out its actually faster to only preform the check you are doing once or twice and narrow it down from there. The checks I’m doing are for the last two elements and the midpoint (though I tried moving that about with seemingly no effect ???) with the end check going to a branch without a loop. I’m not exactly sure why, despite the hour or two I spent profiling, though my guess is that it has something to do with caching?

Also FYI I compared performance with -O3 and after modifying your implementation to use sdbm and to actually use the previous hash instead of the previous value (plus misc changes, see patch).

you forgot about updating the hashes of items after items which were modified , so while it could be slightly faster than O((n!×n)²) , not by much as my data shows .

in other words , every time you update the first hash you also need to update all the hashes after it , etcetera

so the complexity is O(n×n + n×(n-1)×(n-1)+…+n!×1) , though I dont know how to simplify that

actually all of my effort was wasted since calculating the hamming distance between two lists of n hashes has a complexity of O(n) not O(1) agh

I realized this right after walking away from my devices from this to eat something :(

edit : you can calculate the hamming distance one element at a time just after rehashing that element so nevermind