[Script Info]
Title:
[Events]
Format: Layer, Start, End, Style, Name, MarginL, MarginR, MarginV, Effect, Text
Dialogue: 0,0:00:00.00,0:00:05.00,Default,,0000,0000,0000,,The bitcoin protocol relied on using proofs of work to provide scarcity in producing new blocks.
Dialogue: 0,0:00:05.00,0:00:09.00,Default,,0000,0000,0000,,For this question you are asked to order a list of tasks by how much expected work they require.
Dialogue: 0,0:00:09.00,0:00:15.00,Default,,0000,0000,0000,,Assume that H is a strong cryptographic hash function that produces 128 output bits
Dialogue: 0,0:00:15.00,0:00:17.00,Default,,0000,0000,0000,,from any length input.
Dialogue: 0,0:00:17.00,0:00:19.00,Default,,0000,0000,0000,,Comuting H(x) takes 1 unit of time.
Dialogue: 0,0:00:19.00,0:00:23.00,Default,,0000,0000,0000,,E indicates RSA encryption. K sub U is a known public key.
Dialogue: 0,0:00:23.00,0:00:26.00,Default,,0000,0000,0000,,But the corresponding private key is not known.
Dialogue: 0,0:00:26.00,0:00:30.00,Default,,0000,0000,0000,,Computing E(x) takes takes 1000 units of time.
Dialogue: 0,0:00:30.00,0:00:35.00,Default,,0000,0000,0000,,There are no memory limits, but the task has no access to precomputed values.
Dialogue: 0,0:00:35.00,0:00:38.00,Default,,0000,0000,0000,,Using those assumptions, order these by how much work they prove
Dialogue: 0,0:00:38.00,0:00:42.00,Default,,0000,0000,0000,,from the least expected work to the most expected work.
Dialogue: 0,0:00:42.00,0:00:48.00,Default,,0000,0000,0000,,For example, enter cebad if you think c requires the least amount of work
Dialogue: 0,0:00:48.00,9:59:59.99,Default,,0000,0000,0000,,and d the most amount of expected work.