Block #566,445

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/28/2014, 10:25:45 PM · Difficulty 10.9660 · 6,242,420 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
beaa4bcadeadc08c8cd71836a7feb4e8bc1dd12537d80bbdb815bcb0da6ba0d7

Height

#566,445

Difficulty

10.965997

Transactions

8

Size

1.89 KB

Version

2

Bits

0af74b94

Nonce

11,710,357

Timestamp

5/28/2014, 10:25:45 PM

Confirmations

6,242,420

Merkle Root

a541ba5b4afabae80134770261d301f64c8e1fd073a5c1eb8fd5053399be088e
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.741 × 10⁹⁷(98-digit number)
97412680108913453969…06642343041176076599
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.741 × 10⁹⁷(98-digit number)
97412680108913453969…06642343041176076599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.948 × 10⁹⁸(99-digit number)
19482536021782690793…13284686082352153199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.896 × 10⁹⁸(99-digit number)
38965072043565381587…26569372164704306399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.793 × 10⁹⁸(99-digit number)
77930144087130763175…53138744329408612799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.558 × 10⁹⁹(100-digit number)
15586028817426152635…06277488658817225599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.117 × 10⁹⁹(100-digit number)
31172057634852305270…12554977317634451199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.234 × 10⁹⁹(100-digit number)
62344115269704610540…25109954635268902399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.246 × 10¹⁰⁰(101-digit number)
12468823053940922108…50219909270537804799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.493 × 10¹⁰⁰(101-digit number)
24937646107881844216…00439818541075609599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.987 × 10¹⁰⁰(101-digit number)
49875292215763688432…00879637082151219199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.975 × 10¹⁰⁰(101-digit number)
99750584431527376864…01759274164302438399
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,714,969 XPM·at block #6,808,864 · 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