Block #668,477

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/8/2014, 6:50:21 AM · Difficulty 10.9636 · 6,162,256 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
227ff147b266486656930d1d0da09d88fa47b2bc824548020db289b9568076d7

Height

#668,477

Difficulty

10.963557

Transactions

5

Size

2.10 KB

Version

2

Bits

0af6abaa

Nonce

3,205,324,347

Timestamp

8/8/2014, 6:50:21 AM

Confirmations

6,162,256

Merkle Root

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

3.392 × 10⁹⁵(96-digit number)
33924820672230765893…80430702925105593921
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
3.392 × 10⁹⁵(96-digit number)
33924820672230765893…80430702925105593921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.784 × 10⁹⁵(96-digit number)
67849641344461531787…60861405850211187841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.356 × 10⁹⁶(97-digit number)
13569928268892306357…21722811700422375681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.713 × 10⁹⁶(97-digit number)
27139856537784612714…43445623400844751361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.427 × 10⁹⁶(97-digit number)
54279713075569225429…86891246801689502721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.085 × 10⁹⁷(98-digit number)
10855942615113845085…73782493603379005441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.171 × 10⁹⁷(98-digit number)
21711885230227690171…47564987206758010881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.342 × 10⁹⁷(98-digit number)
43423770460455380343…95129974413516021761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.684 × 10⁹⁷(98-digit number)
86847540920910760687…90259948827032043521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.736 × 10⁹⁸(99-digit number)
17369508184182152137…80519897654064087041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.473 × 10⁹⁸(99-digit number)
34739016368364304274…61039795308128174081
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:57,890,000 XPM·at block #6,830,732 · 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