Block #601,163

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/25/2014, 7:53:14 AM · Difficulty 10.9154 · 6,210,761 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1a4775607bca4e155e124a5d2d557c882e0ef3244e77a8c761adf75613d72100

Height

#601,163

Difficulty

10.915393

Transactions

6

Size

1.31 KB

Version

2

Bits

0aea5738

Nonce

46,779,691

Timestamp

6/25/2014, 7:53:14 AM

Confirmations

6,210,761

Merkle Root

6b6a5d6f466c67d99182b71dc832440227d7f228d1830674872ad17f1460e99e
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.

8.932 × 10⁹⁷(98-digit number)
89320971142990654319…55917115930229083679
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
8.932 × 10⁹⁷(98-digit number)
89320971142990654319…55917115930229083679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.786 × 10⁹⁸(99-digit number)
17864194228598130863…11834231860458167359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.572 × 10⁹⁸(99-digit number)
35728388457196261727…23668463720916334719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.145 × 10⁹⁸(99-digit number)
71456776914392523455…47336927441832669439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.429 × 10⁹⁹(100-digit number)
14291355382878504691…94673854883665338879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.858 × 10⁹⁹(100-digit number)
28582710765757009382…89347709767330677759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.716 × 10⁹⁹(100-digit number)
57165421531514018764…78695419534661355519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.143 × 10¹⁰⁰(101-digit number)
11433084306302803752…57390839069322711039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.286 × 10¹⁰⁰(101-digit number)
22866168612605607505…14781678138645422079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.573 × 10¹⁰⁰(101-digit number)
45732337225211215011…29563356277290844159
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,739,493 XPM·at block #6,811,923 · 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