Block #2,455,283

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/3/2018, 6:27:45 AM · Difficulty 10.9525 · 4,385,921 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bb3822d8773495d65ee46f164f0f1e39518e3d22b2c77bdf233b4d14e38efb78

Height

#2,455,283

Difficulty

10.952516

Transactions

19

Size

7.27 KB

Version

2

Bits

0af3d817

Nonce

608,022,253

Timestamp

1/3/2018, 6:27:45 AM

Confirmations

4,385,921

Merkle Root

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

8.001 × 10⁹⁴(95-digit number)
80011147533123700561…12844345459996704401
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
8.001 × 10⁹⁴(95-digit number)
80011147533123700561…12844345459996704401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.600 × 10⁹⁵(96-digit number)
16002229506624740112…25688690919993408801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.200 × 10⁹⁵(96-digit number)
32004459013249480224…51377381839986817601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.400 × 10⁹⁵(96-digit number)
64008918026498960449…02754763679973635201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.280 × 10⁹⁶(97-digit number)
12801783605299792089…05509527359947270401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.560 × 10⁹⁶(97-digit number)
25603567210599584179…11019054719894540801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.120 × 10⁹⁶(97-digit number)
51207134421199168359…22038109439789081601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.024 × 10⁹⁷(98-digit number)
10241426884239833671…44076218879578163201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.048 × 10⁹⁷(98-digit number)
20482853768479667343…88152437759156326401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.096 × 10⁹⁷(98-digit number)
40965707536959334687…76304875518312652801
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,973,994 XPM·at block #6,841,203 · 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