Block #2,148,503

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/6/2017, 12:03:18 PM · Difficulty 10.8957 · 4,678,632 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8e8e79203409eee23cbc78b9de80277b6aa57419151228c8dbe0050e4dab2f95

Height

#2,148,503

Difficulty

10.895712

Transactions

2

Size

2.41 KB

Version

2

Bits

0ae54d60

Nonce

924,875,116

Timestamp

6/6/2017, 12:03:18 PM

Confirmations

4,678,632

Merkle Root

f71976210cacddd9a1f344e54977bf3493026667d21bd330252e9d1f028e8186
Transactions (2)
1 in → 1 out8.4500 XPM109 B
15 in → 1 out3303.9070 XPM2.21 KB
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.326 × 10⁹⁶(97-digit number)
13266728484409667852…43387838082282641921
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.326 × 10⁹⁶(97-digit number)
13266728484409667852…43387838082282641921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.653 × 10⁹⁶(97-digit number)
26533456968819335704…86775676164565283841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.306 × 10⁹⁶(97-digit number)
53066913937638671408…73551352329130567681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.061 × 10⁹⁷(98-digit number)
10613382787527734281…47102704658261135361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.122 × 10⁹⁷(98-digit number)
21226765575055468563…94205409316522270721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.245 × 10⁹⁷(98-digit number)
42453531150110937126…88410818633044541441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.490 × 10⁹⁷(98-digit number)
84907062300221874253…76821637266089082881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.698 × 10⁹⁸(99-digit number)
16981412460044374850…53643274532178165761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.396 × 10⁹⁸(99-digit number)
33962824920088749701…07286549064356331521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.792 × 10⁹⁸(99-digit number)
67925649840177499402…14573098128712663041
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,861,260 XPM·at block #6,827,134 · 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