Block #415,136

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/22/2014, 12:26:48 PM · Difficulty 10.4008 · 6,397,609 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7703bde39d4f19c8b18ade86a39f156a6987ac7b522a14523032b127c74f3eab

Height

#415,136

Difficulty

10.400828

Transactions

2

Size

1.21 KB

Version

2

Bits

0a669cae

Nonce

33,378

Timestamp

2/22/2014, 12:26:48 PM

Confirmations

6,397,609

Merkle Root

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

1.289 × 10⁹⁹(100-digit number)
12898155047458958537…43080636766303447041
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
1.289 × 10⁹⁹(100-digit number)
12898155047458958537…43080636766303447041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.579 × 10⁹⁹(100-digit number)
25796310094917917075…86161273532606894081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.159 × 10⁹⁹(100-digit number)
51592620189835834150…72322547065213788161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.031 × 10¹⁰⁰(101-digit number)
10318524037967166830…44645094130427576321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.063 × 10¹⁰⁰(101-digit number)
20637048075934333660…89290188260855152641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.127 × 10¹⁰⁰(101-digit number)
41274096151868667320…78580376521710305281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.254 × 10¹⁰⁰(101-digit number)
82548192303737334640…57160753043420610561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.650 × 10¹⁰¹(102-digit number)
16509638460747466928…14321506086841221121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.301 × 10¹⁰¹(102-digit number)
33019276921494933856…28643012173682442241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.603 × 10¹⁰¹(102-digit number)
66038553842989867712…57286024347364884481
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,003 XPM·at block #6,812,744 · 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