Block #398,969

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/11/2014, 3:20:03 AM · Difficulty 10.4193 · 6,407,576 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a4598625afc9f3fc230578091ef61355d8be811bde451c9b1857dbadcc32f6cd

Height

#398,969

Difficulty

10.419270

Transactions

2

Size

1.35 KB

Version

2

Bits

0a6b554c

Nonce

1,678

Timestamp

2/11/2014, 3:20:03 AM

Confirmations

6,407,576

Merkle Root

7407e1ad212d099ceaa9498515f0d38ccaa7477ebd18601819952a9c9472de24
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.955 × 10⁹⁷(98-digit number)
19559745137490499660…79562071116390563841
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.955 × 10⁹⁷(98-digit number)
19559745137490499660…79562071116390563841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.911 × 10⁹⁷(98-digit number)
39119490274980999320…59124142232781127681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.823 × 10⁹⁷(98-digit number)
78238980549961998641…18248284465562255361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.564 × 10⁹⁸(99-digit number)
15647796109992399728…36496568931124510721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.129 × 10⁹⁸(99-digit number)
31295592219984799456…72993137862249021441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.259 × 10⁹⁸(99-digit number)
62591184439969598913…45986275724498042881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.251 × 10⁹⁹(100-digit number)
12518236887993919782…91972551448996085761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.503 × 10⁹⁹(100-digit number)
25036473775987839565…83945102897992171521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.007 × 10⁹⁹(100-digit number)
50072947551975679130…67890205795984343041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.001 × 10¹⁰⁰(101-digit number)
10014589510395135826…35780411591968686081
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,696,461 XPM·at block #6,806,544 · 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