Block #2,094,181

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/30/2017, 10:48:35 AM · Difficulty 10.8716 · 4,739,033 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6f7cac490be3addda49e32e3558a2cc57e4f9140e6a2be044b20a17985d845fa

Height

#2,094,181

Difficulty

10.871601

Transactions

3

Size

1.79 KB

Version

2

Bits

0adf2145

Nonce

267,593,645

Timestamp

4/30/2017, 10:48:35 AM

Confirmations

4,739,033

Merkle Root

3bf5cc8fcd2f4c8454ff32969d074ccb08a808326bf021ae3af3a9316979eaad
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.

3.598 × 10⁹⁴(95-digit number)
35980822018244492419…85019710197477626599
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.598 × 10⁹⁴(95-digit number)
35980822018244492419…85019710197477626599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.196 × 10⁹⁴(95-digit number)
71961644036488984838…70039420394955253199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.439 × 10⁹⁵(96-digit number)
14392328807297796967…40078840789910506399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.878 × 10⁹⁵(96-digit number)
28784657614595593935…80157681579821012799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.756 × 10⁹⁵(96-digit number)
57569315229191187870…60315363159642025599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.151 × 10⁹⁶(97-digit number)
11513863045838237574…20630726319284051199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.302 × 10⁹⁶(97-digit number)
23027726091676475148…41261452638568102399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.605 × 10⁹⁶(97-digit number)
46055452183352950296…82522905277136204799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.211 × 10⁹⁶(97-digit number)
92110904366705900593…65045810554272409599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.842 × 10⁹⁷(98-digit number)
18422180873341180118…30091621108544819199
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,909,898 XPM·at block #6,833,213 · 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