Block #2,277,025

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/1/2017, 12:57:45 AM · Difficulty 10.9551 · 4,554,007 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f93ef66b36a39e6e4d7f1b8fd248f01a795f64e3e807f6deb2b3547ada26fb10

Height

#2,277,025

Difficulty

10.955106

Transactions

2

Size

722 B

Version

2

Bits

0af481d3

Nonce

577,812,372

Timestamp

9/1/2017, 12:57:45 AM

Confirmations

4,554,007

Merkle Root

585fc87aadea58bbf7a7f9113da3e90689d2c1d9c87c8385e5e95cc37c6ca7d0
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.

4.298 × 10⁹³(94-digit number)
42980810083152766038…42046107038140576001
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.298 × 10⁹³(94-digit number)
42980810083152766038…42046107038140576001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.596 × 10⁹³(94-digit number)
85961620166305532077…84092214076281152001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.719 × 10⁹⁴(95-digit number)
17192324033261106415…68184428152562304001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.438 × 10⁹⁴(95-digit number)
34384648066522212830…36368856305124608001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.876 × 10⁹⁴(95-digit number)
68769296133044425661…72737712610249216001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.375 × 10⁹⁵(96-digit number)
13753859226608885132…45475425220498432001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.750 × 10⁹⁵(96-digit number)
27507718453217770264…90950850440996864001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.501 × 10⁹⁵(96-digit number)
55015436906435540529…81901700881993728001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.100 × 10⁹⁶(97-digit number)
11003087381287108105…63803401763987456001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.200 × 10⁹⁶(97-digit number)
22006174762574216211…27606803527974912001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.401 × 10⁹⁶(97-digit number)
44012349525148432423…55213607055949824001
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,892,391 XPM·at block #6,831,031 · 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