Block #1,226,184

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/7/2015, 4:46:48 PM · Difficulty 10.7357 · 5,599,512 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6a5aac1bec16a30655950509a630853b39144fef51932256ae6219102c9309d9

Height

#1,226,184

Difficulty

10.735734

Transactions

6

Size

3.00 KB

Version

2

Bits

0abc590a

Nonce

750,357,810

Timestamp

9/7/2015, 4:46:48 PM

Confirmations

5,599,512

Merkle Root

6b5a4970609fb6e6e16b139897329c88a9b422cd271790366f970561c03d9354
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.267 × 10⁹⁶(97-digit number)
12678737816932305776…87530351235404427521
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.267 × 10⁹⁶(97-digit number)
12678737816932305776…87530351235404427521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.535 × 10⁹⁶(97-digit number)
25357475633864611552…75060702470808855041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.071 × 10⁹⁶(97-digit number)
50714951267729223104…50121404941617710081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.014 × 10⁹⁷(98-digit number)
10142990253545844620…00242809883235420161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.028 × 10⁹⁷(98-digit number)
20285980507091689241…00485619766470840321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.057 × 10⁹⁷(98-digit number)
40571961014183378483…00971239532941680641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.114 × 10⁹⁷(98-digit number)
81143922028366756966…01942479065883361281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.622 × 10⁹⁸(99-digit number)
16228784405673351393…03884958131766722561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.245 × 10⁹⁸(99-digit number)
32457568811346702786…07769916263533445121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.491 × 10⁹⁸(99-digit number)
64915137622693405573…15539832527066890241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.298 × 10⁹⁹(100-digit number)
12983027524538681114…31079665054133780481
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,849,680 XPM·at block #6,825,695 · 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