Block #1,729,172

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/22/2016, 2:10:22 PM · Difficulty 10.7103 · 5,111,856 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8adb76d05de2265aff24ca97ab6037cdbd83461f795050016c4f5b5f887c3c66

Height

#1,729,172

Difficulty

10.710301

Transactions

2

Size

1.14 KB

Version

2

Bits

0ab5d643

Nonce

146,147,117

Timestamp

8/22/2016, 2:10:22 PM

Confirmations

5,111,856

Merkle Root

6a1161ec62f1f03438a6b72d316a504247bdc312ca32ce385be253d7d21a0074
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.

1.188 × 10⁹⁷(98-digit number)
11884079689564118502…72216217881401425919
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.188 × 10⁹⁷(98-digit number)
11884079689564118502…72216217881401425919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.376 × 10⁹⁷(98-digit number)
23768159379128237005…44432435762802851839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.753 × 10⁹⁷(98-digit number)
47536318758256474011…88864871525605703679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.507 × 10⁹⁷(98-digit number)
95072637516512948022…77729743051211407359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.901 × 10⁹⁸(99-digit number)
19014527503302589604…55459486102422814719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.802 × 10⁹⁸(99-digit number)
38029055006605179209…10918972204845629439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.605 × 10⁹⁸(99-digit number)
76058110013210358418…21837944409691258879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.521 × 10⁹⁹(100-digit number)
15211622002642071683…43675888819382517759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.042 × 10⁹⁹(100-digit number)
30423244005284143367…87351777638765035519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.084 × 10⁹⁹(100-digit number)
60846488010568286734…74703555277530071039
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,972,582 XPM·at block #6,841,027 · 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