Dang. I'm over here writing dummy python scripts and splitting vast ranges with 8 measly cores and you're talking about cross-chain signature vulnerabilities.
I feel dumb lol
I feel dumb lol
Don't feel, that post is full of truisms that don't really have anything to do with the puzzle, nor add any new information.
But you also shouldn't split ranges, you're increasing the difficulty of the problem. Looking for the solution using 8 subranges increases the solve time by 183% (2.83x). Not that it really matters when we're comparing an expected solve time of 1000 years with one of 2830 years though.
I see how my post might’ve come across as redundant or not directly helpful to the discussion for that i apologize. I’m still learning a lot as I go, and just trying to better understand the mechanics behind narrowing the keyspace and how people like RetiredCoder were able to approach these high-bit puzzles. I’ll aim to keep future posts more focused and relevant. i do have a something about puzzle 135 on my rtx 3050 ti (i know its not great and part 3 of the research was intended with a 4090 im going to rent out a 4090 when the research is concluded) i get 7,000 days do i narrow down the keyspace width to like 35bits instead of the full 135 to search smaller areas first is that incorrect? at times i do get a collision error but one of my colleagues said that even with 35 bits there's a possibility it wont be there and im just wasting my time.