Block #1,086,087

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/2/2015, 12:39:49 AM · Difficulty 10.7519 · 5,724,148 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e6a0ceac20a6d5ed6cbfec3f260e84a111a0733970c648b9616e4f1ffbd73432

Height

#1,086,087

Difficulty

10.751864

Transactions

1

Size

242 B

Version

2

Bits

0ac07a27

Nonce

819,900,762

Timestamp

6/2/2015, 12:39:49 AM

Confirmations

5,724,148

Mined by

Merkle Root

33e4e128ab798ccf77eb94ec34f77d8e859c60a3625f48c02ab8902390264a14
Transactions (1)
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.284 × 10⁹⁵(96-digit number)
32845511275542305643…08026243802246809599
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.284 × 10⁹⁵(96-digit number)
32845511275542305643…08026243802246809599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.569 × 10⁹⁵(96-digit number)
65691022551084611287…16052487604493619199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.313 × 10⁹⁶(97-digit number)
13138204510216922257…32104975208987238399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.627 × 10⁹⁶(97-digit number)
26276409020433844514…64209950417974476799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.255 × 10⁹⁶(97-digit number)
52552818040867689029…28419900835948953599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.051 × 10⁹⁷(98-digit number)
10510563608173537805…56839801671897907199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.102 × 10⁹⁷(98-digit number)
21021127216347075611…13679603343795814399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.204 × 10⁹⁷(98-digit number)
42042254432694151223…27359206687591628799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.408 × 10⁹⁷(98-digit number)
84084508865388302447…54718413375183257599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.681 × 10⁹⁸(99-digit number)
16816901773077660489…09436826750366515199
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,725,957 XPM·at block #6,810,234 · 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.

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