Block #430,904

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/5/2014, 7:37:38 PM · Difficulty 10.3460 · 6,385,345 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4956e0ec19dc3d00baac354804efb8faf43b48f19a25b7a2e0847cc41bad0095

Height

#430,904

Difficulty

10.346036

Transactions

3

Size

646 B

Version

2

Bits

0a5895d3

Nonce

40,108

Timestamp

3/5/2014, 7:37:38 PM

Confirmations

6,385,345

Merkle Root

bcc9d9701dd47287b1e97dcd23f5e44745405ba47aeefc68e72aae0c64b7c214
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.

7.034 × 10⁹⁷(98-digit number)
70344165445148742007…64546265432807792641
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
7.034 × 10⁹⁷(98-digit number)
70344165445148742007…64546265432807792641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.406 × 10⁹⁸(99-digit number)
14068833089029748401…29092530865615585281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.813 × 10⁹⁸(99-digit number)
28137666178059496802…58185061731231170561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.627 × 10⁹⁸(99-digit number)
56275332356118993605…16370123462462341121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.125 × 10⁹⁹(100-digit number)
11255066471223798721…32740246924924682241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.251 × 10⁹⁹(100-digit number)
22510132942447597442…65480493849849364481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.502 × 10⁹⁹(100-digit number)
45020265884895194884…30960987699698728961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.004 × 10⁹⁹(100-digit number)
90040531769790389769…61921975399397457921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.800 × 10¹⁰⁰(101-digit number)
18008106353958077953…23843950798794915841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.601 × 10¹⁰⁰(101-digit number)
36016212707916155907…47687901597589831681
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,774,111 XPM·at block #6,816,248 · 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