scribblemaniac

@dunsany The checkpoint file can be read as a 32 byte (not bit) unsigned integer in little-endian. The number of calculations should be roughly 2^21 times that number I believe.

Searching for vanity addresses is entirely probabilistic. Formulas for estimating the average amount of time to find an n-letter match are discussed in #27. > My old computer (2020) can...

> My home PC with i7-12700K gets about 80 000 000 calc/sec, which takes less than half a year to exhaust the entire 10 character space. No. At that rate,...

If you don't want to be a jackass, then don't ask other people to do work for you and then tell them how easy it would be for you to...

> I’m especially sceptical of changing the extension internally in pcl(x) files, regardless of whether they are legacy or not. For bitmap projects this will only be a bit of...

@Jose-Moreno Thank you, how did I not find that! I even commented on it 🤣 This will still be useful for specifically tracking High DPI support integration I think.

I just tested a build from master and the nightly build AppImage on my 4k laptop (Ubuntu 22.04). The situation is greatly improved since my initial post. Almost everything looks...

That isn't really feasible with the way we currently handle keyboard shortcuts and the overall input focus of the application. Even if it was I don't think that is a...

Keeping track of the key states is not going to be a feasible solution. Qt simply doesn't provide that information, and there are situations, such as alt-tabbing on Windows which...

The readme mentions that this application uses the [PatchMatch algorithm](https://en.wikipedia.org/wiki/PatchMatch). As I understand, it does not need training, a model, or an external API. The infill data comes from other...