jix

6 ms·

1.
by jix 3y ago
"In doing that they usually jump to the most uncharitable, horrible reasons they can imagine for why we might have done so." So you do understand why one wouldn't want to deal with a significant part of the user base here giv
2.
by jix 5y ago
The paper where they introduce subsumption is "Michael Codish, Luís Cruz-Filipe, Michael Frank, and Peter Schneider-Kamp. 2016. Sorting nine inputs requires twenty-five comparisons. Journal of Computer and System Sciences 82, 3 (May 20
3.
by jix 5y ago
Those are interesting questions! For example generating and looking at all networks of optimal size which have distinct circuits (assuming unlabeled inputs, so that rearranging those doesn't count as distinct) is something I still want
4.
by jix 5y ago
I replied to your other comment :)
5.
by jix 5y ago
Interesting :) Codish et al. have a background in SAT solving, which is somewhat related to logic programming. In SAT solving subsumption of clauses usually doesn't involve any substitutions. That's the notion of subsumption I was
6.
by jix 5y ago
Computing s(11) and s(12) together took just below 5 hours on a 24 core server, but it also required almost 200 GB of RAM. Verifying the computation took about 3 days in total on the same server. Computing s(9) and s(10) with the same appro
7.
by jix 5y ago
Author here, in case anyone has questions
8.
by jix 6y ago
I haven't read everything, but it does contain a section about something I'm quite familiar with: The article says "We compute the hashcode of the entire graph by hashing the multiset of WL labels. With one round, we’re just
9.
by jix 7y ago
That's just defining the term. AFAICT the law only says that an employee has a right to receive fair compensation for a technical improvement in some cases. It explicitly says that apart from that, procedures covering technical improve
10.
Varisat 0.2.0 Released (Sat Solver in Rust)(jix.one)
2 points by jix 7y ago|0 comments
11.
Incremental Solving and Proofs (Sat Solver Written in Rust)(jix.one)
1 points by jix 7y ago|0 comments
12.
Refactoring Varisat: 4. Heuristics (Sat Solver in Rust)(jix.one)
1 points by jix 8y ago|0 comments
13.
Refactoring Varisat: 3. Conflict Driven Clause Learning(jix.one)
2 points by jix 8y ago|0 comments
14.
Not Even Coppersmith's Attack(jix.one)
2 points by jix 9y ago|0 comments
15.
by jix 9y ago
For this project I don't really have to say much about the rust side of it. There were no surprises. The only thing special I can think of is the excellent cross-compiling support. That came in handy as I had to produce windows binarie
16.
by jix 9y ago
I've never had a Mega Drive before working on this, so I wasn't really familiar with a lot of its games. I took a quick look at F1 just now though. The way it makes use of the nametable and patterns is very similar to what I do. T
17.
by jix 9y ago
Thanks for writing this. I didn't really expect that much attention, so I kind of assumed most people reading it are at least somewhat familiar with the graphics hardware of that area. I shouldn't have assumed that :)
18.
by jix 9y ago
There weren't really any dead ends. Mostly because I started with a very simple naive way to draw polygons and improved it incrementally. I didn't implement all those steps, but convinced myself that they would work. I started wit
19.
by jix 9y ago
For the Mega Drive/Genesis the framerate depends on the region, matching the local video standard. The European Mega Drive uses PAL with 50Hz. As the biggest part (but not all) of the demoscene is based in Europe, most demos target PAL
20.
by jix 9y ago
Author here, happy to answer any questions you might have.
21.
Pushing Polygons on the Mega Drive(jix.one)
194 points by jix 9y ago|45 comments
22.
by jix 9y ago
No. Apart from the mapper chip used to address 8MB of ROM this demo requires no additional chips on the cartridge. Everything is done by the 68k CPU (running the effects) and the z80 CPU (running the sound engine).
23.
by jix 9y ago
Not all everdrive flash carts support the mapper/rom size our demo uses (the SSF2 mapper with an 8MB rom). The included nfo file lists some supported flash carts.
24.
by jix 9y ago
I'm one of the coders who worked on the Overdrive 2 demo (although not on the reverse engineering that resulted in this document). We're going to release more follow-ups about the development of the demo. I'm currently workin
25.
by jix 10y ago
It does. It supports mingw on windows as well as cross-compiling from linux using cargo (rust's package manager and build tool). Installing mingw-w64 from my distribution's package manager and telling cargo where to find its linke
26.
by jix 10y ago
There is http://www.olegkikin.com/md5game/ on which I wasted some GPU cycles many years ago. It uses a very silly metric for progress though. Finding a longer substring that matches doesn't bring you closer to fin
27.
by jix 11y ago
BeRo did build a javascript engine from scratch on his own: https://github.com/BeRo1985/besen From the copyright headers he worked on it starting in 2009 and had the first public release in 2014 (actually 2010, see com
28.
by jix 12y ago
Starting in a corner seems to be a worst case choice for a random walk on a non-looped grid. I forked it to a) use a random order for starting (and restarting) http://bl.ocks.org/jix/30e55ae16b99efe94bfc/ab5a848811
29.
by jix 16y ago
Apparently it wasn't considered dead enough early enough: http://www.win.tue.nl/hashclash/rogue-ca/