Block #423,570

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/28/2014, 12:59:48 PM · Difficulty 10.3755 · 6,394,312 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8470a462320b7973967445b7677dfecebfb17304afffea26ef4f6149f387a72e

Height

#423,570

Difficulty

10.375515

Transactions

5

Size

2.10 KB

Version

2

Bits

0a6021c4

Nonce

156,706

Timestamp

2/28/2014, 12:59:48 PM

Confirmations

6,394,312

Merkle Root

63b0398f117437df812a41f95db75abbecab0740e2bdbb9d7505ed8d37ee9291
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.

8.447 × 10⁹⁹(100-digit number)
84473949172877570315…47557943992957132801
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
8.447 × 10⁹⁹(100-digit number)
84473949172877570315…47557943992957132801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.689 × 10¹⁰⁰(101-digit number)
16894789834575514063…95115887985914265601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.378 × 10¹⁰⁰(101-digit number)
33789579669151028126…90231775971828531201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.757 × 10¹⁰⁰(101-digit number)
67579159338302056252…80463551943657062401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.351 × 10¹⁰¹(102-digit number)
13515831867660411250…60927103887314124801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.703 × 10¹⁰¹(102-digit number)
27031663735320822500…21854207774628249601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.406 × 10¹⁰¹(102-digit number)
54063327470641645001…43708415549256499201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.081 × 10¹⁰²(103-digit number)
10812665494128329000…87416831098512998401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.162 × 10¹⁰²(103-digit number)
21625330988256658000…74833662197025996801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.325 × 10¹⁰²(103-digit number)
43250661976513316001…49667324394051993601
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,787,116 XPM·at block #6,817,881 · 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