Return to Video

08x-09 Proofs Of Work

  • 0:00 - 0:05
    The bitcoin protocol relied on using proofs of work to provide scarcity in producing new blocks.
  • 0:05 - 0:09
    For this question you are asked to order a list of tasks by how much expected work they require.
  • 0:09 - 0:15
    Assume that H is a strong cryptographic hash function that produces 128 output bits
  • 0:15 - 0:17
    from any length input.
  • 0:17 - 0:19
    Comuting H(x) takes 1 unit of time.
  • 0:19 - 0:23
    E indicates RSA encryption. K sub U is a known public key.
  • 0:23 - 0:26
    But the corresponding private key is not known.
  • 0:26 - 0:30
    Computing E(x) takes takes 1000 units of time.
  • 0:30 - 0:35
    There are no memory limits, but the task has no access to precomputed values.
  • 0:35 - 0:38
    Using those assumptions, order these by how much work they prove
  • 0:38 - 0:42
    from the least expected work to the most expected work.
  • 0:42 - 0:48
    For example, enter cebad if you think c requires the least amount of work
  • 0:48 -
    and d the most amount of expected work.
Tytuł:
08x-09 Proofs Of Work
Video Language:
English
Team:
Udacity
Projekt:
CS387 - Applied Cryptography
Duration:
0:52
Amara Bot added a translation

English subtitles

Revisions