Block #1,545,907

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/17/2016, 8:19:04 PM · Difficulty 10.6558 · 5,265,246 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c14c112a0120e208cd2d1898df164af56052b450046b60355135ebe6f2d21196

Height

#1,545,907

Difficulty

10.655844

Transactions

39

Size

13.02 KB

Version

2

Bits

0aa7e561

Nonce

307,755,108

Timestamp

4/17/2016, 8:19:04 PM

Confirmations

5,265,246

Merkle Root

032b3d0a025e8ec7fcc164e3cac356b281b9dd84afa83c3e7fc705aef77efb83
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.900 × 10⁹⁴(95-digit number)
19008042259816846070…55147670094089851119
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.900 × 10⁹⁴(95-digit number)
19008042259816846070…55147670094089851119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.801 × 10⁹⁴(95-digit number)
38016084519633692141…10295340188179702239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.603 × 10⁹⁴(95-digit number)
76032169039267384282…20590680376359404479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.520 × 10⁹⁵(96-digit number)
15206433807853476856…41181360752718808959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.041 × 10⁹⁵(96-digit number)
30412867615706953712…82362721505437617919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.082 × 10⁹⁵(96-digit number)
60825735231413907425…64725443010875235839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.216 × 10⁹⁶(97-digit number)
12165147046282781485…29450886021750471679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.433 × 10⁹⁶(97-digit number)
24330294092565562970…58901772043500943359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.866 × 10⁹⁶(97-digit number)
48660588185131125940…17803544087001886719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.732 × 10⁹⁶(97-digit number)
97321176370262251881…35607088174003773439
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,733,334 XPM·at block #6,811,152 · 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