Block #2,931,167

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/20/2018, 7:19:21 AM · Difficulty 11.3933 · 3,912,478 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3a1438d17fd74e67ea09714cbfc05e86d71af75517f2b775bce34cf55302db2d

Height

#2,931,167

Difficulty

11.393327

Transactions

2

Size

575 B

Version

2

Bits

0b64b10d

Nonce

72,227,131

Timestamp

11/20/2018, 7:19:21 AM

Confirmations

3,912,478

Merkle Root

41a9af971cc08dd64479cd9150de9e9c9ad734f5e5225a19e2b2275d88a042e3
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.640 × 10⁹⁵(96-digit number)
26401931147134947493…20725244870857727301
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.640 × 10⁹⁵(96-digit number)
26401931147134947493…20725244870857727301
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.280 × 10⁹⁵(96-digit number)
52803862294269894987…41450489741715454601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.056 × 10⁹⁶(97-digit number)
10560772458853978997…82900979483430909201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.112 × 10⁹⁶(97-digit number)
21121544917707957995…65801958966861818401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.224 × 10⁹⁶(97-digit number)
42243089835415915990…31603917933723636801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.448 × 10⁹⁶(97-digit number)
84486179670831831980…63207835867447273601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.689 × 10⁹⁷(98-digit number)
16897235934166366396…26415671734894547201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.379 × 10⁹⁷(98-digit number)
33794471868332732792…52831343469789094401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.758 × 10⁹⁷(98-digit number)
67588943736665465584…05662686939578188801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.351 × 10⁹⁸(99-digit number)
13517788747333093116…11325373879156377601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.703 × 10⁹⁸(99-digit number)
27035577494666186233…22650747758312755201
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,993,530 XPM·at block #6,843,644 · 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