)]}'
{
  "commit": "e7e5a23b4ee7206a5ef935facf4ad28445ff01ca",
  "tree": "c0fea73bdc46407841c0cba62f51182073aea49b",
  "parents": [
    "6dfb479755a4a22960dc68efb65e9d061ce1f65f"
  ],
  "author": {
    "name": "David Benjamin",
    "email": "davidben@google.com",
    "time": "Sat Sep 14 13:23:35 2019 -0400"
  },
  "committer": {
    "name": "Adam Langley",
    "email": "agl@google.com",
    "time": "Mon Sep 30 18:03:50 2019 +0000"
  },
  "message": "Test some Euler pseudoprimes.\n\nThe Miller-Rabin test is an extension of the Fermat test (in addition to\nlooking for a^(n-1) !\u003d 1, it also looks for a non-trivial square root of\nunity). It thus seems prudent to sanity-check we indeed reject Fermat\npseudoprimes. Euler pseudoprimes are a stronger constraint, so test\nthose.\n\nChange-Id: I959769de2da3f8579403621bcf893e7c9247ca33\nReviewed-on: https://boringssl-review.googlesource.com/c/boringssl/+/37785\nReviewed-by: Adam Langley \u003cagl@google.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "b7427d59adf0c110b57c5c68a60e73e9cf4b0580",
      "old_mode": 33188,
      "old_path": "crypto/fipsmodule/bn/bn_test.cc",
      "new_id": "23c7574070b260589b5ed1df243e4c58272727cb",
      "new_mode": 33188,
      "new_path": "crypto/fipsmodule/bn/bn_test.cc"
    }
  ]
}