Block #2,571,935

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/18/2018, 7:20:12 AM · Difficulty 10.9948 · 4,271,896 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9a4b74cb9e2c0baa319f7047def1f989183182024811f928fa45071047196af6

Height

#2,571,935

Difficulty

10.994793

Transactions

5

Size

2.32 KB

Version

2

Bits

0afeaab9

Nonce

978,004,617

Timestamp

3/18/2018, 7:20:12 AM

Confirmations

4,271,896

Merkle Root

86f9e9629e9051d2cdd2e7bd761cd6fa755f0a8c46a80681be9ba783e989871b
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.

4.024 × 10⁹⁷(98-digit number)
40245293529810085744…63538725715049267201
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
4.024 × 10⁹⁷(98-digit number)
40245293529810085744…63538725715049267201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.049 × 10⁹⁷(98-digit number)
80490587059620171489…27077451430098534401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.609 × 10⁹⁸(99-digit number)
16098117411924034297…54154902860197068801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.219 × 10⁹⁸(99-digit number)
32196234823848068595…08309805720394137601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.439 × 10⁹⁸(99-digit number)
64392469647696137191…16619611440788275201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.287 × 10⁹⁹(100-digit number)
12878493929539227438…33239222881576550401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.575 × 10⁹⁹(100-digit number)
25756987859078454876…66478445763153100801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.151 × 10⁹⁹(100-digit number)
51513975718156909753…32956891526306201601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.030 × 10¹⁰⁰(101-digit number)
10302795143631381950…65913783052612403201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.060 × 10¹⁰⁰(101-digit number)
20605590287262763901…31827566105224806401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.121 × 10¹⁰⁰(101-digit number)
41211180574525527802…63655132210449612801
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,995,024 XPM·at block #6,843,830 · 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