Block #2,925,233

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/16/2018, 9:38:58 AM · Difficulty 11.3543 · 3,913,333 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3385e99dd2faa4f27a18450d1f27b278407f58b3450bf31e94341b56c87d9158

Height

#2,925,233

Difficulty

11.354313

Transactions

11

Size

72.90 KB

Version

2

Bits

0b5ab446

Nonce

1,414,143,518

Timestamp

11/16/2018, 9:38:58 AM

Confirmations

3,913,333

Merkle Root

64153cacd2f98e5f8076e1187bbf66514f4580b4d47623bd67edc46dcfcc9e6b
Transactions (11)
1 in → 1 out8.5400 XPM110 B
50 in → 1 out248.8952 XPM7.27 KB
50 in → 1 out232.0130 XPM7.27 KB
50 in → 1 out219.8430 XPM7.27 KB
50 in → 1 out221.7363 XPM7.27 KB
50 in → 1 out214.0923 XPM7.26 KB
50 in → 1 out224.0167 XPM7.27 KB
50 in → 1 out246.5031 XPM7.27 KB
50 in → 1 out216.1872 XPM7.27 KB
50 in → 1 out213.3542 XPM7.27 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.224 × 10⁹⁷(98-digit number)
12241060963678480611…98972813361827809281
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.224 × 10⁹⁷(98-digit number)
12241060963678480611…98972813361827809281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.448 × 10⁹⁷(98-digit number)
24482121927356961222…97945626723655618561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.896 × 10⁹⁷(98-digit number)
48964243854713922444…95891253447311237121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.792 × 10⁹⁷(98-digit number)
97928487709427844889…91782506894622474241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.958 × 10⁹⁸(99-digit number)
19585697541885568977…83565013789244948481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.917 × 10⁹⁸(99-digit number)
39171395083771137955…67130027578489896961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.834 × 10⁹⁸(99-digit number)
78342790167542275911…34260055156979793921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.566 × 10⁹⁹(100-digit number)
15668558033508455182…68520110313959587841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.133 × 10⁹⁹(100-digit number)
31337116067016910364…37040220627919175681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.267 × 10⁹⁹(100-digit number)
62674232134033820729…74080441255838351361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.253 × 10¹⁰⁰(101-digit number)
12534846426806764145…48160882511676702721
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,952,812 XPM·at block #6,838,565 · 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