Block #3,266,071

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/14/2019, 12:43:17 AM · Difficulty 10.9959 · 3,578,973 confirmations

2CC
Cunningham Chain of the Second Kind

A sequence where each prime is double the previous prime minus one.

Block Header
Block Hash
6b14edd8e720fb69545698a4696ead865ebc01d4fa31d0ad35a7103367c258d3

Height

#3,266,071

Difficulty

10.995862

Transactions

5

Size

2.40 KB

Version

2

Bits

0afef0cc

Nonce

903,817,956

Timestamp

7/14/2019, 12:43:17 AM

Confirmations

3,578,973

Merkle Root

74f86e61ab40290d92e4193ca26fe74596134a28c3866ed52813c66bd2272032
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

1.810 × 10⁹⁵(96-digit number)
18109788099231037793…55107919648002400961
Discovered Prime Numbers
p_k = 2^k × origin + 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin + 1
1.810 × 10⁹⁵(96-digit number)
18109788099231037793…55107919648002400961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.621 × 10⁹⁵(96-digit number)
36219576198462075587…10215839296004801921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.243 × 10⁹⁵(96-digit number)
72439152396924151174…20431678592009603841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.448 × 10⁹⁶(97-digit number)
14487830479384830234…40863357184019207681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.897 × 10⁹⁶(97-digit number)
28975660958769660469…81726714368038415361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.795 × 10⁹⁶(97-digit number)
57951321917539320939…63453428736076830721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.159 × 10⁹⁷(98-digit number)
11590264383507864187…26906857472153661441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.318 × 10⁹⁷(98-digit number)
23180528767015728375…53813714944307322881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.636 × 10⁹⁷(98-digit number)
46361057534031456751…07627429888614645761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.272 × 10⁹⁷(98-digit number)
92722115068062913503…15254859777229291521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.854 × 10⁹⁸(99-digit number)
18544423013612582700…30509719554458583041
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 consecutive prime numbers forming a Cunningham Chain of the Second Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★★☆☆
Rarity
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:58,004,775 XPM·at block #6,845,043 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.
Privacy Policy·

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy