yshui

7 ms·

1.
by yshui 8mo ago
If you think directly calling Windows syscall is crazy, some applications parse binary code from ntdll.dll to figure out what the syscall numbers actually are, since they change across different Windows versions :)
2.
by yshui 8mo ago
see also the proton release notes: https://github.com/ValveSoftware/Proton/releases
3.
by yshui 8mo ago
It's a bit different. WoW64 is the technology used to run 32-bit applications on 64-bit Windows. Wine has support WoW64 for a long time. The difference is the "old" wine WoW64 mode required 32-bit libraries on the host side,
4.
by yshui 8mo ago
> who are the devs of Wine. they employs many devs of Wine (including the project lead, Alexandre Julliard). but technically Wine is still an independent open-source project, and has many contributors from outside Codeweavers.
5.
by yshui 1y ago
That's a cool find. I wonder if LLVM also does the other way around operation, where it pattern matches handwritten CAS loops and transform them into native ARM64 instructions.
6.
AI and the existential question about language(trace.yshui.dev)
5 points by yshui 1y ago|1 comments
7.
Games for Large Language Models to play against themselves(trace.yshui.dev)
3 points by yshui 2y ago|0 comments
8.
by yshui 2y ago
CodeWeavers, which I am very lucky to be part of, is also an (almost) 30-year-old small company! We make Wine, Proton, and CrossOver, you might've heard of them. And I think we are hiring as well, please have a look!
9.
by yshui 2y ago
Any autoregressive model can do what you are describing. transformers are generating one token at a time too, not all at once.
10.
by yshui 2y ago
further reading: xkcd's "A mole of moles" https://what-if.xkcd.com/4/
11.
by yshui 2y ago
i'd say it's mostly due to linking. the debug info generated is absolutely enormous.
12.
by yshui 2y ago
I (kind of) know multiple languages and they all have different word orders. I find it interesting that my brain is able to switch from expecting information to be received in one order to another. Each word order feels normal to me in its
13.
by yshui 2y ago
I suspect the models probably memorized some chess openings, and afterwards they are just playing random moves with the help of the grammar.
14.
by yshui 2y ago
Okay, I can't believe I am going to defend performance reviews (I hate them with passion), but I actually disagrees with the author's main point. Same accomplishments can be colored good or bad, but that in itself isn't wrong
15.
by yshui 2y ago
I had the pleasure of reverse-engineering win32 SRWLOCKs, and based on the author description of nsync it is very close to how SRWLOCK works internally. Kind of surprised how much faster nsync is compared to SRWLOCK.
16.
Fuzzing an X Compositor(trace.yshui.dev)
4 points by yshui 2y ago|0 comments
17.
by yshui 2y ago
This is pretty dumb on Debian's part. First of all I don't understand why they insist crate dependencies must be pulled from their repository. They are just source code, not built binary. AFAIK there is no other distro that does t
18.
by yshui 2y ago
I am split on this. Maybe I am idealistic and naive, but I will always wish people can just stop fighting, and work together. Fragmenting the community and starting a project out of grudge, is always the last resort, IMO. OTOH, I also recog
19.
I found an 8 years old bug in Xorg(trace.yshui.dev)
124 points by yshui 2y ago|34 comments
20.
by yshui 2y ago
Congrats! :) BTW, instead of max(min()) when I wrote mine I used this equality: V'(s) = 1 - V(swap_players(s)), where swap_players(s) switches X and O pieces. And I only need to do max(). Don't know if that would make your program
21.
by yshui 2y ago
Yep, this is what I ended up doing as well! With how the game generate boards, the player that goes first always have a ~5% advantage. Since players switch hands each around they should have 50% win rate if both play optimally. In practice,
22.
by yshui 2y ago
Turns out linear programming is not fast... Takes about 90 minutes to find the optimal solution for any board configuration.
23.
by yshui 2y ago
I think this is doable. Say we assign a win rate W(S) to each board state S, and let W(S, A) denote the win rate after taking action A from state S. Since the transition is probabilistic, we can write: W(S, A) = P(good) * (1 - W(S_good)) +
24.
by yshui 2y ago
I have a similar project too! I have an e-ink display connected to a Pi Zero that shows just a "Yes" or "No" telling me if it's going to rain outside in the next three hours. (On a second thought, maybe I don't
25.
by yshui 2y ago
Author here. I probably should have stated this more explicitly in the article, but my main concern with using it for day job is copyright. I don't want to accidentally commit copyrighted code into the codebase, and I work for an open