1{
 2  "seed": 251,
 3  "device": "cpu",
 4  "mathcheck": {
 5    "delta": 0.25,
 6    "capacity_formula": 0.3475898813907971,
 7    "code_rate": 0.25,
 8    "safe_rate_(eps=.1)": 0.3128308932517174,
 9    "rate_satisfies_margin": true
10  },
11  "results": [
12    {
13      "kind": "iid",
14      "q": 0.5,
15      "list_mean": 1.084375,
16      "list_max_mean": 3.0,
17      "collision_fraction": 0.083125,
18      "accuracy": {
19        "0": 1.0,
20        "0.25": 0.9359999895095825,
21        "0.5": 0.7144999802112579
22      },
23      "seconds": 29.046528816223145
24    },
25    {
26      "kind": "markov",
27      "q": 0.25,
28      "list_mean": 1.150625,
29      "list_max_mean": 2.5,
30      "collision_fraction": 0.1475,
31      "accuracy": {
32        "0": 1.0,
33        "0.25": 0.949999988079071,
34        "0.5": 0.8264999985694885
35      },
36      "seconds": 25.77687382698059
37    },
38    {
39      "kind": "markov",
40      "q": 0.4,
41      "list_mean": 1.055,
42      "list_max_mean": 2.5,
43      "collision_fraction": 0.05437499999999999,
44      "accuracy": {
45        "0": 1.0,
46        "0.25": 0.9674999713897705,
47        "0.5": 0.7804999947547913
48      },
49      "seconds": 25.91933584213257
50    }
51  ],
52  "notes": "iid q=.5 is the symmetric iid Bernoulli source; Markov q=.25 has positive persistence. Lists are sampled by inserting random bits and counting codewords that are subsequences."
53}