)]}'
{
  "commit": "d879e299366895d7d80d83cfbbe05bc6a09e2a27",
  "tree": "92c02ea98a698155c6748aaf8930fee58b2b8151",
  "parents": [
    "bfefc27c2bb4af62e09569e36b018d60da98a680"
  ],
  "author": {
    "name": "Brian Smith",
    "email": "brian@briansmith.org",
    "time": "Tue Mar 22 17:30:42 2016 -1000"
  },
  "committer": {
    "name": "David Benjamin",
    "email": "davidben@google.com",
    "time": "Thu Mar 31 19:35:33 2016 +0000"
  },
  "message": "Further optimize Montgomery math in RSA blinding.\n\nChange-Id: I830c6115ce2515a7b9d1dcb153c4cd8928fb978f\nReviewed-on: https://boringssl-review.googlesource.com/7591\nReviewed-by: David Benjamin \u003cdavidben@google.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "db03d565f4b745c103212ef729e73b7a5c393484",
      "old_mode": 33188,
      "old_path": "crypto/rsa/blinding.c",
      "new_id": "776839e51ff00e1969ef120b6172cdcd094b0b8e",
      "new_mode": 33188,
      "new_path": "crypto/rsa/blinding.c"
    }
  ]
}