Block #2,276,511

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/31/2017, 4:04:22 PM · Difficulty 10.9553 · 4,554,381 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7f086bac65d4bce8e4aad23a3fcebca39da20c3b195eebf42174b5cdebd241c2

Height

#2,276,511

Difficulty

10.955261

Transactions

3

Size

2.34 KB

Version

2

Bits

0af48c02

Nonce

599,123,316

Timestamp

8/31/2017, 4:04:22 PM

Confirmations

4,554,381

Merkle Root

819cb8b8e412a0b70e5d4c251c79748b416e4946ccd4d6fc10f76109ad45d4db
Transactions (3)
1 in → 1 out8.3500 XPM110 B
3 in → 1 out1099.9900 XPM486 B
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.778 × 10⁹⁵(96-digit number)
17787636182575701955…17815941610855697041
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.778 × 10⁹⁵(96-digit number)
17787636182575701955…17815941610855697041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.557 × 10⁹⁵(96-digit number)
35575272365151403910…35631883221711394081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.115 × 10⁹⁵(96-digit number)
71150544730302807820…71263766443422788161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.423 × 10⁹⁶(97-digit number)
14230108946060561564…42527532886845576321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.846 × 10⁹⁶(97-digit number)
28460217892121123128…85055065773691152641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.692 × 10⁹⁶(97-digit number)
56920435784242246256…70110131547382305281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.138 × 10⁹⁷(98-digit number)
11384087156848449251…40220263094764610561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.276 × 10⁹⁷(98-digit number)
22768174313696898502…80440526189529221121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.553 × 10⁹⁷(98-digit number)
45536348627393797005…60881052379058442241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.107 × 10⁹⁷(98-digit number)
91072697254787594010…21762104758116884481
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,891,263 XPM·at block #6,830,891 · 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