Block #363,268

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/17/2014, 7:38:17 AM · Difficulty 10.4120 · 6,444,477 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2daa10360ed9f62b2f66380c2d9b4b906fc20a9a4324d8b27ad732022d059b41

Height

#363,268

Difficulty

10.412023

Transactions

2

Size

665 B

Version

2

Bits

0a697a59

Nonce

297,061

Timestamp

1/17/2014, 7:38:17 AM

Confirmations

6,444,477

Merkle Root

c79f1a309d934bbee326d42db604102d2eb4e0b87b5529b923594d380cde692d
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.523 × 10¹⁰⁴(105-digit number)
15235886633483183626…77670268486528442241
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.523 × 10¹⁰⁴(105-digit number)
15235886633483183626…77670268486528442241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.047 × 10¹⁰⁴(105-digit number)
30471773266966367253…55340536973056884481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.094 × 10¹⁰⁴(105-digit number)
60943546533932734506…10681073946113768961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.218 × 10¹⁰⁵(106-digit number)
12188709306786546901…21362147892227537921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.437 × 10¹⁰⁵(106-digit number)
24377418613573093802…42724295784455075841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.875 × 10¹⁰⁵(106-digit number)
48754837227146187604…85448591568910151681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.750 × 10¹⁰⁵(106-digit number)
97509674454292375209…70897183137820303361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.950 × 10¹⁰⁶(107-digit number)
19501934890858475041…41794366275640606721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.900 × 10¹⁰⁶(107-digit number)
39003869781716950083…83588732551281213441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.800 × 10¹⁰⁶(107-digit number)
78007739563433900167…67177465102562426881
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,705,997 XPM·at block #6,807,744 · 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