Block #571,624

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/1/2014, 2:30:07 PM · Difficulty 10.9654 · 6,238,186 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7adf961b6a8875b41c4d2839c35942a3c2c4747cf94031def3ed95f8b3695f78

Height

#571,624

Difficulty

10.965443

Transactions

2

Size

583 B

Version

2

Bits

0af7274a

Nonce

1,551,565,833

Timestamp

6/1/2014, 2:30:07 PM

Confirmations

6,238,186

Merkle Root

f82fbdb4c59e847700c18b9312fad40fee6ef9fafedad952406ac70165436e58
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.725 × 10⁹⁸(99-digit number)
57258862073467751064…58327996773810821119
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.725 × 10⁹⁸(99-digit number)
57258862073467751064…58327996773810821119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.145 × 10⁹⁹(100-digit number)
11451772414693550212…16655993547621642239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.290 × 10⁹⁹(100-digit number)
22903544829387100425…33311987095243284479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.580 × 10⁹⁹(100-digit number)
45807089658774200851…66623974190486568959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.161 × 10⁹⁹(100-digit number)
91614179317548401703…33247948380973137919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.832 × 10¹⁰⁰(101-digit number)
18322835863509680340…66495896761946275839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.664 × 10¹⁰⁰(101-digit number)
36645671727019360681…32991793523892551679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.329 × 10¹⁰⁰(101-digit number)
73291343454038721362…65983587047785103359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.465 × 10¹⁰¹(102-digit number)
14658268690807744272…31967174095570206719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.931 × 10¹⁰¹(102-digit number)
29316537381615488545…63934348191140413439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.863 × 10¹⁰¹(102-digit number)
58633074763230977090…27868696382280826879
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,722,563 XPM·at block #6,809,809 · 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