Block #579,154

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/6/2014, 3:37:33 PM · Difficulty 10.9674 · 6,234,928 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9edd9d9061a7cfd27f93156cc22e93d6092bd4861f32bc1f05963e5ca81ac786

Height

#579,154

Difficulty

10.967436

Transactions

5

Size

44.30 KB

Version

2

Bits

0af7a9e4

Nonce

15,011,850

Timestamp

6/6/2014, 3:37:33 PM

Confirmations

6,234,928

Merkle Root

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

5.765 × 10⁹⁷(98-digit number)
57656629811294010610…28722673575712194399
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
5.765 × 10⁹⁷(98-digit number)
57656629811294010610…28722673575712194399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.153 × 10⁹⁸(99-digit number)
11531325962258802122…57445347151424388799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.306 × 10⁹⁸(99-digit number)
23062651924517604244…14890694302848777599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.612 × 10⁹⁸(99-digit number)
46125303849035208488…29781388605697555199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.225 × 10⁹⁸(99-digit number)
92250607698070416977…59562777211395110399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.845 × 10⁹⁹(100-digit number)
18450121539614083395…19125554422790220799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.690 × 10⁹⁹(100-digit number)
36900243079228166790…38251108845580441599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.380 × 10⁹⁹(100-digit number)
73800486158456333581…76502217691160883199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.476 × 10¹⁰⁰(101-digit number)
14760097231691266716…53004435382321766399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.952 × 10¹⁰⁰(101-digit number)
29520194463382533432…06008870764643532799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.904 × 10¹⁰⁰(101-digit number)
59040388926765066865…12017741529287065599
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,756,737 XPM·at block #6,814,081 · 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.
Privacy Policy·

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