Block #2,955,198

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/6/2018, 11:36:57 PM · Difficulty 11.3962 · 3,889,948 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0d1933cd6b071cc5c780ecd30697d449a7de66aa482eacde0c797b0b0599c7c5

Height

#2,955,198

Difficulty

11.396185

Transactions

39

Size

10.58 KB

Version

2

Bits

0b656c69

Nonce

1,379,236,901

Timestamp

12/6/2018, 11:36:57 PM

Confirmations

3,889,948

Merkle Root

e5bde1c77d24535cd4b3ef78becb7ba3b9ea33e815a2f43a76fcf84c15379cf4
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.915 × 10⁹²(93-digit number)
89156564241761551118…35415807962868393559
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.915 × 10⁹²(93-digit number)
89156564241761551118…35415807962868393559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.783 × 10⁹³(94-digit number)
17831312848352310223…70831615925736787119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.566 × 10⁹³(94-digit number)
35662625696704620447…41663231851473574239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.132 × 10⁹³(94-digit number)
71325251393409240895…83326463702947148479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.426 × 10⁹⁴(95-digit number)
14265050278681848179…66652927405894296959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.853 × 10⁹⁴(95-digit number)
28530100557363696358…33305854811788593919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.706 × 10⁹⁴(95-digit number)
57060201114727392716…66611709623577187839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.141 × 10⁹⁵(96-digit number)
11412040222945478543…33223419247154375679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.282 × 10⁹⁵(96-digit number)
22824080445890957086…66446838494308751359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.564 × 10⁹⁵(96-digit number)
45648160891781914172…32893676988617502719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.129 × 10⁹⁵(96-digit number)
91296321783563828345…65787353977235005439
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:58,005,594 XPM·at block #6,845,145 · 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