Block #420,140

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/26/2014, 4:55:53 AM · Difficulty 10.3661 · 6,396,535 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8f82a6131ef821a3a718d50355839ad805b452b7f0983bb1672e645f1c9998ef

Height

#420,140

Difficulty

10.366135

Transactions

4

Size

2.62 KB

Version

2

Bits

0a5dbb04

Nonce

67,358

Timestamp

2/26/2014, 4:55:53 AM

Confirmations

6,396,535

Merkle Root

b8d1dcbbd075eae2c6360429d77da6ece9fd9a61e594f67b4a51c441f580074b
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.273 × 10⁹⁵(96-digit number)
12731215002990003158…56650575064717106561
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.273 × 10⁹⁵(96-digit number)
12731215002990003158…56650575064717106561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.546 × 10⁹⁵(96-digit number)
25462430005980006317…13301150129434213121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.092 × 10⁹⁵(96-digit number)
50924860011960012635…26602300258868426241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.018 × 10⁹⁶(97-digit number)
10184972002392002527…53204600517736852481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.036 × 10⁹⁶(97-digit number)
20369944004784005054…06409201035473704961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.073 × 10⁹⁶(97-digit number)
40739888009568010108…12818402070947409921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.147 × 10⁹⁶(97-digit number)
81479776019136020216…25636804141894819841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.629 × 10⁹⁷(98-digit number)
16295955203827204043…51273608283789639681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.259 × 10⁹⁷(98-digit number)
32591910407654408086…02547216567579279361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.518 × 10⁹⁷(98-digit number)
65183820815308816173…05094433135158558721
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,777,519 XPM·at block #6,816,674 · 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