)]}'
{
  "commit": "85af9c856105d01e3de01a9fb767a916b7eb8d5b",
  "tree": "de652eaba02e346fb311573a209fdbb7993152d4",
  "parents": [
    "51c88a4a62116d77a854b55100c6955d6f1eb6dc"
  ],
  "author": {
    "name": "Michael Brown",
    "email": "mcb30@ipxe.org",
    "time": "Thu Jun 17 15:29:22 2021 +0100"
  },
  "committer": {
    "name": "Michael Brown",
    "email": "mcb30@ipxe.org",
    "time": "Thu Jun 17 15:29:22 2021 +0100"
  },
  "message": "[peerdist] Assume that most recently discovered peer can be reused\n\nThe peer discovery time has a significant impact on the overall\nPeerDist download speed, since each block requires an individual\ndiscovery attempt.  In most cases, a peer that responds for block N\nwill turn out to also respond for block N+1.\n\nAssume that the most recently discovered peer (for any block) probably\nhas a copy of the next block to be discovered, thereby allowing the\npeer download attempt to begin immediately.\n\nIn the case that this assumption is incorrect, the existing error\nrecovery path will allow for fallback to newly discovered peers (or to\nthe origin server).\n\nSuggested-by: Andreas Hammarskjöld \u003cjunior@2PintSoftware.com\u003e\nSigned-off-by: Michael Brown \u003cmcb30@ipxe.org\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "55e3f7fa7bf102bd5fb2a6d1ed9886d4f5d3a3bf",
      "old_mode": 33188,
      "old_path": "src/net/peerdisc.c",
      "new_id": "d7e0d29896737db53479210ba32938a003479fe1",
      "new_mode": 33188,
      "new_path": "src/net/peerdisc.c"
    }
  ]
}