Block #422,393

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/27/2014, 4:48:35 PM · Difficulty 10.3793 · 6,384,661 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d3887a7e973514469abed4dc0ea6c1e1e5e6cd56973c7404fe3dd8f498c36580

Height

#422,393

Difficulty

10.379254

Transactions

1

Size

1004 B

Version

2

Bits

0a6116c3

Nonce

34,891

Timestamp

2/27/2014, 4:48:35 PM

Confirmations

6,384,661

Merkle Root

317feb52ea48f7d893e42d9470680ee0e6ccb21305d3d608c08611f7878fff7c
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.588 × 10⁹⁶(97-digit number)
25889169782255454471…78314921620930293541
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.588 × 10⁹⁶(97-digit number)
25889169782255454471…78314921620930293541
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.177 × 10⁹⁶(97-digit number)
51778339564510908943…56629843241860587081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.035 × 10⁹⁷(98-digit number)
10355667912902181788…13259686483721174161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.071 × 10⁹⁷(98-digit number)
20711335825804363577…26519372967442348321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.142 × 10⁹⁷(98-digit number)
41422671651608727154…53038745934884696641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.284 × 10⁹⁷(98-digit number)
82845343303217454309…06077491869769393281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.656 × 10⁹⁸(99-digit number)
16569068660643490861…12154983739538786561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.313 × 10⁹⁸(99-digit number)
33138137321286981723…24309967479077573121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.627 × 10⁹⁸(99-digit number)
66276274642573963447…48619934958155146241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.325 × 10⁹⁹(100-digit number)
13255254928514792689…97239869916310292481
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,700,528 XPM·at block #6,807,053 · 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