News for hackers. Stuff that matters.

A comment on Belgian programmer solves MIT’s 20-year-old time capsule cryptographic puzzle. Parent comment

Re:Belgian programmer solves MIT’s 20-year-old time capsule ... by CodeArtisan on Tuesday April 30, 2019 @07:23AM (#19786923)
You still need the same amount of iterations (79 685 186 856 218)[1] to resolve the problem but it's now faster because

SIMD instructions[2] lowered the amount of cpu cycles needed per operation.

Novel algorithms[3] lowered the amount of operations needed per iteration.

[1] https://people.csail.mit.edu/rivest/lcs35-puzzle-description... (short description at the bottom).

[2] https://en.wikipedia.org/wiki/SIMD

[3] https://gmplib.org/manual/Algorithms.html

[ Parent | on HN ]
Re:Belgian programmer solves MIT’s 20-year-old time capsule ... by vlovich123 on Tuesday April 30, 2019 @08:24AM (#19787253)
The problem appears to be sequential so how would SIMD help? Also what advances in squatting algorithms have there been specifically? None of the links you have provided appear relevant
[ Parent | on HN ]
Re:Belgian programmer solves MIT’s 20-year-old time capsule ... by eru on Tuesday April 30, 2019 @09:00AM (#19787473)
The numbers involved are quite large. They don't fit into a single computer word.

The problem is designed so that iterations have to be sequential, but a single iteration can use parallelism.

[ Parent | on HN ]