Block #432,008

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/6/2014, 2:18:18 PM · Difficulty 10.3449 · 6,380,852 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
463cfdf26c5c20e1c6b2a3e757a747f6cd45c66ce38d2de927a4002b39c360bb

Height

#432,008

Difficulty

10.344860

Transactions

8

Size

3.03 KB

Version

2

Bits

0a5848bc

Nonce

27,814

Timestamp

3/6/2014, 2:18:18 PM

Confirmations

6,380,852

Merkle Root

08cbfc71de6f76afae640f21a49a0de885f86c42e9a4b275cac767cad1e1a3a1
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.

4.228 × 10⁹⁷(98-digit number)
42284934822462553944…96068940469671247201
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
4.228 × 10⁹⁷(98-digit number)
42284934822462553944…96068940469671247201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.456 × 10⁹⁷(98-digit number)
84569869644925107889…92137880939342494401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.691 × 10⁹⁸(99-digit number)
16913973928985021577…84275761878684988801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.382 × 10⁹⁸(99-digit number)
33827947857970043155…68551523757369977601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.765 × 10⁹⁸(99-digit number)
67655895715940086311…37103047514739955201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.353 × 10⁹⁹(100-digit number)
13531179143188017262…74206095029479910401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.706 × 10⁹⁹(100-digit number)
27062358286376034524…48412190058959820801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.412 × 10⁹⁹(100-digit number)
54124716572752069049…96824380117919641601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.082 × 10¹⁰⁰(101-digit number)
10824943314550413809…93648760235839283201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.164 × 10¹⁰⁰(101-digit number)
21649886629100827619…87297520471678566401
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,746,917 XPM·at block #6,812,859 · 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