Block #472,016

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/2/2014, 11:52:43 PM · Difficulty 10.4352 · 6,337,661 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
099110af2da3e23dea89e14c0fe937a876a445832896f8d03cd4f0a7dac4af8a

Height

#472,016

Difficulty

10.435204

Transactions

5

Size

1.23 KB

Version

2

Bits

0a6f6983

Nonce

291,226

Timestamp

4/2/2014, 11:52:43 PM

Confirmations

6,337,661

Merkle Root

220d1ad796b5da2950c8ddaa8572eab64c05dd3bdc4c672bcb932ac0226fa575
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.069 × 10¹⁰²(103-digit number)
10691667470304347834…56925318964340685441
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.069 × 10¹⁰²(103-digit number)
10691667470304347834…56925318964340685441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.138 × 10¹⁰²(103-digit number)
21383334940608695668…13850637928681370881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.276 × 10¹⁰²(103-digit number)
42766669881217391337…27701275857362741761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.553 × 10¹⁰²(103-digit number)
85533339762434782674…55402551714725483521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.710 × 10¹⁰³(104-digit number)
17106667952486956534…10805103429450967041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.421 × 10¹⁰³(104-digit number)
34213335904973913069…21610206858901934081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.842 × 10¹⁰³(104-digit number)
68426671809947826139…43220413717803868161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.368 × 10¹⁰⁴(105-digit number)
13685334361989565227…86440827435607736321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.737 × 10¹⁰⁴(105-digit number)
27370668723979130455…72881654871215472641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.474 × 10¹⁰⁴(105-digit number)
54741337447958260911…45763309742430945281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.094 × 10¹⁰⁵(106-digit number)
10948267489591652182…91526619484861890561
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,721,492 XPM·at block #6,809,676 · 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