Block #566,740

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/29/2014, 3:24:29 AM · Difficulty 10.9660 · 6,244,270 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fe64a4f8788020cdbeb8cb278bb71a045acbf0a02c265c7aefbcd12561b325a2

Height

#566,740

Difficulty

10.965975

Transactions

3

Size

659 B

Version

2

Bits

0af74a1f

Nonce

617,510,438

Timestamp

5/29/2014, 3:24:29 AM

Confirmations

6,244,270

Merkle Root

545aeec8817a0dc3050969e484b7146a7648ee132fdf41732a7d4d4880be6bf6
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.757 × 10⁹⁹(100-digit number)
17573519398021873152…65759678832559889919
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.757 × 10⁹⁹(100-digit number)
17573519398021873152…65759678832559889919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.514 × 10⁹⁹(100-digit number)
35147038796043746305…31519357665119779839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.029 × 10⁹⁹(100-digit number)
70294077592087492611…63038715330239559679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.405 × 10¹⁰⁰(101-digit number)
14058815518417498522…26077430660479119359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.811 × 10¹⁰⁰(101-digit number)
28117631036834997044…52154861320958238719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.623 × 10¹⁰⁰(101-digit number)
56235262073669994089…04309722641916477439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.124 × 10¹⁰¹(102-digit number)
11247052414733998817…08619445283832954879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.249 × 10¹⁰¹(102-digit number)
22494104829467997635…17238890567665909759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.498 × 10¹⁰¹(102-digit number)
44988209658935995271…34477781135331819519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.997 × 10¹⁰¹(102-digit number)
89976419317871990543…68955562270663639039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.799 × 10¹⁰²(103-digit number)
17995283863574398108…37911124541327278079
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,732,185 XPM·at block #6,811,009 · 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