Block #2,454,679

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/2/2018, 9:04:38 PM · Difficulty 10.9521 · 4,372,451 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
876c9788665c436082ca74f6aa06dea78288941a020c86c01674f737cb9e60b2

Height

#2,454,679

Difficulty

10.952111

Transactions

2

Size

743 B

Version

2

Bits

0af3bd8e

Nonce

214,939,592

Timestamp

1/2/2018, 9:04:38 PM

Confirmations

4,372,451

Merkle Root

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

9.890 × 10⁹³(94-digit number)
98907602022704451219…60931692263531354239
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
9.890 × 10⁹³(94-digit number)
98907602022704451219…60931692263531354239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.978 × 10⁹⁴(95-digit number)
19781520404540890243…21863384527062708479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.956 × 10⁹⁴(95-digit number)
39563040809081780487…43726769054125416959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.912 × 10⁹⁴(95-digit number)
79126081618163560975…87453538108250833919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.582 × 10⁹⁵(96-digit number)
15825216323632712195…74907076216501667839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.165 × 10⁹⁵(96-digit number)
31650432647265424390…49814152433003335679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.330 × 10⁹⁵(96-digit number)
63300865294530848780…99628304866006671359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.266 × 10⁹⁶(97-digit number)
12660173058906169756…99256609732013342719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.532 × 10⁹⁶(97-digit number)
25320346117812339512…98513219464026685439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.064 × 10⁹⁶(97-digit number)
50640692235624679024…97026438928053370879
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,861,222 XPM·at block #6,827,129 · 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