Block #2,938,133

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/25/2018, 5:18:50 AM · Difficulty 11.3800 · 3,898,309 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
83b8d993cc6b62b57aaf6ee14d30543624aff07e2b41d72393882f49c8d28128

Height

#2,938,133

Difficulty

11.380040

Transactions

7

Size

1.86 KB

Version

2

Bits

0b614a52

Nonce

312,812,561

Timestamp

11/25/2018, 5:18:50 AM

Confirmations

3,898,309

Merkle Root

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

8.187 × 10⁹³(94-digit number)
81878802977014945818…85631571819125090879
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
8.187 × 10⁹³(94-digit number)
81878802977014945818…85631571819125090879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.637 × 10⁹⁴(95-digit number)
16375760595402989163…71263143638250181759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.275 × 10⁹⁴(95-digit number)
32751521190805978327…42526287276500363519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.550 × 10⁹⁴(95-digit number)
65503042381611956654…85052574553000727039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.310 × 10⁹⁵(96-digit number)
13100608476322391330…70105149106001454079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.620 × 10⁹⁵(96-digit number)
26201216952644782661…40210298212002908159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.240 × 10⁹⁵(96-digit number)
52402433905289565323…80420596424005816319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.048 × 10⁹⁶(97-digit number)
10480486781057913064…60841192848011632639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.096 × 10⁹⁶(97-digit number)
20960973562115826129…21682385696023265279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.192 × 10⁹⁶(97-digit number)
41921947124231652259…43364771392046530559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.384 × 10⁹⁶(97-digit number)
83843894248463304518…86729542784093061119
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,935,806 XPM·at block #6,836,441 · 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