Block #1,139,334

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/4/2015, 8:04:02 AM · Difficulty 10.9357 · 5,685,164 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
be3b446ef68d0d82d50c4038bdea442ba2eb9ef2b8e5f84cc10dec72a30d89f3

Height

#1,139,334

Difficulty

10.935687

Transactions

3

Size

47.19 KB

Version

2

Bits

0aef892a

Nonce

66,992,111

Timestamp

7/4/2015, 8:04:02 AM

Confirmations

5,685,164

Merkle Root

127a650adeed08b98137517d558bc6ecdc327b2334b57d7b22ce6c34904c9449
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.280 × 10⁹⁶(97-digit number)
12800733753172310565…36377117817240582399
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.280 × 10⁹⁶(97-digit number)
12800733753172310565…36377117817240582399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.560 × 10⁹⁶(97-digit number)
25601467506344621131…72754235634481164799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.120 × 10⁹⁶(97-digit number)
51202935012689242262…45508471268962329599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.024 × 10⁹⁷(98-digit number)
10240587002537848452…91016942537924659199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.048 × 10⁹⁷(98-digit number)
20481174005075696904…82033885075849318399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.096 × 10⁹⁷(98-digit number)
40962348010151393809…64067770151698636799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.192 × 10⁹⁷(98-digit number)
81924696020302787619…28135540303397273599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.638 × 10⁹⁸(99-digit number)
16384939204060557523…56271080606794547199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.276 × 10⁹⁸(99-digit number)
32769878408121115047…12542161213589094399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.553 × 10⁹⁸(99-digit number)
65539756816242230095…25084322427178188799
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,840,057 XPM·at block #6,824,497 · 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