Block #2,670,554

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/20/2018, 10:37:45 PM · Difficulty 11.6846 · 4,162,691 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ba9b6c93dfad67ef5c20f0c8ab884f5e31e0e245c386d43e02e076f95105e731

Height

#2,670,554

Difficulty

11.684606

Transactions

2

Size

1021 B

Version

2

Bits

0baf425b

Nonce

1,562,695,995

Timestamp

5/20/2018, 10:37:45 PM

Confirmations

4,162,691

Merkle Root

852534bc8f60483c93d0fa4425b4e9e972326bab97d6fd07204706cd9acecedf
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.187 × 10⁹⁵(96-digit number)
21874244607471058952…11758987400011397721
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.187 × 10⁹⁵(96-digit number)
21874244607471058952…11758987400011397721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.374 × 10⁹⁵(96-digit number)
43748489214942117904…23517974800022795441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.749 × 10⁹⁵(96-digit number)
87496978429884235808…47035949600045590881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.749 × 10⁹⁶(97-digit number)
17499395685976847161…94071899200091181761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.499 × 10⁹⁶(97-digit number)
34998791371953694323…88143798400182363521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.999 × 10⁹⁶(97-digit number)
69997582743907388646…76287596800364727041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.399 × 10⁹⁷(98-digit number)
13999516548781477729…52575193600729454081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.799 × 10⁹⁷(98-digit number)
27999033097562955458…05150387201458908161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.599 × 10⁹⁷(98-digit number)
55998066195125910917…10300774402917816321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.119 × 10⁹⁸(99-digit number)
11199613239025182183…20601548805835632641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.239 × 10⁹⁸(99-digit number)
22399226478050364366…41203097611671265281
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,910,149 XPM·at block #6,833,244 · 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