Block #620,111

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/6/2014, 5:38:22 PM · Difficulty 10.9492 · 6,189,422 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
afd1ebc4c2385b64ea41897b023e664cdc4f9cb876da0617e6369bb2e2c354eb

Height

#620,111

Difficulty

10.949182

Transactions

5

Size

20.31 KB

Version

2

Bits

0af2fd92

Nonce

587,912,966

Timestamp

7/6/2014, 5:38:22 PM

Confirmations

6,189,422

Merkle Root

861aa42ded82d96554e8bae2eaaa44e9bf8961f046c11bec8a67ae5bb01fbcff
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.

7.969 × 10⁹⁷(98-digit number)
79693546189389707958…45184118688629127681
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
7.969 × 10⁹⁷(98-digit number)
79693546189389707958…45184118688629127681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.593 × 10⁹⁸(99-digit number)
15938709237877941591…90368237377258255361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.187 × 10⁹⁸(99-digit number)
31877418475755883183…80736474754516510721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.375 × 10⁹⁸(99-digit number)
63754836951511766366…61472949509033021441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.275 × 10⁹⁹(100-digit number)
12750967390302353273…22945899018066042881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.550 × 10⁹⁹(100-digit number)
25501934780604706546…45891798036132085761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.100 × 10⁹⁹(100-digit number)
51003869561209413093…91783596072264171521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.020 × 10¹⁰⁰(101-digit number)
10200773912241882618…83567192144528343041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.040 × 10¹⁰⁰(101-digit number)
20401547824483765237…67134384289056686081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.080 × 10¹⁰⁰(101-digit number)
40803095648967530474…34268768578113372161
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,720,342 XPM·at block #6,809,532 · 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