Block #575,905

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/4/2014, 6:21:01 AM · Difficulty 10.9685 · 6,232,178 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
53bd415a73285b469da6a4b273308d3eca9dd71f7dcd7e91cb33c3c4228ff750

Height

#575,905

Difficulty

10.968523

Transactions

6

Size

1.74 KB

Version

2

Bits

0af7f118

Nonce

1,345,505,706

Timestamp

6/4/2014, 6:21:01 AM

Confirmations

6,232,178

Merkle Root

f52e6d48fe0ea97158cfb71b2732c57f92cf94984b45e578e24a3354ae74a07e
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.383 × 10¹⁰⁰(101-digit number)
13834381374885733856…86169534011978137599
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.383 × 10¹⁰⁰(101-digit number)
13834381374885733856…86169534011978137599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.766 × 10¹⁰⁰(101-digit number)
27668762749771467713…72339068023956275199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.533 × 10¹⁰⁰(101-digit number)
55337525499542935426…44678136047912550399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.106 × 10¹⁰¹(102-digit number)
11067505099908587085…89356272095825100799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.213 × 10¹⁰¹(102-digit number)
22135010199817174170…78712544191650201599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.427 × 10¹⁰¹(102-digit number)
44270020399634348341…57425088383300403199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.854 × 10¹⁰¹(102-digit number)
88540040799268696682…14850176766600806399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.770 × 10¹⁰²(103-digit number)
17708008159853739336…29700353533201612799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.541 × 10¹⁰²(103-digit number)
35416016319707478673…59400707066403225599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.083 × 10¹⁰²(103-digit number)
70832032639414957346…18801414132806451199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.416 × 10¹⁰³(104-digit number)
14166406527882991469…37602828265612902399
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,708,711 XPM·at block #6,808,082 · 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