Block #412,328

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/20/2014, 10:53:36 AM · Difficulty 10.4188 · 6,402,814 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4cfb4cdad1a3128213e1a2ff8b6b4f980c1048b739b01fd3e93362412a314e33

Height

#412,328

Difficulty

10.418793

Transactions

2

Size

584 B

Version

2

Bits

0a6b3605

Nonce

692

Timestamp

2/20/2014, 10:53:36 AM

Confirmations

6,402,814

Merkle Root

43677c2eb1af9a92d557946e6241e3fd44cdc818aeefc52a83e241322dae1505
Transactions (2)
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.

3.650 × 10¹⁰⁰(101-digit number)
36508029982060049800…38429536196330520601
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
3.650 × 10¹⁰⁰(101-digit number)
36508029982060049800…38429536196330520601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.301 × 10¹⁰⁰(101-digit number)
73016059964120099600…76859072392661041201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.460 × 10¹⁰¹(102-digit number)
14603211992824019920…53718144785322082401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.920 × 10¹⁰¹(102-digit number)
29206423985648039840…07436289570644164801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.841 × 10¹⁰¹(102-digit number)
58412847971296079680…14872579141288329601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.168 × 10¹⁰²(103-digit number)
11682569594259215936…29745158282576659201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.336 × 10¹⁰²(103-digit number)
23365139188518431872…59490316565153318401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.673 × 10¹⁰²(103-digit number)
46730278377036863744…18980633130306636801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.346 × 10¹⁰²(103-digit number)
93460556754073727488…37961266260613273601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.869 × 10¹⁰³(104-digit number)
18692111350814745497…75922532521226547201
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,765,230 XPM·at block #6,815,141 · 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