Block #435,293

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/8/2014, 7:49:55 PM · Difficulty 10.3558 · 6,389,629 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c51e9066301206a4ba43800146d70ae8a3c30ca638300bb298c02370fca8d4f5

Height

#435,293

Difficulty

10.355795

Transactions

11

Size

2.41 KB

Version

2

Bits

0a5b155f

Nonce

66,453

Timestamp

3/8/2014, 7:49:55 PM

Confirmations

6,389,629

Merkle Root

1d85e4b99a4dfccb466e2255ca7d5706e991bfb0ce727504acdfdef8f3c34f6f
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.550 × 10¹⁰²(103-digit number)
35502532896188661158…79442028651027148521
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.550 × 10¹⁰²(103-digit number)
35502532896188661158…79442028651027148521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.100 × 10¹⁰²(103-digit number)
71005065792377322316…58884057302054297041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.420 × 10¹⁰³(104-digit number)
14201013158475464463…17768114604108594081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.840 × 10¹⁰³(104-digit number)
28402026316950928926…35536229208217188161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.680 × 10¹⁰³(104-digit number)
56804052633901857853…71072458416434376321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.136 × 10¹⁰⁴(105-digit number)
11360810526780371570…42144916832868752641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.272 × 10¹⁰⁴(105-digit number)
22721621053560743141…84289833665737505281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.544 × 10¹⁰⁴(105-digit number)
45443242107121486282…68579667331475010561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.088 × 10¹⁰⁴(105-digit number)
90886484214242972565…37159334662950021121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.817 × 10¹⁰⁵(106-digit number)
18177296842848594513…74318669325900042241
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,843,453 XPM·at block #6,824,921 · 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