Block #274,081

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/26/2013, 3:31:34 AM · Difficulty 9.9563 · 6,564,022 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
af8baa5caa83421d7670beef7c886849e60f9fa7b8f3af375913f741855215f8

Height

#274,081

Difficulty

9.956304

Transactions

7

Size

3.32 KB

Version

2

Bits

09f4d057

Nonce

421,898

Timestamp

11/26/2013, 3:31:34 AM

Confirmations

6,564,022

Merkle Root

091c0133198f7d6a6312cdc63410bc2f69f9aa667e50d2e6208c5153309e73ee
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.

6.447 × 10⁹³(94-digit number)
64470960555811765167…11044675245877736801
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
6.447 × 10⁹³(94-digit number)
64470960555811765167…11044675245877736801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.289 × 10⁹⁴(95-digit number)
12894192111162353033…22089350491755473601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.578 × 10⁹⁴(95-digit number)
25788384222324706067…44178700983510947201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.157 × 10⁹⁴(95-digit number)
51576768444649412134…88357401967021894401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.031 × 10⁹⁵(96-digit number)
10315353688929882426…76714803934043788801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.063 × 10⁹⁵(96-digit number)
20630707377859764853…53429607868087577601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.126 × 10⁹⁵(96-digit number)
41261414755719529707…06859215736175155201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.252 × 10⁹⁵(96-digit number)
82522829511439059414…13718431472350310401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.650 × 10⁹⁶(97-digit number)
16504565902287811882…27436862944700620801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.300 × 10⁹⁶(97-digit number)
33009131804575623765…54873725889401241601
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,949,177 XPM·at block #6,838,102 · 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