Block #2,238,048

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/5/2017, 12:38:01 PM · Difficulty 10.9461 · 4,604,796 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
299674f74f5b46dbd07c736c1396b08033c595a2f48291ead0194312e9dd35b3

Height

#2,238,048

Difficulty

10.946142

Transactions

3

Size

2.37 KB

Version

2

Bits

0af23659

Nonce

261,951,598

Timestamp

8/5/2017, 12:38:01 PM

Confirmations

4,604,796

Merkle Root

3f07cbd845b2e12f91eb29fe6c13337ebecec9bf0d8b506f5894e8ae14d3d8ef
Transactions (3)
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.151 × 10⁹⁷(98-digit number)
11516682639588325211…70193451198169087999
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.151 × 10⁹⁷(98-digit number)
11516682639588325211…70193451198169087999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.303 × 10⁹⁷(98-digit number)
23033365279176650423…40386902396338175999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.606 × 10⁹⁷(98-digit number)
46066730558353300847…80773804792676351999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.213 × 10⁹⁷(98-digit number)
92133461116706601694…61547609585352703999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.842 × 10⁹⁸(99-digit number)
18426692223341320338…23095219170705407999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.685 × 10⁹⁸(99-digit number)
36853384446682640677…46190438341410815999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.370 × 10⁹⁸(99-digit number)
73706768893365281355…92380876682821631999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.474 × 10⁹⁹(100-digit number)
14741353778673056271…84761753365643263999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.948 × 10⁹⁹(100-digit number)
29482707557346112542…69523506731286527999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.896 × 10⁹⁹(100-digit number)
58965415114692225084…39047013462573055999
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,987,097 XPM·at block #6,842,843 · 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