Block #413,066

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/20/2014, 11:27:17 PM · Difficulty 10.4170 · 6,394,930 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4ced3e5c3b96a1343c97d4eb6dd4dd204296396b61db3bd3c3b2fab3fb705616

Height

#413,066

Difficulty

10.416984

Transactions

5

Size

1.23 KB

Version

2

Bits

0a6abf7e

Nonce

108,411

Timestamp

2/20/2014, 11:27:17 PM

Confirmations

6,394,930

Merkle Root

49f756862a7b9553cb1ce80c3842b1f159d49091fabbd5521a0b65e6dc1a5f24
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.462 × 10⁹⁸(99-digit number)
14626839973130395341…65387763615727032321
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.462 × 10⁹⁸(99-digit number)
14626839973130395341…65387763615727032321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.925 × 10⁹⁸(99-digit number)
29253679946260790682…30775527231454064641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.850 × 10⁹⁸(99-digit number)
58507359892521581364…61551054462908129281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.170 × 10⁹⁹(100-digit number)
11701471978504316272…23102108925816258561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.340 × 10⁹⁹(100-digit number)
23402943957008632545…46204217851632517121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.680 × 10⁹⁹(100-digit number)
46805887914017265091…92408435703265034241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.361 × 10⁹⁹(100-digit number)
93611775828034530183…84816871406530068481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.872 × 10¹⁰⁰(101-digit number)
18722355165606906036…69633742813060136961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.744 × 10¹⁰⁰(101-digit number)
37444710331213812073…39267485626120273921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.488 × 10¹⁰⁰(101-digit number)
74889420662427624147…78534971252240547841
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,708,007 XPM·at block #6,807,995 · 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.

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