)]}'
{
  "commit": "b2eaeb0b8b90578b740b561b8e498ca1b54e9095",
  "tree": "5cddd0626f7bc3969a0d4543eac177b8a2bbe089",
  "parents": [
    "861f384d7bc59241a9df1634ae938d8e75be2d30"
  ],
  "author": {
    "name": "Adam Langley",
    "email": "alangley@gmail.com",
    "time": "Fri Mar 30 16:18:54 2018 -0700"
  },
  "committer": {
    "name": "CQ bot account: commit-bot@chromium.org",
    "email": "commit-bot@chromium.org",
    "time": "Thu Apr 05 03:53:01 2018 +0000"
  },
  "message": "Drop some trial-division primes for 1024-bit candidates.\n\nThis is helpful at smaller sizes because the benefits of an unlikely hit\nby trival-division are smaller.\n\nThe full set of kPrimes eliminates about 94.3% of random numbers. The\nfirst quarter eliminates about 93.2% of them. But the little extra power\nof the full set seems to be borderline for RSA 3072 and clearly positive\nfor RSA 4096.\n\nDid 316 RSA 2048 key-gen operations in 30035598us (10.5 ops/sec)\n  min: 19423us, median: 80448us, max: 394265us\n\nChange-Id: Iee53f721329674ae7a08fabd85b4f645c24e119d\nReviewed-on: https://boringssl-review.googlesource.com/26944\nCommit-Queue: David Benjamin \u003cdavidben@google.com\u003e\nCQ-Verified: CQ bot account: commit-bot@chromium.org \u003ccommit-bot@chromium.org\u003e\nReviewed-by: David Benjamin \u003cdavidben@google.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "d2dfc2c8e27200ed6751d6414b2dee0639cd8570",
      "old_mode": 33188,
      "old_path": "crypto/fipsmodule/bn/prime.c",
      "new_id": "a18d377163220de76c62bd6d23e9b8e625f16784",
      "new_mode": 33188,
      "new_path": "crypto/fipsmodule/bn/prime.c"
    }
  ]
}