{
  "checks": [
    {
      "name": "exact support bound d=1 b=0",
      "passed": true
    },
    {
      "name": "exact support bound d=1 b=1",
      "passed": true
    },
    {
      "name": "exact support bound d=2 b=0",
      "passed": true
    },
    {
      "name": "exact support bound d=2 b=4",
      "passed": true
    },
    {
      "name": "exact support bound d=2 b=5",
      "passed": true
    },
    {
      "name": "exact support bound d=3 b=12",
      "passed": true
    },
    {
      "name": "half-product factorial bound d=1",
      "passed": true
    },
    {
      "name": "half-product factorial bound d=2",
      "passed": true
    },
    {
      "name": "half-product factorial bound d=3",
      "passed": true
    },
    {
      "name": "half-product factorial bound d=4",
      "passed": true
    },
    {
      "name": "half-product factorial bound d=5",
      "passed": true
    },
    {
      "name": "half-product factorial bound d=6",
      "passed": true
    },
    {
      "name": "half-product factorial bound d=7",
      "passed": true
    },
    {
      "name": "one-sweep support bound attained d=2",
      "passed": true
    },
    {
      "name": "one-sweep support bound attained d=3",
      "passed": true
    },
    {
      "name": "billion-slot symbolic entropy bound",
      "passed": true
    },
    {
      "name": "64-slot short-seed bound positive",
      "passed": true
    },
    {
      "name": "bounded seed input {'mode': 'seed_support_bound', 'dimension': True, 'seed_bits': 1}",
      "passed": true
    },
    {
      "name": "bounded seed input {'mode': 'seed_support_bound', 'dimension': 2, 'seed_bits': -1}",
      "passed": true
    },
    {
      "name": "bounded seed input {'mode': 'seed_support_bound', 'dimension': 2, 'seed_bits': 4097}",
      "passed": true
    },
    {
      "name": "bounded seed input {'mode': 'seed_support_bound', 'dimension': 64, 'seed_bits': 256}",
      "passed": true
    }
  ],
  "passed": 21,
  "failed": 0,
  "scope": "Support bound for deterministic b-bit-seeded full permutations, exact small factorials, one-sweep attainable controls and conservative symbolic large-domain product bound. No PRG or security evaluation."
}