Block #480,307

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/8/2014, 5:42:11 AM · Difficulty 10.5151 · 6,336,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
c20fbd7e062a17f542ede366fed198b0adfc815fc7eb0cc21ef236eba442d6eb

Height

#480,307

Difficulty

10.515094

Transactions

2

Size

1016 B

Version

2

Bits

0a83dd30

Nonce

2,890,717,429

Timestamp

4/8/2014, 5:42:11 AM

Confirmations

6,336,930

Merkle Root

7671fcd88163ec8e95c97821a487004af80540c2ed53f6c1d0023e8ef61c0d20
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.

5.110 × 10⁹³(94-digit number)
51104123311718617704…57388508659789887241
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
5.110 × 10⁹³(94-digit number)
51104123311718617704…57388508659789887241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.022 × 10⁹⁴(95-digit number)
10220824662343723540…14777017319579774481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.044 × 10⁹⁴(95-digit number)
20441649324687447081…29554034639159548961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.088 × 10⁹⁴(95-digit number)
40883298649374894163…59108069278319097921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.176 × 10⁹⁴(95-digit number)
81766597298749788327…18216138556638195841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.635 × 10⁹⁵(96-digit number)
16353319459749957665…36432277113276391681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.270 × 10⁹⁵(96-digit number)
32706638919499915331…72864554226552783361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.541 × 10⁹⁵(96-digit number)
65413277838999830662…45729108453105566721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.308 × 10⁹⁶(97-digit number)
13082655567799966132…91458216906211133441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.616 × 10⁹⁶(97-digit number)
26165311135599932264…82916433812422266881
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,781,928 XPM·at block #6,817,236 · 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