Block #431,732

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/6/2014, 10:12:32 AM · Difficulty 10.3411 · 6,385,194 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5ef7e2955983471015db95cc614d41dae8101ac31803ffc2074d6beca48a0c1c

Height

#431,732

Difficulty

10.341101

Transactions

2

Size

1.13 KB

Version

2

Bits

0a57526a

Nonce

191,468

Timestamp

3/6/2014, 10:12:32 AM

Confirmations

6,385,194

Merkle Root

633777c6abf74c9703d577b818c789d1a7f914eb7aa572fcfdad09642feafd41
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.429 × 10⁹⁵(96-digit number)
54299526710472836890…23968258500934533441
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.429 × 10⁹⁵(96-digit number)
54299526710472836890…23968258500934533441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.085 × 10⁹⁶(97-digit number)
10859905342094567378…47936517001869066881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.171 × 10⁹⁶(97-digit number)
21719810684189134756…95873034003738133761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.343 × 10⁹⁶(97-digit number)
43439621368378269512…91746068007476267521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.687 × 10⁹⁶(97-digit number)
86879242736756539024…83492136014952535041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.737 × 10⁹⁷(98-digit number)
17375848547351307804…66984272029905070081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.475 × 10⁹⁷(98-digit number)
34751697094702615609…33968544059810140161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.950 × 10⁹⁷(98-digit number)
69503394189405231219…67937088119620280321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.390 × 10⁹⁸(99-digit number)
13900678837881046243…35874176239240560641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.780 × 10⁹⁸(99-digit number)
27801357675762092487…71748352478481121281
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,779,449 XPM·at block #6,816,925 · 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