Block #342,060

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/3/2014, 8:20:10 PM · Difficulty 10.1500 · 6,483,407 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8e808b25a568b2234822a94455b1d505c38c3cd9ecf1457bdef8f31f39c7cc70

Height

#342,060

Difficulty

10.149988

Transactions

1

Size

1.04 KB

Version

2

Bits

0a2665a3

Nonce

16,479

Timestamp

1/3/2014, 8:20:10 PM

Confirmations

6,483,407

Merkle Root

d483cfa27a13161bfc7bf892e73bc136eb856e4093017c6baf2580e3a819a1f8
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.673 × 10⁹⁵(96-digit number)
36737710006873505434…33965365968059069041
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.673 × 10⁹⁵(96-digit number)
36737710006873505434…33965365968059069041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.347 × 10⁹⁵(96-digit number)
73475420013747010868…67930731936118138081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.469 × 10⁹⁶(97-digit number)
14695084002749402173…35861463872236276161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.939 × 10⁹⁶(97-digit number)
29390168005498804347…71722927744472552321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.878 × 10⁹⁶(97-digit number)
58780336010997608694…43445855488945104641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.175 × 10⁹⁷(98-digit number)
11756067202199521738…86891710977890209281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.351 × 10⁹⁷(98-digit number)
23512134404399043477…73783421955780418561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.702 × 10⁹⁷(98-digit number)
47024268808798086955…47566843911560837121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.404 × 10⁹⁷(98-digit number)
94048537617596173911…95133687823121674241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.880 × 10⁹⁸(99-digit number)
18809707523519234782…90267375646243348481
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,847,828 XPM·at block #6,825,466 · 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