Block #435,975

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/9/2014, 7:20:27 AM · Difficulty 10.3550 · 6,380,652 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f0965b28fe0b5d7cdee339eec6649399a8ba8fc6a7054aa2e0aac4d83fcc5e90

Height

#435,975

Difficulty

10.355049

Transactions

4

Size

7.30 KB

Version

2

Bits

0a5ae486

Nonce

2,520

Timestamp

3/9/2014, 7:20:27 AM

Confirmations

6,380,652

Merkle Root

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

5.595 × 10⁹⁸(99-digit number)
55950834439763959662…10524482823631528721
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
5.595 × 10⁹⁸(99-digit number)
55950834439763959662…10524482823631528721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.119 × 10⁹⁹(100-digit number)
11190166887952791932…21048965647263057441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.238 × 10⁹⁹(100-digit number)
22380333775905583864…42097931294526114881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.476 × 10⁹⁹(100-digit number)
44760667551811167729…84195862589052229761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.952 × 10⁹⁹(100-digit number)
89521335103622335459…68391725178104459521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.790 × 10¹⁰⁰(101-digit number)
17904267020724467091…36783450356208919041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.580 × 10¹⁰⁰(101-digit number)
35808534041448934183…73566900712417838081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.161 × 10¹⁰⁰(101-digit number)
71617068082897868367…47133801424835676161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.432 × 10¹⁰¹(102-digit number)
14323413616579573673…94267602849671352321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.864 × 10¹⁰¹(102-digit number)
28646827233159147347…88535205699342704641
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,777,137 XPM·at block #6,816,626 · 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