Block #2,232,082

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/1/2017, 8:39:34 AM · Difficulty 10.9463 · 4,595,220 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
58c8a08d99860f82fc56abc431113c23ba4c9fb8a3cea92f29c966f44aa72a51

Height

#2,232,082

Difficulty

10.946310

Transactions

3

Size

1.94 KB

Version

2

Bits

0af24160

Nonce

1,748,613,253

Timestamp

8/1/2017, 8:39:34 AM

Confirmations

4,595,220

Merkle Root

c13d1a9d534079625be5f98c0b8b8993a58c2f5823c2bb9c7b92bf7aa898237b
Transactions (3)
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.665 × 10⁹⁵(96-digit number)
46655784016310516826…74931954775605903361
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.665 × 10⁹⁵(96-digit number)
46655784016310516826…74931954775605903361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.331 × 10⁹⁵(96-digit number)
93311568032621033653…49863909551211806721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.866 × 10⁹⁶(97-digit number)
18662313606524206730…99727819102423613441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.732 × 10⁹⁶(97-digit number)
37324627213048413461…99455638204847226881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.464 × 10⁹⁶(97-digit number)
74649254426096826922…98911276409694453761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.492 × 10⁹⁷(98-digit number)
14929850885219365384…97822552819388907521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.985 × 10⁹⁷(98-digit number)
29859701770438730769…95645105638777815041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.971 × 10⁹⁷(98-digit number)
59719403540877461538…91290211277555630081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.194 × 10⁹⁸(99-digit number)
11943880708175492307…82580422555111260161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.388 × 10⁹⁸(99-digit number)
23887761416350984615…65160845110222520321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.777 × 10⁹⁸(99-digit number)
47775522832701969230…30321690220445040641
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,862,527 XPM·at block #6,827,301 · 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