Block #423,477

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/28/2014, 11:57:04 AM · Difficulty 10.3715 · 6,383,086 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d4c18e0c04af5c4fb8244b18749a6ab0ffa266566985416b2de7cea6da3d1542

Height

#423,477

Difficulty

10.371528

Transactions

3

Size

1.97 KB

Version

2

Bits

0a5f1c73

Nonce

20,564

Timestamp

2/28/2014, 11:57:04 AM

Confirmations

6,383,086

Merkle Root

0999e261bad9b826e6e94be4a81f5f37224b2e3254b3873dc224dd5ab161c917
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.062 × 10⁹⁷(98-digit number)
10626341944307948361…82485970683685130881
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.062 × 10⁹⁷(98-digit number)
10626341944307948361…82485970683685130881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.125 × 10⁹⁷(98-digit number)
21252683888615896723…64971941367370261761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.250 × 10⁹⁷(98-digit number)
42505367777231793446…29943882734740523521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.501 × 10⁹⁷(98-digit number)
85010735554463586892…59887765469481047041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.700 × 10⁹⁸(99-digit number)
17002147110892717378…19775530938962094081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.400 × 10⁹⁸(99-digit number)
34004294221785434757…39551061877924188161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.800 × 10⁹⁸(99-digit number)
68008588443570869514…79102123755848376321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.360 × 10⁹⁹(100-digit number)
13601717688714173902…58204247511696752641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.720 × 10⁹⁹(100-digit number)
27203435377428347805…16408495023393505281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.440 × 10⁹⁹(100-digit number)
54406870754856695611…32816990046787010561
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,600 XPM·at block #6,806,562 · 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