Block #1,105,898

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/15/2015, 5:33:26 AM · Difficulty 10.7887 · 5,709,152 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0644109b93acea974f4425f791a4b0ec48ac9283af9e700cc268f4f180043cc9

Height

#1,105,898

Difficulty

10.788700

Transactions

2

Size

55.03 KB

Version

2

Bits

0ac9e836

Nonce

14,106,650

Timestamp

6/15/2015, 5:33:26 AM

Confirmations

5,709,152

Merkle Root

ed46a69742582d186cf9b6fd260cfcf13dc7faee98de15c4a18b1792f4888f12
Transactions (2)
1 in → 1 out9.1800 XPM116 B
379 in → 1 out5000.9990 XPM54.82 KB
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.974 × 10⁹⁷(98-digit number)
19740968719795984098…37102419105375395839
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.974 × 10⁹⁷(98-digit number)
19740968719795984098…37102419105375395839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.948 × 10⁹⁷(98-digit number)
39481937439591968196…74204838210750791679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.896 × 10⁹⁷(98-digit number)
78963874879183936393…48409676421501583359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.579 × 10⁹⁸(99-digit number)
15792774975836787278…96819352843003166719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.158 × 10⁹⁸(99-digit number)
31585549951673574557…93638705686006333439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.317 × 10⁹⁸(99-digit number)
63171099903347149115…87277411372012666879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.263 × 10⁹⁹(100-digit number)
12634219980669429823…74554822744025333759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.526 × 10⁹⁹(100-digit number)
25268439961338859646…49109645488050667519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.053 × 10⁹⁹(100-digit number)
50536879922677719292…98219290976101335039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.010 × 10¹⁰⁰(101-digit number)
10107375984535543858…96438581952202670079
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,764,491 XPM·at block #6,815,049 · 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