Block #399,158

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/11/2014, 6:28:21 AM · Difficulty 10.4194 · 6,427,748 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
abb59b666b103e75d45ce06c767c8bb58b2a73602e43308572d3fc2e6af38bfd

Height

#399,158

Difficulty

10.419434

Transactions

9

Size

2.55 KB

Version

2

Bits

0a6b6000

Nonce

78,416

Timestamp

2/11/2014, 6:28:21 AM

Confirmations

6,427,748

Merkle Root

50a90fe23013c87586453dc791886a68abcd63266f2325b1448c56489615f8b9
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.

2.148 × 10⁹⁹(100-digit number)
21485926980689669421…91891463504621845761
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
2.148 × 10⁹⁹(100-digit number)
21485926980689669421…91891463504621845761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.297 × 10⁹⁹(100-digit number)
42971853961379338843…83782927009243691521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.594 × 10⁹⁹(100-digit number)
85943707922758677687…67565854018487383041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.718 × 10¹⁰⁰(101-digit number)
17188741584551735537…35131708036974766081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.437 × 10¹⁰⁰(101-digit number)
34377483169103471074…70263416073949532161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.875 × 10¹⁰⁰(101-digit number)
68754966338206942149…40526832147899064321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.375 × 10¹⁰¹(102-digit number)
13750993267641388429…81053664295798128641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.750 × 10¹⁰¹(102-digit number)
27501986535282776859…62107328591596257281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.500 × 10¹⁰¹(102-digit number)
55003973070565553719…24214657183192514561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.100 × 10¹⁰²(103-digit number)
11000794614113110743…48429314366385029121
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,859,416 XPM·at block #6,826,905 · 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