Block #179,709

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/25/2013, 7:16:55 AM · Difficulty 9.8627 · 6,637,232 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
916671efd5dd30874e281fdba325702161211c87f0c29b55ecaa81bbd9813339

Height

#179,709

Difficulty

9.862680

Transactions

2

Size

424 B

Version

2

Bits

09dcd8a1

Nonce

10,743

Timestamp

9/25/2013, 7:16:55 AM

Confirmations

6,637,232

Merkle Root

06a837330d1554eca483a043b5c635b669d1d84c9d508bd231421d9c0f2a329f
Transactions (2)
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.

7.593 × 10⁹¹(92-digit number)
75937264563340577368…89161851276565270079
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
7.593 × 10⁹¹(92-digit number)
75937264563340577368…89161851276565270079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.518 × 10⁹²(93-digit number)
15187452912668115473…78323702553130540159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.037 × 10⁹²(93-digit number)
30374905825336230947…56647405106261080319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.074 × 10⁹²(93-digit number)
60749811650672461894…13294810212522160639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.214 × 10⁹³(94-digit number)
12149962330134492378…26589620425044321279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.429 × 10⁹³(94-digit number)
24299924660268984757…53179240850088642559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.859 × 10⁹³(94-digit number)
48599849320537969515…06358481700177285119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.719 × 10⁹³(94-digit number)
97199698641075939031…12716963400354570239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.943 × 10⁹⁴(95-digit number)
19439939728215187806…25433926800709140479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.887 × 10⁹⁴(95-digit number)
38879879456430375612…50867853601418280959
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,779,570 XPM·at block #6,816,940 · 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