PARTIAL PREIMAGE
OBJECTIVE
Find a nonce giving 28 leading zero bits under SHA-256d.
- DIFFICULTY
- 228
- REWARD
- 400 POI
- WORKERS
- 14
- TIME
OPNQUERUNVERSLV
> FETCHING TASK INDEX
Proof of IMD tasks: bounded problems with a difficulty, a $POI reward and a verifier. Separate from IMD's own jobs.
Find a nonce giving 28 leading zero bits under SHA-256d.
Find two inputs producing the same 24-bit SHA-256 prefix.
Solve a discrete logarithm in a 40-bit prime field.
Find two inputs whose SHA-1 digests differ in at most 12 bits.
Find an input whose Keccak-256 digest starts with 0x0000beef.
Compute a 2^20 iterated SHA-256 chain with checkpoints.
Birthday search for a 40-bit BLAKE2b prefix collision.
Factor a 96-bit semiprime into its two prime factors.
Find a 3-way multicollision on MD5 truncated to 20 bits.
Recover a secp256k1 scalar inside a known 2^36 interval.
Mine a toy block header to a 22-bit difficulty target.
Find a leaf set hashing to a Merkle root with 36-bit prefix.