Block #418,470

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/24/2014, 10:00:06 PM · Difficulty 10.3886 · 6,423,085 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8aca81d95d2597840f84d78e42947d4fe57c2e8c762e2131347ec06f7796b8fb

Height

#418,470

Difficulty

10.388569

Transactions

1

Size

834 B

Version

2

Bits

0a63794a

Nonce

16,298

Timestamp

2/24/2014, 10:00:06 PM

Confirmations

6,423,085

Merkle Root

22b1cdc1c3fe8a6ee1f3304a460c08daab3c37b0a66a313f58afa551c8279cc3
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.890 × 10⁹⁶(97-digit number)
18901398261741290508…33654234331389030401
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.890 × 10⁹⁶(97-digit number)
18901398261741290508…33654234331389030401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.780 × 10⁹⁶(97-digit number)
37802796523482581016…67308468662778060801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.560 × 10⁹⁶(97-digit number)
75605593046965162032…34616937325556121601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.512 × 10⁹⁷(98-digit number)
15121118609393032406…69233874651112243201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.024 × 10⁹⁷(98-digit number)
30242237218786064812…38467749302224486401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.048 × 10⁹⁷(98-digit number)
60484474437572129625…76935498604448972801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.209 × 10⁹⁸(99-digit number)
12096894887514425925…53870997208897945601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.419 × 10⁹⁸(99-digit number)
24193789775028851850…07741994417795891201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.838 × 10⁹⁸(99-digit number)
48387579550057703700…15483988835591782401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.677 × 10⁹⁸(99-digit number)
96775159100115407400…30967977671183564801
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,976,825 XPM·at block #6,841,554 · 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