Block #274,676

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/26/2013, 9:32:58 AM · Difficulty 9.9583 · 6,550,692 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1290fd4c4f4e49772026a1df9f32b51b1fee5f7739457e0c52d469aa125f0748

Height

#274,676

Difficulty

9.958278

Transactions

2

Size

757 B

Version

2

Bits

09f551b5

Nonce

850

Timestamp

11/26/2013, 9:32:58 AM

Confirmations

6,550,692

Merkle Root

4e36ef664c644da73f1b13a5f49d0e01a307ad855b40283cac3bb91d5539b4ae
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.249 × 10¹⁰³(104-digit number)
52499506938433142324…03267320395793670081
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.249 × 10¹⁰³(104-digit number)
52499506938433142324…03267320395793670081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.049 × 10¹⁰⁴(105-digit number)
10499901387686628464…06534640791587340161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.099 × 10¹⁰⁴(105-digit number)
20999802775373256929…13069281583174680321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.199 × 10¹⁰⁴(105-digit number)
41999605550746513859…26138563166349360641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.399 × 10¹⁰⁴(105-digit number)
83999211101493027719…52277126332698721281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.679 × 10¹⁰⁵(106-digit number)
16799842220298605543…04554252665397442561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.359 × 10¹⁰⁵(106-digit number)
33599684440597211087…09108505330794885121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.719 × 10¹⁰⁵(106-digit number)
67199368881194422175…18217010661589770241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.343 × 10¹⁰⁶(107-digit number)
13439873776238884435…36434021323179540481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.687 × 10¹⁰⁶(107-digit number)
26879747552477768870…72868042646359080961
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,847,041 XPM·at block #6,825,367 · 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