Block #576,644

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/4/2014, 6:06:29 PM · Difficulty 10.9688 · 6,232,886 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a6b2c883297c683ebc97bdd1b918b646cfe96e5f68fa613061463e7e5c36ed36

Height

#576,644

Difficulty

10.968760

Transactions

8

Size

2.72 KB

Version

2

Bits

0af800ad

Nonce

1,901,782,549

Timestamp

6/4/2014, 6:06:29 PM

Confirmations

6,232,886

Merkle Root

ef2816d3302036927fe57268904eac59f85f62b2d12c596988cab8b2fc068c9b
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.

5.540 × 10⁹⁶(97-digit number)
55409700647644798966…92888879947869644159
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
5.540 × 10⁹⁶(97-digit number)
55409700647644798966…92888879947869644159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.108 × 10⁹⁷(98-digit number)
11081940129528959793…85777759895739288319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.216 × 10⁹⁷(98-digit number)
22163880259057919586…71555519791478576639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.432 × 10⁹⁷(98-digit number)
44327760518115839172…43111039582957153279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.865 × 10⁹⁷(98-digit number)
88655521036231678345…86222079165914306559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.773 × 10⁹⁸(99-digit number)
17731104207246335669…72444158331828613119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.546 × 10⁹⁸(99-digit number)
35462208414492671338…44888316663657226239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.092 × 10⁹⁸(99-digit number)
70924416828985342676…89776633327314452479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.418 × 10⁹⁹(100-digit number)
14184883365797068535…79553266654628904959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.836 × 10⁹⁹(100-digit number)
28369766731594137070…59106533309257809919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.673 × 10⁹⁹(100-digit number)
56739533463188274141…18213066618515619839
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,720,318 XPM·at block #6,809,529 · 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.

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