Sopel

Cool exploration, and very much needed because depressingly few people who use these engines actually understand this.

Back in 2021 I got cfish and weiss working on a 386sx, though didn't test it much. cfish was doing 5k nps so some results can be extrapolated. NNUE complicated things due to RAM requirements.

you're not gonna brute force an AES256 key

if you have a bad password that's a user issue

why is it so slow? it's around 50x slower than I would have expected for numbers https://github.com/ConstexprCore/perfect_hash

ssim by bitrate for prores, h264 with IPB frame types, and h264 with only i-frame types (which is a direct prores alternative) (the last one is for some reason not visible on this plot, only one post up)

not even for editing https://www.eoshd.com/comments/topic/46562-prores-vs-h264-vs...

because crypto is just an excuse to speculate in an unregulated market

that's like asking "should I use an audi or a tesla"

you can easily record lossless h264 via obs and any ffmpeg-backed player will play it just fine

the days where the OS matters for video playback are long gone

prores is not lossless. It's also an intraframe codec so compression is not great.

pure text search (the deterministic kind you're talking about) is medieval technology that's useless in a web search engine

Is this related to the fact that I'm regularly unable to find many github repos via google?

> did not respect our robots.txt

I don't see a problem

> ignored our Terms of Service

ban them from the service then and case closed?

> and defied the creators' licenses: 423 of the 712 projects are licensed for non-commercial use only

because it's been proven they have been used commercially?

well it kinda worked? over on reddit r/gaming thinks the data has been stolen

more radicalization towards AI

title says DNS, article says access, so which is it?

At least on windows zombie processes may use no memory but still keep >=32KiB page table. So in this [extreme case of an AMD iGPU driver bug](https://superuser.com/questions/1838566/how-to-identify-a-dr...) close to 100% of memory was used by page tables (or would if pushed far enough)

yes, you would have to allocate space for up to 100 file paths, but the article says

> it’s more efficient because it reduces the amount of calls into the file system, which is where the bottleneck is

Upon reading it a few times I think the article is alluding to a crappy two-pass solution where you don't store a filename but instead an index into a directory, which is flawed anyway due to being racy.

The cart is moving down faster than the light "bouncing" from the top of the cart towards your eyes. Whether the light can actually bounce this way I do not know. https://imgur.com/a/Aztdj4C

I don't see how this is supposedly more efficient than the easier approach of listing all files and choosing a single random number in 1..n

yes

also in chess a better line is not required to be shorter

AlphaZero does not exist, as far as modern computer chess is concerned

They could but it's pretty much meaningless. You're bound to find outliers in favor of either engine, and the landscape is pretty chaotic

don't care, it has all the right points

chess is just a simple mathematical construct so that's not surprising

The ML techniques it uses are only about evaluation, but you were close

yes