Block #2,832,662

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/10/2018, 4:40:36 AM · Difficulty 11.7171 · 4,009,414 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
78eac965fda57f352ed1ca56a0cc4dbaab18a9abf7ab47a61ecfc250ee2bd435

Height

#2,832,662

Difficulty

11.717111

Transactions

6

Size

2.39 KB

Version

2

Bits

0bb79497

Nonce

182,328,049

Timestamp

9/10/2018, 4:40:36 AM

Confirmations

4,009,414

Merkle Root

75551963f71b01bdbc36ba5da17fcb27b73abbfc29ad2ed501acd8e9967da17e
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.

4.529 × 10⁹⁶(97-digit number)
45293625946163665788…23308361776522888959
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
4.529 × 10⁹⁶(97-digit number)
45293625946163665788…23308361776522888959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.058 × 10⁹⁶(97-digit number)
90587251892327331576…46616723553045777919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.811 × 10⁹⁷(98-digit number)
18117450378465466315…93233447106091555839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.623 × 10⁹⁷(98-digit number)
36234900756930932630…86466894212183111679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.246 × 10⁹⁷(98-digit number)
72469801513861865260…72933788424366223359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.449 × 10⁹⁸(99-digit number)
14493960302772373052…45867576848732446719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.898 × 10⁹⁸(99-digit number)
28987920605544746104…91735153697464893439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.797 × 10⁹⁸(99-digit number)
57975841211089492208…83470307394929786879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.159 × 10⁹⁹(100-digit number)
11595168242217898441…66940614789859573759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.319 × 10⁹⁹(100-digit number)
23190336484435796883…33881229579719147519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.638 × 10⁹⁹(100-digit number)
46380672968871593766…67762459159438295039
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,980,993 XPM·at block #6,842,075 · 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