Block #397,355

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/10/2014, 1:17:33 AM · Difficulty 10.4125 · 6,413,359 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7286373e7877a390093536f543ab853654c00eddce3214da136a2fe4ebbd6b4b

Height

#397,355

Difficulty

10.412475

Transactions

2

Size

7.51 KB

Version

2

Bits

0a6997f7

Nonce

58,367

Timestamp

2/10/2014, 1:17:33 AM

Confirmations

6,413,359

Merkle Root

fd47faf1e679e4c550c40270212659293b52c985d48e455cbb5462608cd2a2ce
Transactions (2)
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.024 × 10¹⁰⁰(101-digit number)
10243208409313954426…18976918006018529281
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.024 × 10¹⁰⁰(101-digit number)
10243208409313954426…18976918006018529281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.048 × 10¹⁰⁰(101-digit number)
20486416818627908853…37953836012037058561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.097 × 10¹⁰⁰(101-digit number)
40972833637255817707…75907672024074117121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.194 × 10¹⁰⁰(101-digit number)
81945667274511635414…51815344048148234241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.638 × 10¹⁰¹(102-digit number)
16389133454902327082…03630688096296468481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.277 × 10¹⁰¹(102-digit number)
32778266909804654165…07261376192592936961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.555 × 10¹⁰¹(102-digit number)
65556533819609308331…14522752385185873921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.311 × 10¹⁰²(103-digit number)
13111306763921861666…29045504770371747841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.622 × 10¹⁰²(103-digit number)
26222613527843723332…58091009540743495681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.244 × 10¹⁰²(103-digit number)
52445227055687446665…16182019081486991361
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,729,799 XPM·at block #6,810,713 · 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