Block #419,832

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/25/2014, 11:27:03 PM · Difficulty 10.3687 · 6,394,111 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d4c8548771235c90526c284663124a06dcdb45b2ebc297d3fafb16e4075d528c

Height

#419,832

Difficulty

10.368672

Transactions

2

Size

428 B

Version

2

Bits

0a5e6145

Nonce

38,174,845

Timestamp

2/25/2014, 11:27:03 PM

Confirmations

6,394,111

Merkle Root

cb9e5e1a36be63d7ac9c44c7cbdeb6f224c143d3c7464c2212d05a6ed1055a3a
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.871 × 10⁹⁶(97-digit number)
28717962049501530737…06566575845550270719
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.871 × 10⁹⁶(97-digit number)
28717962049501530737…06566575845550270719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.743 × 10⁹⁶(97-digit number)
57435924099003061475…13133151691100541439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.148 × 10⁹⁷(98-digit number)
11487184819800612295…26266303382201082879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.297 × 10⁹⁷(98-digit number)
22974369639601224590…52532606764402165759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.594 × 10⁹⁷(98-digit number)
45948739279202449180…05065213528804331519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.189 × 10⁹⁷(98-digit number)
91897478558404898361…10130427057608663039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.837 × 10⁹⁸(99-digit number)
18379495711680979672…20260854115217326079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.675 × 10⁹⁸(99-digit number)
36758991423361959344…40521708230434652159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.351 × 10⁹⁸(99-digit number)
73517982846723918689…81043416460869304319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.470 × 10⁹⁹(100-digit number)
14703596569344783737…62086832921738608639
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,755,621 XPM·at block #6,813,942 · 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