Block #432,230

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/6/2014, 6:05:29 PM · Difficulty 10.3444 · 6,377,980 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ec8d7ddef76d9f83cae919f53ef63cd0362daf5e04f0608c4f52c23350ba2883

Height

#432,230

Difficulty

10.344375

Transactions

2

Size

20.53 KB

Version

2

Bits

0a5828f2

Nonce

290,001

Timestamp

3/6/2014, 6:05:29 PM

Confirmations

6,377,980

Merkle Root

59d5ef67f7e8f098fabd15fd1dda85e610b8b3c26067e0c632e5218a9abaee47
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.

2.777 × 10¹⁰⁶(107-digit number)
27779997982687419086…97554437536849305601
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
2.777 × 10¹⁰⁶(107-digit number)
27779997982687419086…97554437536849305601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.555 × 10¹⁰⁶(107-digit number)
55559995965374838173…95108875073698611201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.111 × 10¹⁰⁷(108-digit number)
11111999193074967634…90217750147397222401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.222 × 10¹⁰⁷(108-digit number)
22223998386149935269…80435500294794444801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.444 × 10¹⁰⁷(108-digit number)
44447996772299870538…60871000589588889601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.889 × 10¹⁰⁷(108-digit number)
88895993544599741077…21742001179177779201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.777 × 10¹⁰⁸(109-digit number)
17779198708919948215…43484002358355558401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.555 × 10¹⁰⁸(109-digit number)
35558397417839896430…86968004716711116801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.111 × 10¹⁰⁸(109-digit number)
71116794835679792861…73936009433422233601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.422 × 10¹⁰⁹(110-digit number)
14223358967135958572…47872018866844467201
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,725,754 XPM·at block #6,810,209 · 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.

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