Block #559,810

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/24/2014, 10:36:18 AM · Difficulty 10.9647 · 6,252,561 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5d0fc8c8afe733a19c4ae688d8251d2ff86529522220ccc75cef04e20c51dfad

Height

#559,810

Difficulty

10.964654

Transactions

10

Size

2.58 KB

Version

2

Bits

0af6f38a

Nonce

430,166,121

Timestamp

5/24/2014, 10:36:18 AM

Confirmations

6,252,561

Merkle Root

7feb8305508e8504b62f07666b1ec04c3f5f145c7216b4b4ddb0172121fdfa88
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.115 × 10⁹⁹(100-digit number)
11151157865817320716…60945328615712295679
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.115 × 10⁹⁹(100-digit number)
11151157865817320716…60945328615712295679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.230 × 10⁹⁹(100-digit number)
22302315731634641433…21890657231424591359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.460 × 10⁹⁹(100-digit number)
44604631463269282866…43781314462849182719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.920 × 10⁹⁹(100-digit number)
89209262926538565732…87562628925698365439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.784 × 10¹⁰⁰(101-digit number)
17841852585307713146…75125257851396730879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.568 × 10¹⁰⁰(101-digit number)
35683705170615426292…50250515702793461759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.136 × 10¹⁰⁰(101-digit number)
71367410341230852585…00501031405586923519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.427 × 10¹⁰¹(102-digit number)
14273482068246170517…01002062811173847039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.854 × 10¹⁰¹(102-digit number)
28546964136492341034…02004125622347694079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.709 × 10¹⁰¹(102-digit number)
57093928272984682068…04008251244695388159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.141 × 10¹⁰²(103-digit number)
11418785654596936413…08016502489390776319
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,742,989 XPM·at block #6,812,370 · 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