Block #617,045

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/4/2014, 7:41:15 PM · Difficulty 10.9459 · 6,190,528 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
63e917efeb90c36acfa0c5356fa3993cf2170448a9e9b5e1d3d76ad63a9610c3

Height

#617,045

Difficulty

10.945872

Transactions

9

Size

2.11 KB

Version

2

Bits

0af224af

Nonce

20,373,006

Timestamp

7/4/2014, 7:41:15 PM

Confirmations

6,190,528

Merkle Root

969256db2c2e9e5fbb41125bb35e07cbcc37cea48094b9c47507d76416840213
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.098 × 10⁹⁹(100-digit number)
30981281296077551991…23811642539078845441
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.098 × 10⁹⁹(100-digit number)
30981281296077551991…23811642539078845441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.196 × 10⁹⁹(100-digit number)
61962562592155103983…47623285078157690881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.239 × 10¹⁰⁰(101-digit number)
12392512518431020796…95246570156315381761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.478 × 10¹⁰⁰(101-digit number)
24785025036862041593…90493140312630763521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.957 × 10¹⁰⁰(101-digit number)
49570050073724083186…80986280625261527041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.914 × 10¹⁰⁰(101-digit number)
99140100147448166373…61972561250523054081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.982 × 10¹⁰¹(102-digit number)
19828020029489633274…23945122501046108161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.965 × 10¹⁰¹(102-digit number)
39656040058979266549…47890245002092216321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.931 × 10¹⁰¹(102-digit number)
79312080117958533098…95780490004184432641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.586 × 10¹⁰²(103-digit number)
15862416023591706619…91560980008368865281
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,704,615 XPM·at block #6,807,572 · 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