Block #242,959

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/4/2013, 12:41:20 AM · Difficulty 9.9609 · 6,573,717 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1b15fb4c83dc631722d897a4cf03a09edb78484fce19fcb7f0078a3032f40836

Height

#242,959

Difficulty

9.960865

Transactions

6

Size

3.07 KB

Version

2

Bits

09f5fb3b

Nonce

27,961

Timestamp

11/4/2013, 12:41:20 AM

Confirmations

6,573,717

Merkle Root

43f1cdb7da1f2100b668625d195e061658c4fa73669fb6ce12b15d116ea52c62
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.881 × 10⁹⁷(98-digit number)
18819531450180561472…15239387847673701099
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.881 × 10⁹⁷(98-digit number)
18819531450180561472…15239387847673701099
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.763 × 10⁹⁷(98-digit number)
37639062900361122945…30478775695347402199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.527 × 10⁹⁷(98-digit number)
75278125800722245890…60957551390694804399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.505 × 10⁹⁸(99-digit number)
15055625160144449178…21915102781389608799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.011 × 10⁹⁸(99-digit number)
30111250320288898356…43830205562779217599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.022 × 10⁹⁸(99-digit number)
60222500640577796712…87660411125558435199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.204 × 10⁹⁹(100-digit number)
12044500128115559342…75320822251116870399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.408 × 10⁹⁹(100-digit number)
24089000256231118685…50641644502233740799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.817 × 10⁹⁹(100-digit number)
48178000512462237370…01283289004467481599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.635 × 10⁹⁹(100-digit number)
96356001024924474740…02566578008934963199
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,777,527 XPM·at block #6,816,675 · 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