Block #2,468,630

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/11/2018, 11:05:55 PM · Difficulty 10.9601 · 4,373,147 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
de84cd91a6d772b3d136a7095f2bec6407440f3c88cc043b185ec0f3281cddfd

Height

#2,468,630

Difficulty

10.960087

Transactions

2

Size

574 B

Version

2

Bits

0af5c83c

Nonce

853,616,187

Timestamp

1/11/2018, 11:05:55 PM

Confirmations

4,373,147

Merkle Root

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

3.355 × 10⁹⁴(95-digit number)
33556303103123436455…08183506483210117761
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
3.355 × 10⁹⁴(95-digit number)
33556303103123436455…08183506483210117761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.711 × 10⁹⁴(95-digit number)
67112606206246872911…16367012966420235521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.342 × 10⁹⁵(96-digit number)
13422521241249374582…32734025932840471041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.684 × 10⁹⁵(96-digit number)
26845042482498749164…65468051865680942081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.369 × 10⁹⁵(96-digit number)
53690084964997498329…30936103731361884161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.073 × 10⁹⁶(97-digit number)
10738016992999499665…61872207462723768321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.147 × 10⁹⁶(97-digit number)
21476033985998999331…23744414925447536641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.295 × 10⁹⁶(97-digit number)
42952067971997998663…47488829850895073281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.590 × 10⁹⁶(97-digit number)
85904135943995997326…94977659701790146561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.718 × 10⁹⁷(98-digit number)
17180827188799199465…89955319403580293121
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,978,592 XPM·at block #6,841,776 · 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