Block #2,237,757

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/5/2017, 7:46:06 AM · Difficulty 10.9461 · 4,579,026 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fd5b455c2cd12a20e24ffe0c04ea8a6ae05f12c57fccdff060a7c13825234019

Height

#2,237,757

Difficulty

10.946130

Transactions

4

Size

2.30 KB

Version

2

Bits

0af23599

Nonce

1,601,537,829

Timestamp

8/5/2017, 7:46:06 AM

Confirmations

4,579,026

Merkle Root

dc4f380d42772720a652e47b2c3133cdb422e789ea501356e37fb9419fd8fadb
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.

3.292 × 10⁹⁴(95-digit number)
32928443318630438572…67583171473499832359
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
3.292 × 10⁹⁴(95-digit number)
32928443318630438572…67583171473499832359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.585 × 10⁹⁴(95-digit number)
65856886637260877144…35166342946999664719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.317 × 10⁹⁵(96-digit number)
13171377327452175428…70332685893999329439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.634 × 10⁹⁵(96-digit number)
26342754654904350857…40665371787998658879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.268 × 10⁹⁵(96-digit number)
52685509309808701715…81330743575997317759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.053 × 10⁹⁶(97-digit number)
10537101861961740343…62661487151994635519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.107 × 10⁹⁶(97-digit number)
21074203723923480686…25322974303989271039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.214 × 10⁹⁶(97-digit number)
42148407447846961372…50645948607978542079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.429 × 10⁹⁶(97-digit number)
84296814895693922745…01291897215957084159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.685 × 10⁹⁷(98-digit number)
16859362979138784549…02583794431914168319
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,778,299 XPM·at block #6,816,782 · 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