Block #1,261,265

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/30/2015, 4:14:29 PM · Difficulty 10.8229 · 5,582,077 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1decad8166ea3075e84ecc07d6031020a6f9a1f7aca209e84d94e476bb1cb558

Height

#1,261,265

Difficulty

10.822873

Transactions

2

Size

3.74 KB

Version

2

Bits

0ad2a7d5

Nonce

1,191,959,632

Timestamp

9/30/2015, 4:14:29 PM

Confirmations

5,582,077

Merkle Root

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

5.617 × 10⁹⁶(97-digit number)
56179245465847082248…35112524918491627521
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.617 × 10⁹⁶(97-digit number)
56179245465847082248…35112524918491627521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.123 × 10⁹⁷(98-digit number)
11235849093169416449…70225049836983255041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.247 × 10⁹⁷(98-digit number)
22471698186338832899…40450099673966510081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.494 × 10⁹⁷(98-digit number)
44943396372677665798…80900199347933020161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.988 × 10⁹⁷(98-digit number)
89886792745355331596…61800398695866040321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.797 × 10⁹⁸(99-digit number)
17977358549071066319…23600797391732080641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.595 × 10⁹⁸(99-digit number)
35954717098142132638…47201594783464161281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.190 × 10⁹⁸(99-digit number)
71909434196284265277…94403189566928322561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.438 × 10⁹⁹(100-digit number)
14381886839256853055…88806379133856645121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.876 × 10⁹⁹(100-digit number)
28763773678513706110…77612758267713290241
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,991,096 XPM·at block #6,843,341 · 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