Block #387,248

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/3/2014, 12:08:34 AM · Difficulty 10.4143 · 6,425,773 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3e8dff441161591917f64770e6c2cb35e8e2ab1e31e4df93adda6731a3ea2bc0

Height

#387,248

Difficulty

10.414346

Transactions

6

Size

1.83 KB

Version

2

Bits

0a6a1294

Nonce

1,318,119

Timestamp

2/3/2014, 12:08:34 AM

Confirmations

6,425,773

Merkle Root

2a4b2908fffb73442d2b81f267a16bf3d7abafd345f101f3da4498138f15f70d
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.

6.864 × 10¹⁰¹(102-digit number)
68640609673261865876…36935614941917024001
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
6.864 × 10¹⁰¹(102-digit number)
68640609673261865876…36935614941917024001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.372 × 10¹⁰²(103-digit number)
13728121934652373175…73871229883834048001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.745 × 10¹⁰²(103-digit number)
27456243869304746350…47742459767668096001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.491 × 10¹⁰²(103-digit number)
54912487738609492701…95484919535336192001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.098 × 10¹⁰³(104-digit number)
10982497547721898540…90969839070672384001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.196 × 10¹⁰³(104-digit number)
21964995095443797080…81939678141344768001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.392 × 10¹⁰³(104-digit number)
43929990190887594161…63879356282689536001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.785 × 10¹⁰³(104-digit number)
87859980381775188322…27758712565379072001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.757 × 10¹⁰⁴(105-digit number)
17571996076355037664…55517425130758144001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.514 × 10¹⁰⁴(105-digit number)
35143992152710075328…11034850261516288001
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,748,209 XPM·at block #6,813,020 · 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