Block #2,346,496

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/22/2017, 5:20:33 AM · Difficulty 10.8994 · 4,486,988 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2e29891e0b6c6422ceccd81c973a7d63bd283240e50d7e88d7b5b24957dbf727

Height

#2,346,496

Difficulty

10.899402

Transactions

26

Size

8.68 KB

Version

2

Bits

0ae63f36

Nonce

1,240,441,410

Timestamp

10/22/2017, 5:20:33 AM

Confirmations

4,486,988

Merkle Root

ddc5f583c5a742b177e3cac71f5b8810685d7742a33ed6ca393140d2668cb281
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.870 × 10⁹⁵(96-digit number)
58701042971378350603…00253751806296181761
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.870 × 10⁹⁵(96-digit number)
58701042971378350603…00253751806296181761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.174 × 10⁹⁶(97-digit number)
11740208594275670120…00507503612592363521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.348 × 10⁹⁶(97-digit number)
23480417188551340241…01015007225184727041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.696 × 10⁹⁶(97-digit number)
46960834377102680483…02030014450369454081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.392 × 10⁹⁶(97-digit number)
93921668754205360966…04060028900738908161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.878 × 10⁹⁷(98-digit number)
18784333750841072193…08120057801477816321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.756 × 10⁹⁷(98-digit number)
37568667501682144386…16240115602955632641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.513 × 10⁹⁷(98-digit number)
75137335003364288773…32480231205911265281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.502 × 10⁹⁸(99-digit number)
15027467000672857754…64960462411822530561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.005 × 10⁹⁸(99-digit number)
30054934001345715509…29920924823645061121
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,912,076 XPM·at block #6,833,483 · 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