Block #485,326

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/11/2014, 12:04:55 AM · Difficulty 10.6069 · 6,326,788 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
88bb6d7e677319b0aed1c221b7d5773ea53e07466ae43150095b8868421b6d39

Height

#485,326

Difficulty

10.606918

Transactions

9

Size

2.32 KB

Version

2

Bits

0a9b5ef7

Nonce

378,016,605

Timestamp

4/11/2014, 12:04:55 AM

Confirmations

6,326,788

Merkle Root

4ae7a9c3397774a5c5fb16ce26712e839ff8451a676bfe93fcc31eb83c50e294
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.994 × 10⁹⁷(98-digit number)
39943173733183957818…63393290812496706261
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.994 × 10⁹⁷(98-digit number)
39943173733183957818…63393290812496706261
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.988 × 10⁹⁷(98-digit number)
79886347466367915637…26786581624993412521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.597 × 10⁹⁸(99-digit number)
15977269493273583127…53573163249986825041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.195 × 10⁹⁸(99-digit number)
31954538986547166255…07146326499973650081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.390 × 10⁹⁸(99-digit number)
63909077973094332510…14292652999947300161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.278 × 10⁹⁹(100-digit number)
12781815594618866502…28585305999894600321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.556 × 10⁹⁹(100-digit number)
25563631189237733004…57170611999789200641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.112 × 10⁹⁹(100-digit number)
51127262378475466008…14341223999578401281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.022 × 10¹⁰⁰(101-digit number)
10225452475695093201…28682447999156802561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.045 × 10¹⁰⁰(101-digit number)
20450904951390186403…57364895998313605121
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,740,926 XPM·at block #6,812,113 · 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