runMode: serial
maxCount: 10000
repeat: 1
LOCheck: 0
dataset: codeTables
datafile: QECC_sample.txt
method: DistRndGAP
ignoreTrivialCodes: 1
resume: 0
nMin: 1
nMax: 100000
iterCount: 10000
maxTime: 28800
nThreads: 1
verbose: False
maxErr: -1
GF4blockRep: 2
regroupPerm: 1
filterCircuit: 1
HL: 0
genCount: 100
offspring: 10
pMut: 2.0
sMut: 0.2
tabuLength: 0
swapPivot: 1
swapBlockorder: 0
pMutScale: 50
CCstart: -1
pySATsolver: g4
pySATbinary: lsu
addStabs: 0
permuteDEM: 1
outfile: /Users/markwebster/Dropbox/QuantumComputing/dev/codeDistance-main/examples/results/codeTables-QECC_sample.txt-DistRndGAP-20260303_211748.394245_85062422.txt
#########################################
name	n	k	d	delta d	Time	R	T	Progress
[[3,1,1]]	3	1	1	0	12.141098790976685	1	1	\nThe found distance 1<=1 too small, exiting!\n
[[4,1,2]]	4	1	2	0	1.599934708996443	1	1	\n10000 rounds of 10000 were made.\nFirst vector found with lowest weight:\n . 1 . . . 1 . .\nMiimum weight vector found 40000 times\n[[4,1,2]];  Field: GF(2)\n<n>=6666.666666666666 X^2_5=5003.0687\n
[[5,1,3]]	5	1	3	0	1.571263916004682	1	1	\n10000 rounds of 10000 were made.\nFirst vector found with lowest weight:\n 1 . . . . 1 . . . 1\nMiimum weight vector found 53293 times\n[[5,1,3]];  Field: GF(2)\n<n>=1903.321428571428 X^2_27=19503.17353123299\n
[[6,1,3]]	6	1	3	0	1.5964117500116117	1	1	\n10000 rounds of 10000 were made.\nFirst vector found with lowest weight:\n 1 1 1 . . . 1 . . . . .\nMiimum weight vector found 53396 times\n[[6,1,3]];  Field: GF(2)\n<n>=1907. X^2_27=19466.89984268484\n
[[7,1,3]]	7	1	3	0	1.6063565420045052	1	1	\n10000 rounds of 10000 were made.\nFirst vector found with lowest weight:\n 1 . 1 . . . 1 . . . . . . .\nMiimum weight vector found 60000 times\n[[7,1,3]];  Field: GF(2)\n<n>=4285.714285714285 X^2_13=7.016066666666667\n
