Block #571,057

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/1/2014, 5:56:04 AM · Difficulty 10.9651 · 6,241,156 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9ecb719eb6ec640af2266fc148e93b7d26e11eb5faa231942c0ca41c07a0c38b

Height

#571,057

Difficulty

10.965058

Transactions

5

Size

2.10 KB

Version

2

Bits

0af70e05

Nonce

90,777,795

Timestamp

6/1/2014, 5:56:04 AM

Confirmations

6,241,156

Merkle Root

709d5a7dd58c8525f2e994a50d3b0ace688653a312b12ff4ecca8f8c676bac80
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.

1.198 × 10⁹⁸(99-digit number)
11981350742847260729…43691392592554071039
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
1.198 × 10⁹⁸(99-digit number)
11981350742847260729…43691392592554071039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.396 × 10⁹⁸(99-digit number)
23962701485694521458…87382785185108142079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.792 × 10⁹⁸(99-digit number)
47925402971389042916…74765570370216284159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.585 × 10⁹⁸(99-digit number)
95850805942778085833…49531140740432568319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.917 × 10⁹⁹(100-digit number)
19170161188555617166…99062281480865136639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.834 × 10⁹⁹(100-digit number)
38340322377111234333…98124562961730273279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.668 × 10⁹⁹(100-digit number)
76680644754222468666…96249125923460546559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.533 × 10¹⁰⁰(101-digit number)
15336128950844493733…92498251846921093119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.067 × 10¹⁰⁰(101-digit number)
30672257901688987466…84996503693842186239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.134 × 10¹⁰⁰(101-digit number)
61344515803377974933…69993007387684372479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.226 × 10¹⁰¹(102-digit number)
12268903160675594986…39986014775368744959
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,741,717 XPM·at block #6,812,212 · 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