Block #438,147

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/10/2014, 7:07:52 PM · Difficulty 10.3598 · 6,378,134 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b4c2d1bb5361afe71b2ede54e9643241485250c11783be0cd6d72f73e8097a01

Height

#438,147

Difficulty

10.359823

Transactions

9

Size

1.95 KB

Version

2

Bits

0a5c1d57

Nonce

164,682

Timestamp

3/10/2014, 7:07:52 PM

Confirmations

6,378,134

Merkle Root

0002d57d887fba38d136e309cac9c55620d5c174b90c4432dc28bb2a4bef108f
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.033 × 10⁹⁸(99-digit number)
50339404300098820645…41846698644710995159
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.033 × 10⁹⁸(99-digit number)
50339404300098820645…41846698644710995159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.006 × 10⁹⁹(100-digit number)
10067880860019764129…83693397289421990319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.013 × 10⁹⁹(100-digit number)
20135761720039528258…67386794578843980639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.027 × 10⁹⁹(100-digit number)
40271523440079056516…34773589157687961279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.054 × 10⁹⁹(100-digit number)
80543046880158113032…69547178315375922559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.610 × 10¹⁰⁰(101-digit number)
16108609376031622606…39094356630751845119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.221 × 10¹⁰⁰(101-digit number)
32217218752063245212…78188713261503690239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.443 × 10¹⁰⁰(101-digit number)
64434437504126490425…56377426523007380479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.288 × 10¹⁰¹(102-digit number)
12886887500825298085…12754853046014760959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.577 × 10¹⁰¹(102-digit number)
25773775001650596170…25509706092029521919
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,774,364 XPM·at block #6,816,280 · 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