Block #568,420

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/30/2014, 9:45:22 AM · Difficulty 10.9651 · 6,240,703 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
49a4b66cd40e0f314a4c60bd9afc46d1a3ca197fd6936e34caaa725b2497f30f

Height

#568,420

Difficulty

10.965066

Transactions

1

Size

597 B

Version

2

Bits

0af70e8e

Nonce

121,316

Timestamp

5/30/2014, 9:45:22 AM

Confirmations

6,240,703

Merkle Root

ad0d6f58785dc8d56dc4006427e886f76d8cb65c2979fd6a16a937d9b3a5abe9
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.

4.384 × 10¹⁰⁰(101-digit number)
43842934918021910796…37490025467329134479
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
4.384 × 10¹⁰⁰(101-digit number)
43842934918021910796…37490025467329134479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.768 × 10¹⁰⁰(101-digit number)
87685869836043821592…74980050934658268959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.753 × 10¹⁰¹(102-digit number)
17537173967208764318…49960101869316537919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.507 × 10¹⁰¹(102-digit number)
35074347934417528637…99920203738633075839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.014 × 10¹⁰¹(102-digit number)
70148695868835057274…99840407477266151679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.402 × 10¹⁰²(103-digit number)
14029739173767011454…99680814954532303359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.805 × 10¹⁰²(103-digit number)
28059478347534022909…99361629909064606719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.611 × 10¹⁰²(103-digit number)
56118956695068045819…98723259818129213439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.122 × 10¹⁰³(104-digit number)
11223791339013609163…97446519636258426879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.244 × 10¹⁰³(104-digit number)
22447582678027218327…94893039272516853759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.489 × 10¹⁰³(104-digit number)
44895165356054436655…89786078545033707519
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,717,042 XPM·at block #6,809,122 · 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