Block #415,485

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/22/2014, 5:27:38 PM · Difficulty 10.4067 · 6,392,696 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
299223094716d8fc5146273c2d1e6fb2e259c11703c9f889c55515cfd8eaacd1

Height

#415,485

Difficulty

10.406698

Transactions

7

Size

1.52 KB

Version

2

Bits

0a681d5f

Nonce

90

Timestamp

2/22/2014, 5:27:38 PM

Confirmations

6,392,696

Merkle Root

3f4f5582f9c69598d75f8a2fa62eb4bdb57c43e9f95b7d75c9408e7b48648cb0
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.

9.295 × 10⁹⁸(99-digit number)
92952421209435621975…00481347847243519999
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
9.295 × 10⁹⁸(99-digit number)
92952421209435621975…00481347847243519999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.859 × 10⁹⁹(100-digit number)
18590484241887124395…00962695694487039999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.718 × 10⁹⁹(100-digit number)
37180968483774248790…01925391388974079999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.436 × 10⁹⁹(100-digit number)
74361936967548497580…03850782777948159999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.487 × 10¹⁰⁰(101-digit number)
14872387393509699516…07701565555896319999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.974 × 10¹⁰⁰(101-digit number)
29744774787019399032…15403131111792639999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.948 × 10¹⁰⁰(101-digit number)
59489549574038798064…30806262223585279999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.189 × 10¹⁰¹(102-digit number)
11897909914807759612…61612524447170559999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.379 × 10¹⁰¹(102-digit number)
23795819829615519225…23225048894341119999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.759 × 10¹⁰¹(102-digit number)
47591639659231038451…46450097788682239999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.518 × 10¹⁰¹(102-digit number)
95183279318462076903…92900195577364479999
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,709,497 XPM·at block #6,808,180 · 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