Block #1,186,179

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/7/2015, 10:36:01 PM · Difficulty 10.8862 · 5,640,256 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
559250738191b441aa9fef0aa18f3d34db54a38f39e2abb5ebbc8d19e4de72a1

Height

#1,186,179

Difficulty

10.886245

Transactions

2

Size

4.32 KB

Version

2

Bits

0ae2e0f2

Nonce

404,325,341

Timestamp

8/7/2015, 10:36:01 PM

Confirmations

5,640,256

Merkle Root

df21ae7eaad054113b7e0bd565408ee26623270096b43e4b738229b9b10774b8
Transactions (2)
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.

4.121 × 10⁹³(94-digit number)
41214320910850586267…25561730163783942599
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
4.121 × 10⁹³(94-digit number)
41214320910850586267…25561730163783942599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.242 × 10⁹³(94-digit number)
82428641821701172534…51123460327567885199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.648 × 10⁹⁴(95-digit number)
16485728364340234506…02246920655135770399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.297 × 10⁹⁴(95-digit number)
32971456728680469013…04493841310271540799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.594 × 10⁹⁴(95-digit number)
65942913457360938027…08987682620543081599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.318 × 10⁹⁵(96-digit number)
13188582691472187605…17975365241086163199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.637 × 10⁹⁵(96-digit number)
26377165382944375211…35950730482172326399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.275 × 10⁹⁵(96-digit number)
52754330765888750422…71901460964344652799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.055 × 10⁹⁶(97-digit number)
10550866153177750084…43802921928689305599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.110 × 10⁹⁶(97-digit number)
21101732306355500168…87605843857378611199
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,855,617 XPM·at block #6,826,434 · 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