Block #363,498

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/17/2014, 11:15:46 AM · Difficulty 10.4136 · 6,444,590 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
96e5c7ed3ab887dd541f64750a7a3cb15b17a9369438651e50580491ce83351c

Height

#363,498

Difficulty

10.413607

Transactions

1

Size

867 B

Version

2

Bits

0a69e228

Nonce

546,853

Timestamp

1/17/2014, 11:15:46 AM

Confirmations

6,444,590

Merkle Root

c22d851a4ca6a42f680625c2791ad401c9acc32a9741c82b36a989b1ecc2acec
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.

2.159 × 10⁹⁵(96-digit number)
21591368670116966049…89854538269646827501
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
2.159 × 10⁹⁵(96-digit number)
21591368670116966049…89854538269646827501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.318 × 10⁹⁵(96-digit number)
43182737340233932099…79709076539293655001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.636 × 10⁹⁵(96-digit number)
86365474680467864198…59418153078587310001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.727 × 10⁹⁶(97-digit number)
17273094936093572839…18836306157174620001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.454 × 10⁹⁶(97-digit number)
34546189872187145679…37672612314349240001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.909 × 10⁹⁶(97-digit number)
69092379744374291358…75345224628698480001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.381 × 10⁹⁷(98-digit number)
13818475948874858271…50690449257396960001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.763 × 10⁹⁷(98-digit number)
27636951897749716543…01380898514793920001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.527 × 10⁹⁷(98-digit number)
55273903795499433086…02761797029587840001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.105 × 10⁹⁸(99-digit number)
11054780759099886617…05523594059175680001
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,708,749 XPM·at block #6,808,087 · 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.

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