Block #1,271,309

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/7/2015, 6:04:54 PM · Difficulty 10.8180 · 5,571,048 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
577a850a62530f4e89e395d44cd2689199a2ddad0637ed59930c34c908ed915f

Height

#1,271,309

Difficulty

10.817993

Transactions

2

Size

946 B

Version

2

Bits

0ad167fc

Nonce

291,057

Timestamp

10/7/2015, 6:04:54 PM

Confirmations

5,571,048

Merkle Root

0cc43f23d6dd71165e8290b09b8765645a4de34eed5bb49050a876ce579bcd5f
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.070 × 10¹⁰³(104-digit number)
10702762249661877610…43197302036148462081
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.070 × 10¹⁰³(104-digit number)
10702762249661877610…43197302036148462081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.140 × 10¹⁰³(104-digit number)
21405524499323755221…86394604072296924161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.281 × 10¹⁰³(104-digit number)
42811048998647510442…72789208144593848321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.562 × 10¹⁰³(104-digit number)
85622097997295020885…45578416289187696641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.712 × 10¹⁰⁴(105-digit number)
17124419599459004177…91156832578375393281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.424 × 10¹⁰⁴(105-digit number)
34248839198918008354…82313665156750786561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.849 × 10¹⁰⁴(105-digit number)
68497678397836016708…64627330313501573121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.369 × 10¹⁰⁵(106-digit number)
13699535679567203341…29254660627003146241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.739 × 10¹⁰⁵(106-digit number)
27399071359134406683…58509321254006292481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.479 × 10¹⁰⁵(106-digit number)
54798142718268813366…17018642508012584961
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,983,263 XPM·at block #6,842,356 · 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