Block #437,986

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/10/2014, 4:20:42 PM · Difficulty 10.3610 · 6,372,203 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ce2d54bde6a1d54a9cf0d7808bb015547904a15bfbbd864da9fd4bbc8261666c

Height

#437,986

Difficulty

10.360996

Transactions

5

Size

1.44 KB

Version

2

Bits

0a5c6a3f

Nonce

1,385,631

Timestamp

3/10/2014, 4:20:42 PM

Confirmations

6,372,203

Merkle Root

6fd2c39448723d2ae18078529da19b640977e84c48ea52f5a1c0813ed60623c1
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.843 × 10¹⁰²(103-digit number)
28430570171107841979…64526517322746212801
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.843 × 10¹⁰²(103-digit number)
28430570171107841979…64526517322746212801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.686 × 10¹⁰²(103-digit number)
56861140342215683958…29053034645492425601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.137 × 10¹⁰³(104-digit number)
11372228068443136791…58106069290984851201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.274 × 10¹⁰³(104-digit number)
22744456136886273583…16212138581969702401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.548 × 10¹⁰³(104-digit number)
45488912273772547166…32424277163939404801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.097 × 10¹⁰³(104-digit number)
90977824547545094333…64848554327878809601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.819 × 10¹⁰⁴(105-digit number)
18195564909509018866…29697108655757619201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.639 × 10¹⁰⁴(105-digit number)
36391129819018037733…59394217311515238401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.278 × 10¹⁰⁴(105-digit number)
72782259638036075466…18788434623030476801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.455 × 10¹⁰⁵(106-digit number)
14556451927607215093…37576869246060953601
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,582 XPM·at block #6,810,188 · 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