Block #401,830

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/13/2014, 1:22:19 AM · Difficulty 10.4317 · 6,414,376 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4b4ca97d3dbb044f9894d5f72d5765edecdc0bba38eafa3eaeb7d189cca7bc05

Height

#401,830

Difficulty

10.431718

Transactions

3

Size

622 B

Version

2

Bits

0a6e8510

Nonce

6,075

Timestamp

2/13/2014, 1:22:19 AM

Confirmations

6,414,376

Merkle Root

a588d75ba5a5a228b6f378f41f14857e156c79c0ef26025a1084354db32cb2d8
Transactions (3)
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.

4.761 × 10¹⁰³(104-digit number)
47613888504163932218…07684943188615116801
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
4.761 × 10¹⁰³(104-digit number)
47613888504163932218…07684943188615116801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.522 × 10¹⁰³(104-digit number)
95227777008327864437…15369886377230233601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.904 × 10¹⁰⁴(105-digit number)
19045555401665572887…30739772754460467201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.809 × 10¹⁰⁴(105-digit number)
38091110803331145775…61479545508920934401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.618 × 10¹⁰⁴(105-digit number)
76182221606662291550…22959091017841868801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.523 × 10¹⁰⁵(106-digit number)
15236444321332458310…45918182035683737601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.047 × 10¹⁰⁵(106-digit number)
30472888642664916620…91836364071367475201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.094 × 10¹⁰⁵(106-digit number)
60945777285329833240…83672728142734950401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.218 × 10¹⁰⁶(107-digit number)
12189155457065966648…67345456285469900801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.437 × 10¹⁰⁶(107-digit number)
24378310914131933296…34690912570939801601
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,773,775 XPM·at block #6,816,205 · 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