Block #88,178

1CCLength 9★☆☆☆☆

Cunningham Chain of the First Kind · Discovered 7/29/2013, 10:28:32 AM · Difficulty 9.2723 · 6,720,723 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c53463c7bb52a38b6e069b7eedba3dae427937adde8b46b6c17573deb4ad1368

Height

#88,178

Difficulty

9.272278

Transactions

6

Size

1.47 KB

Version

2

Bits

0945b403

Nonce

23,523

Timestamp

7/29/2013, 10:28:32 AM

Confirmations

6,720,723

Merkle Root

f3246a6180b08343ad7baaab5eb9bef3dba0f852f4e3f801f6adcfeadcd2479a
Transactions (6)
1 in → 1 out11.6600 XPM109 B
1 in → 1 out11.6800 XPM158 B
1 in → 1 out11.6300 XPM157 B
1 in → 1 out11.6200 XPM159 B
1 in → 1 out11.5900 XPM158 B
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.

2.203 × 10¹⁰⁷(108-digit number)
22038551637234707647…99024964865893236979
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
2.203 × 10¹⁰⁷(108-digit number)
22038551637234707647…99024964865893236979
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.407 × 10¹⁰⁷(108-digit number)
44077103274469415295…98049929731786473959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.815 × 10¹⁰⁷(108-digit number)
88154206548938830591…96099859463572947919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.763 × 10¹⁰⁸(109-digit number)
17630841309787766118…92199718927145895839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.526 × 10¹⁰⁸(109-digit number)
35261682619575532236…84399437854291791679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.052 × 10¹⁰⁸(109-digit number)
70523365239151064473…68798875708583583359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.410 × 10¹⁰⁹(110-digit number)
14104673047830212894…37597751417167166719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.820 × 10¹⁰⁹(110-digit number)
28209346095660425789…75195502834334333439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.641 × 10¹⁰⁹(110-digit number)
56418692191320851578…50391005668668666879
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 9 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
CommonChain length 9

Found in most blocks. The baseline for Primecoin's proof-of-work.

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,715,261 XPM·at block #6,808,900 · 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