Block #1,451,407

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/11/2016, 3:50:12 AM · Difficulty 10.7427 · 5,365,764 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
dc1b417c59cd16508f7e8ad986f95355fc070115b36964c050b671920f04a3cc

Height

#1,451,407

Difficulty

10.742697

Transactions

2

Size

573 B

Version

2

Bits

0abe216a

Nonce

1,623,456,632

Timestamp

2/11/2016, 3:50:12 AM

Confirmations

5,365,764

Merkle Root

2c32ccc9a2304eaa45a2b70582cc23350fdc84cad27d357aec2a804e7ddd7391
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.

1.232 × 10⁹⁷(98-digit number)
12322141586344293705…43572377523403939839
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.232 × 10⁹⁷(98-digit number)
12322141586344293705…43572377523403939839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.464 × 10⁹⁷(98-digit number)
24644283172688587411…87144755046807879679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.928 × 10⁹⁷(98-digit number)
49288566345377174823…74289510093615759359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.857 × 10⁹⁷(98-digit number)
98577132690754349647…48579020187231518719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.971 × 10⁹⁸(99-digit number)
19715426538150869929…97158040374463037439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.943 × 10⁹⁸(99-digit number)
39430853076301739859…94316080748926074879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.886 × 10⁹⁸(99-digit number)
78861706152603479718…88632161497852149759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.577 × 10⁹⁹(100-digit number)
15772341230520695943…77264322995704299519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.154 × 10⁹⁹(100-digit number)
31544682461041391887…54528645991408599039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.308 × 10⁹⁹(100-digit number)
63089364922082783774…09057291982817198079
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,781,403 XPM·at block #6,817,170 · 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