Block #2,222,083

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/25/2017, 10:27:52 AM · Difficulty 10.9457 · 4,619,933 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1b21b8ec92ab4c8d36754ffa6a0ab7881db948130af49107ae3c00b52265f79c

Height

#2,222,083

Difficulty

10.945690

Transactions

2

Size

425 B

Version

2

Bits

0af218b8

Nonce

1,275,657,204

Timestamp

7/25/2017, 10:27:52 AM

Confirmations

4,619,933

Merkle Root

cddaf42aec34a0897a5455fe771fd7535f49cd71bce7782398ff2a7ac3ef73ce
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.

3.685 × 10⁹⁴(95-digit number)
36855761462445043425…70446895285663982081
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
3.685 × 10⁹⁴(95-digit number)
36855761462445043425…70446895285663982081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.371 × 10⁹⁴(95-digit number)
73711522924890086850…40893790571327964161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.474 × 10⁹⁵(96-digit number)
14742304584978017370…81787581142655928321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.948 × 10⁹⁵(96-digit number)
29484609169956034740…63575162285311856641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.896 × 10⁹⁵(96-digit number)
58969218339912069480…27150324570623713281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.179 × 10⁹⁶(97-digit number)
11793843667982413896…54300649141247426561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.358 × 10⁹⁶(97-digit number)
23587687335964827792…08601298282494853121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.717 × 10⁹⁶(97-digit number)
47175374671929655584…17202596564989706241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.435 × 10⁹⁶(97-digit number)
94350749343859311168…34405193129979412481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.887 × 10⁹⁷(98-digit number)
18870149868771862233…68810386259958824961
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,980,515 XPM·at block #6,842,015 · 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