Block #401,523

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/12/2014, 7:48:41 PM · Difficulty 10.4345 · 6,416,128 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e1e12e6f00f3bf8a2bd8807f8cedde3d1bdf41612687476ba037ac7f915b0071

Height

#401,523

Difficulty

10.434529

Transactions

4

Size

1.00 KB

Version

2

Bits

0a6f3d4b

Nonce

77,630

Timestamp

2/12/2014, 7:48:41 PM

Confirmations

6,416,128

Merkle Root

7ea2dc6bc6461a0cae1500a576addc403eb39c7ac731ed7220f673cd41b0c116
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.470 × 10⁹⁹(100-digit number)
14703117089936965437…32617824555457095681
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.470 × 10⁹⁹(100-digit number)
14703117089936965437…32617824555457095681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.940 × 10⁹⁹(100-digit number)
29406234179873930875…65235649110914191361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.881 × 10⁹⁹(100-digit number)
58812468359747861751…30471298221828382721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.176 × 10¹⁰⁰(101-digit number)
11762493671949572350…60942596443656765441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.352 × 10¹⁰⁰(101-digit number)
23524987343899144700…21885192887313530881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.704 × 10¹⁰⁰(101-digit number)
47049974687798289401…43770385774627061761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.409 × 10¹⁰⁰(101-digit number)
94099949375596578802…87540771549254123521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.881 × 10¹⁰¹(102-digit number)
18819989875119315760…75081543098508247041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.763 × 10¹⁰¹(102-digit number)
37639979750238631521…50163086197016494081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.527 × 10¹⁰¹(102-digit number)
75279959500477263042…00326172394032988161
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,785,260 XPM·at block #6,817,650 · 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