Block #3,141,967

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/16/2019, 2:27:00 PM · Difficulty 11.3159 · 3,700,526 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
40ee42cee561f4084257f64f7e6e21f0760042cd9468fe1fd452e2899258e689

Height

#3,141,967

Difficulty

11.315922

Transactions

3

Size

653 B

Version

2

Bits

0b50e043

Nonce

412,530,827

Timestamp

4/16/2019, 2:27:00 PM

Confirmations

3,700,526

Merkle Root

09db4955a06155a539de028c0c4b1829f0e49c0242e7ee9d55186853719196a2
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.

5.388 × 10⁹⁴(95-digit number)
53880536419544393545…36904457439193865669
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
5.388 × 10⁹⁴(95-digit number)
53880536419544393545…36904457439193865669
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.077 × 10⁹⁵(96-digit number)
10776107283908878709…73808914878387731339
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.155 × 10⁹⁵(96-digit number)
21552214567817757418…47617829756775462679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.310 × 10⁹⁵(96-digit number)
43104429135635514836…95235659513550925359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.620 × 10⁹⁵(96-digit number)
86208858271271029672…90471319027101850719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.724 × 10⁹⁶(97-digit number)
17241771654254205934…80942638054203701439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.448 × 10⁹⁶(97-digit number)
34483543308508411868…61885276108407402879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.896 × 10⁹⁶(97-digit number)
68967086617016823737…23770552216814805759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.379 × 10⁹⁷(98-digit number)
13793417323403364747…47541104433629611519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.758 × 10⁹⁷(98-digit number)
27586834646806729495…95082208867259223039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.517 × 10⁹⁷(98-digit number)
55173669293613458990…90164417734518446079
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,984,362 XPM·at block #6,842,492 · 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