Block #442,253

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/13/2014, 5:15:17 PM · Difficulty 10.3488 · 6,368,452 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c4b4d95ba47380b185f6ed5d0fb045ca8e0dff1527076e8a3a4dd87c812616c9

Height

#442,253

Difficulty

10.348794

Transactions

5

Size

2.12 KB

Version

2

Bits

0a594a8b

Nonce

644,460

Timestamp

3/13/2014, 5:15:17 PM

Confirmations

6,368,452

Merkle Root

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

6.607 × 10⁹⁵(96-digit number)
66079363558538042447…72520038298859981761
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
6.607 × 10⁹⁵(96-digit number)
66079363558538042447…72520038298859981761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.321 × 10⁹⁶(97-digit number)
13215872711707608489…45040076597719963521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.643 × 10⁹⁶(97-digit number)
26431745423415216978…90080153195439927041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.286 × 10⁹⁶(97-digit number)
52863490846830433957…80160306390879854081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.057 × 10⁹⁷(98-digit number)
10572698169366086791…60320612781759708161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.114 × 10⁹⁷(98-digit number)
21145396338732173583…20641225563519416321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.229 × 10⁹⁷(98-digit number)
42290792677464347166…41282451127038832641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.458 × 10⁹⁷(98-digit number)
84581585354928694332…82564902254077665281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.691 × 10⁹⁸(99-digit number)
16916317070985738866…65129804508155330561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.383 × 10⁹⁸(99-digit number)
33832634141971477733…30259609016310661121
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,729,734 XPM·at block #6,810,704 · 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