Block #2,280,790

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/3/2017, 2:35:42 PM · Difficulty 10.9558 · 4,562,191 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cdaa685b21f49948c932117d17850907e1618344a39dfb048f67cc0165c7421c

Height

#2,280,790

Difficulty

10.955830

Transactions

3

Size

3.81 KB

Version

2

Bits

0af4b145

Nonce

823,139,034

Timestamp

9/3/2017, 2:35:42 PM

Confirmations

4,562,191

Merkle Root

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

2.400 × 10⁹⁴(95-digit number)
24000977625465344187…19826493411964167601
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
2.400 × 10⁹⁴(95-digit number)
24000977625465344187…19826493411964167601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.800 × 10⁹⁴(95-digit number)
48001955250930688375…39652986823928335201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.600 × 10⁹⁴(95-digit number)
96003910501861376751…79305973647856670401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.920 × 10⁹⁵(96-digit number)
19200782100372275350…58611947295713340801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.840 × 10⁹⁵(96-digit number)
38401564200744550700…17223894591426681601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.680 × 10⁹⁵(96-digit number)
76803128401489101401…34447789182853363201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.536 × 10⁹⁶(97-digit number)
15360625680297820280…68895578365706726401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.072 × 10⁹⁶(97-digit number)
30721251360595640560…37791156731413452801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.144 × 10⁹⁶(97-digit number)
61442502721191281121…75582313462826905601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.228 × 10⁹⁷(98-digit number)
12288500544238256224…51164626925653811201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.457 × 10⁹⁷(98-digit number)
24577001088476512448…02329253851307622401
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,988,202 XPM·at block #6,842,980 · 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