Block #2,348,480

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/23/2017, 4:04:17 PM · Difficulty 10.8975 · 4,493,966 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e23e7835eab69595427324f19d12ac48b045191256230851b2be7ce267241660

Height

#2,348,480

Difficulty

10.897453

Transactions

2

Size

542 B

Version

2

Bits

0ae5bf80

Nonce

253,755,463

Timestamp

10/23/2017, 4:04:17 PM

Confirmations

4,493,966

Merkle Root

f9685e525b2c2db5656658f250cbbdfe9a33913afb382830d51d547816d81633
Transactions (2)
1 in → 1 out8.4200 XPM110 B
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.

8.782 × 10⁹⁵(96-digit number)
87821075903402509865…45755797466013180161
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
8.782 × 10⁹⁵(96-digit number)
87821075903402509865…45755797466013180161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.756 × 10⁹⁶(97-digit number)
17564215180680501973…91511594932026360321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.512 × 10⁹⁶(97-digit number)
35128430361361003946…83023189864052720641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.025 × 10⁹⁶(97-digit number)
70256860722722007892…66046379728105441281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.405 × 10⁹⁷(98-digit number)
14051372144544401578…32092759456210882561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.810 × 10⁹⁷(98-digit number)
28102744289088803156…64185518912421765121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.620 × 10⁹⁷(98-digit number)
56205488578177606313…28371037824843530241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.124 × 10⁹⁸(99-digit number)
11241097715635521262…56742075649687060481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.248 × 10⁹⁸(99-digit number)
22482195431271042525…13484151299374120961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.496 × 10⁹⁸(99-digit number)
44964390862542085051…26968302598748241921
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,983,985 XPM·at block #6,842,445 · 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