Block #395,195

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/8/2014, 1:14:10 PM · Difficulty 10.4126 · 6,419,105 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a7eb16dc3749795766b0104f53d594ab9cf42387c7bcb18ebb5b38519cc3b4d9

Height

#395,195

Difficulty

10.412608

Transactions

5

Size

12.50 KB

Version

2

Bits

0a69a0a8

Nonce

16,289

Timestamp

2/8/2014, 1:14:10 PM

Confirmations

6,419,105

Merkle Root

1dd5ccf0e2be6520ab26e442af03486e73fdf4c24715463de872a2074e5fd5d0
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.158 × 10⁹⁴(95-digit number)
31589122451423695617…38413758235165665281
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.158 × 10⁹⁴(95-digit number)
31589122451423695617…38413758235165665281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.317 × 10⁹⁴(95-digit number)
63178244902847391234…76827516470331330561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.263 × 10⁹⁵(96-digit number)
12635648980569478246…53655032940662661121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.527 × 10⁹⁵(96-digit number)
25271297961138956493…07310065881325322241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.054 × 10⁹⁵(96-digit number)
50542595922277912987…14620131762650644481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.010 × 10⁹⁶(97-digit number)
10108519184455582597…29240263525301288961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.021 × 10⁹⁶(97-digit number)
20217038368911165194…58480527050602577921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.043 × 10⁹⁶(97-digit number)
40434076737822330389…16961054101205155841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.086 × 10⁹⁶(97-digit number)
80868153475644660779…33922108202410311681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.617 × 10⁹⁷(98-digit number)
16173630695128932155…67844216404820623361
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,758,464 XPM·at block #6,814,299 · 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