Block #2,829,470

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/8/2018, 12:40:47 AM · Difficulty 11.7131 · 4,003,298 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
12d65ca6a8674073afedfdcfc18fbcc17a6255db0a36bbfac841b5a1b705a617

Height

#2,829,470

Difficulty

11.713066

Transactions

35

Size

8.98 KB

Version

2

Bits

0bb68b81

Nonce

1,052,307,858

Timestamp

9/8/2018, 12:40:47 AM

Confirmations

4,003,298

Merkle Root

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

7.783 × 10⁹⁴(95-digit number)
77833152545475108715…40273395236782704959
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
7.783 × 10⁹⁴(95-digit number)
77833152545475108715…40273395236782704959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.556 × 10⁹⁵(96-digit number)
15566630509095021743…80546790473565409919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.113 × 10⁹⁵(96-digit number)
31133261018190043486…61093580947130819839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.226 × 10⁹⁵(96-digit number)
62266522036380086972…22187161894261639679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.245 × 10⁹⁶(97-digit number)
12453304407276017394…44374323788523279359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.490 × 10⁹⁶(97-digit number)
24906608814552034789…88748647577046558719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.981 × 10⁹⁶(97-digit number)
49813217629104069578…77497295154093117439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.962 × 10⁹⁶(97-digit number)
99626435258208139156…54994590308186234879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.992 × 10⁹⁷(98-digit number)
19925287051641627831…09989180616372469759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.985 × 10⁹⁷(98-digit number)
39850574103283255662…19978361232744939519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.970 × 10⁹⁷(98-digit number)
79701148206566511325…39956722465489879039
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

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

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,906,308 XPM·at block #6,832,767 · 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