Block #363,019

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/17/2014, 3:06:58 AM · Difficulty 10.4143 · 6,445,615 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a3459d7084b9ba9700be3a67c502f06b128977810237414560119428e0b43083

Height

#363,019

Difficulty

10.414290

Transactions

1

Size

802 B

Version

2

Bits

0a6a0eee

Nonce

48,594

Timestamp

1/17/2014, 3:06:58 AM

Confirmations

6,445,615

Merkle Root

c859d7294c6b6bd2a0aad591b0fa393c33cf8c5c3ed24df1fcbf2a3312a719a7
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.960 × 10¹⁰¹(102-digit number)
39600085278543082078…50016993067134521681
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.960 × 10¹⁰¹(102-digit number)
39600085278543082078…50016993067134521681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.920 × 10¹⁰¹(102-digit number)
79200170557086164156…00033986134269043361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.584 × 10¹⁰²(103-digit number)
15840034111417232831…00067972268538086721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.168 × 10¹⁰²(103-digit number)
31680068222834465662…00135944537076173441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.336 × 10¹⁰²(103-digit number)
63360136445668931324…00271889074152346881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.267 × 10¹⁰³(104-digit number)
12672027289133786264…00543778148304693761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.534 × 10¹⁰³(104-digit number)
25344054578267572529…01087556296609387521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.068 × 10¹⁰³(104-digit number)
50688109156535145059…02175112593218775041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.013 × 10¹⁰⁴(105-digit number)
10137621831307029011…04350225186437550081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.027 × 10¹⁰⁴(105-digit number)
20275243662614058023…08700450372875100161
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,713,123 XPM·at block #6,808,633 · 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