Block #289,170

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/2/2013, 2:07:52 AM · Difficulty 9.9883 · 6,518,047 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
01732d8888fe93f91e7c100d63b08e3b0a76cd05b9a1dfa0b0cdeb8a85fa2c7e

Height

#289,170

Difficulty

9.988315

Transactions

4

Size

3.63 KB

Version

2

Bits

09fd0231

Nonce

910

Timestamp

12/2/2013, 2:07:52 AM

Confirmations

6,518,047

Merkle Root

ffd549f88324a466fd3287185f67a5e49535e8994534f0b9d4e0edeb63a22a31
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.112 × 10¹⁰⁴(105-digit number)
71120472506479846257…52015369046597711359
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.112 × 10¹⁰⁴(105-digit number)
71120472506479846257…52015369046597711359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.422 × 10¹⁰⁵(106-digit number)
14224094501295969251…04030738093195422719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.844 × 10¹⁰⁵(106-digit number)
28448189002591938502…08061476186390845439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.689 × 10¹⁰⁵(106-digit number)
56896378005183877005…16122952372781690879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.137 × 10¹⁰⁶(107-digit number)
11379275601036775401…32245904745563381759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.275 × 10¹⁰⁶(107-digit number)
22758551202073550802…64491809491126763519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.551 × 10¹⁰⁶(107-digit number)
45517102404147101604…28983618982253527039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.103 × 10¹⁰⁶(107-digit number)
91034204808294203209…57967237964507054079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.820 × 10¹⁰⁷(108-digit number)
18206840961658840641…15934475929014108159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.641 × 10¹⁰⁷(108-digit number)
36413681923317681283…31868951858028216319
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,701,753 XPM·at block #6,807,216 · 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