Block #1,295,265

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/23/2015, 7:37:47 AM · Difficulty 10.8666 · 5,531,495 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b2cd2a4f94651062f6fb50327c7be2497c5ba548647cd8f8365f224b4b3d9e66

Height

#1,295,265

Difficulty

10.866621

Transactions

2

Size

1.34 KB

Version

2

Bits

0adddae6

Nonce

110,475,841

Timestamp

10/23/2015, 7:37:47 AM

Confirmations

5,531,495

Merkle Root

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

5.965 × 10⁹³(94-digit number)
59657805416442662048…79648239144224361921
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
5.965 × 10⁹³(94-digit number)
59657805416442662048…79648239144224361921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.193 × 10⁹⁴(95-digit number)
11931561083288532409…59296478288448723841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.386 × 10⁹⁴(95-digit number)
23863122166577064819…18592956576897447681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.772 × 10⁹⁴(95-digit number)
47726244333154129639…37185913153794895361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.545 × 10⁹⁴(95-digit number)
95452488666308259278…74371826307589790721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.909 × 10⁹⁵(96-digit number)
19090497733261651855…48743652615179581441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.818 × 10⁹⁵(96-digit number)
38180995466523303711…97487305230359162881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.636 × 10⁹⁵(96-digit number)
76361990933046607422…94974610460718325761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.527 × 10⁹⁶(97-digit number)
15272398186609321484…89949220921436651521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.054 × 10⁹⁶(97-digit number)
30544796373218642969…79898441842873303041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.108 × 10⁹⁶(97-digit number)
61089592746437285938…59796883685746606081
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,858,239 XPM·at block #6,826,759 · 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