Block #354,225

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/11/2014, 10:23:08 AM · Difficulty 10.3382 · 6,459,636 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
36476de1be2cf49b3cf3dc201ba26082b3c5eabdc7d835cf030cdf1693db7a4d

Height

#354,225

Difficulty

10.338234

Transactions

29

Size

10.29 KB

Version

2

Bits

0a569680

Nonce

150,668

Timestamp

1/11/2014, 10:23:08 AM

Confirmations

6,459,636

Merkle Root

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

9.674 × 10⁹⁹(100-digit number)
96744137764615262521…80997897141086369301
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
9.674 × 10⁹⁹(100-digit number)
96744137764615262521…80997897141086369301
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.934 × 10¹⁰⁰(101-digit number)
19348827552923052504…61995794282172738601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.869 × 10¹⁰⁰(101-digit number)
38697655105846105008…23991588564345477201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.739 × 10¹⁰⁰(101-digit number)
77395310211692210017…47983177128690954401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.547 × 10¹⁰¹(102-digit number)
15479062042338442003…95966354257381908801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.095 × 10¹⁰¹(102-digit number)
30958124084676884006…91932708514763817601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.191 × 10¹⁰¹(102-digit number)
61916248169353768013…83865417029527635201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.238 × 10¹⁰²(103-digit number)
12383249633870753602…67730834059055270401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.476 × 10¹⁰²(103-digit number)
24766499267741507205…35461668118110540801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.953 × 10¹⁰²(103-digit number)
49532998535483014411…70923336236221081601
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,754,960 XPM·at block #6,813,860 · 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