Block #1,180,711

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/2/2015, 4:59:47 PM · Difficulty 10.9244 · 5,646,370 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
46d54c4e071e8a61c8676407d2b0b741f6cf779c0dedf1cbd6406b619aba223c

Height

#1,180,711

Difficulty

10.924404

Transactions

6

Size

3.17 KB

Version

2

Bits

0aeca5bd

Nonce

167,666,242

Timestamp

8/2/2015, 4:59:47 PM

Confirmations

5,646,370

Merkle Root

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

5.602 × 10⁹⁴(95-digit number)
56023266850533540208…15740622094454690399
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
5.602 × 10⁹⁴(95-digit number)
56023266850533540208…15740622094454690399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.120 × 10⁹⁵(96-digit number)
11204653370106708041…31481244188909380799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.240 × 10⁹⁵(96-digit number)
22409306740213416083…62962488377818761599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.481 × 10⁹⁵(96-digit number)
44818613480426832166…25924976755637523199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.963 × 10⁹⁵(96-digit number)
89637226960853664333…51849953511275046399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.792 × 10⁹⁶(97-digit number)
17927445392170732866…03699907022550092799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.585 × 10⁹⁶(97-digit number)
35854890784341465733…07399814045100185599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.170 × 10⁹⁶(97-digit number)
71709781568682931467…14799628090200371199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.434 × 10⁹⁷(98-digit number)
14341956313736586293…29599256180400742399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.868 × 10⁹⁷(98-digit number)
28683912627473172586…59198512360801484799
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,860,833 XPM·at block #6,827,080 · 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