Block #354,341

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/11/2014, 12:00:07 PM · Difficulty 10.3408 · 6,462,743 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1ecc60c8da3ae07ad29b830fb91f4d9ee28e657aba0ea764037bcdb1ec93dca5

Height

#354,341

Difficulty

10.340778

Transactions

5

Size

1.22 KB

Version

2

Bits

0a573d33

Nonce

98,702

Timestamp

1/11/2014, 12:00:07 PM

Confirmations

6,462,743

Merkle Root

484b15812a1d5c7fafb72b42b2bdf63c05d047bc1960620a7d583c678db3304b
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.295 × 10⁹⁷(98-digit number)
12954227190397011671…75523372401023385601
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.295 × 10⁹⁷(98-digit number)
12954227190397011671…75523372401023385601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.590 × 10⁹⁷(98-digit number)
25908454380794023342…51046744802046771201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.181 × 10⁹⁷(98-digit number)
51816908761588046684…02093489604093542401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.036 × 10⁹⁸(99-digit number)
10363381752317609336…04186979208187084801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.072 × 10⁹⁸(99-digit number)
20726763504635218673…08373958416374169601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.145 × 10⁹⁸(99-digit number)
41453527009270437347…16747916832748339201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.290 × 10⁹⁸(99-digit number)
82907054018540874694…33495833665496678401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.658 × 10⁹⁹(100-digit number)
16581410803708174938…66991667330993356801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.316 × 10⁹⁹(100-digit number)
33162821607416349877…33983334661986713601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.632 × 10⁹⁹(100-digit number)
66325643214832699755…67966669323973427201
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,780,710 XPM·at block #6,817,083 · 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