Block #2,260,500

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/20/2017, 6:37:16 PM · Difficulty 10.9518 · 4,571,250 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
eb046a773992b3734a94a470b334aa297115305bea2d1e62fa7e98e8136d3e2b

Height

#2,260,500

Difficulty

10.951811

Transactions

2

Size

427 B

Version

2

Bits

0af3a9e9

Nonce

285,168,044

Timestamp

8/20/2017, 6:37:16 PM

Confirmations

4,571,250

Merkle Root

613bb0fc7abc3863e2de3b9c5c7dfe5230a19b998bdcc8b347c6acba39412fa9
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.926 × 10⁹⁵(96-digit number)
29261235131582555184…50798555113717455361
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.926 × 10⁹⁵(96-digit number)
29261235131582555184…50798555113717455361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.852 × 10⁹⁵(96-digit number)
58522470263165110368…01597110227434910721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.170 × 10⁹⁶(97-digit number)
11704494052633022073…03194220454869821441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.340 × 10⁹⁶(97-digit number)
23408988105266044147…06388440909739642881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.681 × 10⁹⁶(97-digit number)
46817976210532088294…12776881819479285761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.363 × 10⁹⁶(97-digit number)
93635952421064176589…25553763638958571521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.872 × 10⁹⁷(98-digit number)
18727190484212835317…51107527277917143041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.745 × 10⁹⁷(98-digit number)
37454380968425670635…02215054555834286081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.490 × 10⁹⁷(98-digit number)
74908761936851341271…04430109111668572161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.498 × 10⁹⁸(99-digit number)
14981752387370268254…08860218223337144321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.996 × 10⁹⁸(99-digit number)
29963504774740536508…17720436446674288641
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,898,108 XPM·at block #6,831,749 · 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