Block #2,908,787

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/3/2018, 7:20:21 PM · Difficulty 11.5379 · 3,924,187 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
555fa6de972d11a603ae4777e26a296e9bd38375ac440c2054b280c106828892

Height

#2,908,787

Difficulty

11.537932

Transactions

6

Size

1.79 KB

Version

2

Bits

0b89b5ee

Nonce

739,330,333

Timestamp

11/3/2018, 7:20:21 PM

Confirmations

3,924,187

Merkle Root

5d9eaeddd3a4a2c5ef7ca426bca90c3395444ad5d4ffd894fc9da88003174502
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.

1.392 × 10⁹²(93-digit number)
13924937257454483827…56500113627022988881
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
1.392 × 10⁹²(93-digit number)
13924937257454483827…56500113627022988881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.784 × 10⁹²(93-digit number)
27849874514908967655…13000227254045977761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.569 × 10⁹²(93-digit number)
55699749029817935311…26000454508091955521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.113 × 10⁹³(94-digit number)
11139949805963587062…52000909016183911041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.227 × 10⁹³(94-digit number)
22279899611927174124…04001818032367822081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.455 × 10⁹³(94-digit number)
44559799223854348249…08003636064735644161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.911 × 10⁹³(94-digit number)
89119598447708696498…16007272129471288321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.782 × 10⁹⁴(95-digit number)
17823919689541739299…32014544258942576641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.564 × 10⁹⁴(95-digit number)
35647839379083478599…64029088517885153281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.129 × 10⁹⁴(95-digit number)
71295678758166957198…28058177035770306561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.425 × 10⁹⁵(96-digit number)
14259135751633391439…56116354071540613121
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,907,970 XPM·at block #6,832,973 · 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