Block #353,503

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/10/2014, 11:41:22 PM · Difficulty 10.3279 · 6,464,334 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1801af4b5e199bc4cc26d676b3c1abe15b68b3f9f364afd1f410d09914c58323

Height

#353,503

Difficulty

10.327880

Transactions

2

Size

575 B

Version

2

Bits

0a53eff1

Nonce

49,949

Timestamp

1/10/2014, 11:41:22 PM

Confirmations

6,464,334

Merkle Root

58677f81d8240ae35feaf67edd97bc13b2946bdd746b2044d40d6298911c2653
Transactions (2)
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.522 × 10⁹⁴(95-digit number)
15224611727412205551…12616523941503851521
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.522 × 10⁹⁴(95-digit number)
15224611727412205551…12616523941503851521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.044 × 10⁹⁴(95-digit number)
30449223454824411102…25233047883007703041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.089 × 10⁹⁴(95-digit number)
60898446909648822204…50466095766015406081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.217 × 10⁹⁵(96-digit number)
12179689381929764440…00932191532030812161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.435 × 10⁹⁵(96-digit number)
24359378763859528881…01864383064061624321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.871 × 10⁹⁵(96-digit number)
48718757527719057763…03728766128123248641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.743 × 10⁹⁵(96-digit number)
97437515055438115527…07457532256246497281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.948 × 10⁹⁶(97-digit number)
19487503011087623105…14915064512492994561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.897 × 10⁹⁶(97-digit number)
38975006022175246210…29830129024985989121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.795 × 10⁹⁶(97-digit number)
77950012044350492421…59660258049971978241
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,786,760 XPM·at block #6,817,836 · 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