Block #1,000,500

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/3/2015, 4:57:06 AM · Difficulty 10.7753 · 5,813,734 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1a1a7fff8cdd889ca6faea41dc742a4715829983c17465b87d27682926e22941

Height

#1,000,500

Difficulty

10.775273

Transactions

5

Size

1.66 KB

Version

2

Bits

0ac67844

Nonce

40,571,362

Timestamp

4/3/2015, 4:57:06 AM

Confirmations

5,813,734

Merkle Root

5d13b692c5cbf856131f18a5dc011ade28df6f2a9ed1357bfed2c82c2ed7b926
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.

1.520 × 10⁹⁷(98-digit number)
15209452555348449699…42452592920339123201
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
1.520 × 10⁹⁷(98-digit number)
15209452555348449699…42452592920339123201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.041 × 10⁹⁷(98-digit number)
30418905110696899398…84905185840678246401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.083 × 10⁹⁷(98-digit number)
60837810221393798796…69810371681356492801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.216 × 10⁹⁸(99-digit number)
12167562044278759759…39620743362712985601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.433 × 10⁹⁸(99-digit number)
24335124088557519518…79241486725425971201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.867 × 10⁹⁸(99-digit number)
48670248177115039037…58482973450851942401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.734 × 10⁹⁸(99-digit number)
97340496354230078074…16965946901703884801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.946 × 10⁹⁹(100-digit number)
19468099270846015614…33931893803407769601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.893 × 10⁹⁹(100-digit number)
38936198541692031229…67863787606815539201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.787 × 10⁹⁹(100-digit number)
77872397083384062459…35727575213631078401
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,757,943 XPM·at block #6,814,233 · 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