Block #2,931,522

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/20/2018, 12:34:44 PM · Difficulty 11.3983 · 3,900,202 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9c4a0d1df432d18ed4e1db83123bcad8f1f20cad0617ca3009c2c1893e581fee

Height

#2,931,522

Difficulty

11.398341

Transactions

2

Size

5.19 KB

Version

2

Bits

0b65f9ac

Nonce

1,147,082,735

Timestamp

11/20/2018, 12:34:44 PM

Confirmations

3,900,202

Merkle Root

ff7643b5e419656a9bce538d7fe0ba58a7afcd383bdf06169e0bfa11d3919c32
Transactions (2)
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.

2.032 × 10⁹⁵(96-digit number)
20327888828480403518…26709663996378446401
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
2.032 × 10⁹⁵(96-digit number)
20327888828480403518…26709663996378446401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.065 × 10⁹⁵(96-digit number)
40655777656960807037…53419327992756892801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.131 × 10⁹⁵(96-digit number)
81311555313921614075…06838655985513785601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.626 × 10⁹⁶(97-digit number)
16262311062784322815…13677311971027571201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.252 × 10⁹⁶(97-digit number)
32524622125568645630…27354623942055142401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.504 × 10⁹⁶(97-digit number)
65049244251137291260…54709247884110284801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.300 × 10⁹⁷(98-digit number)
13009848850227458252…09418495768220569601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.601 × 10⁹⁷(98-digit number)
26019697700454916504…18836991536441139201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.203 × 10⁹⁷(98-digit number)
52039395400909833008…37673983072882278401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.040 × 10⁹⁸(99-digit number)
10407879080181966601…75347966145764556801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.081 × 10⁹⁸(99-digit number)
20815758160363933203…50695932291529113601
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,897,897 XPM·at block #6,831,723 · 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