Block #275,355

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/26/2013, 4:20:37 PM · Difficulty 9.9605 · 6,550,756 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5a18674afa36a826e27c54fd6c8acf280d3e366fac675761644b57696ac2180e

Height

#275,355

Difficulty

9.960486

Transactions

3

Size

1.94 KB

Version

2

Bits

09f5e266

Nonce

356

Timestamp

11/26/2013, 4:20:37 PM

Confirmations

6,550,756

Merkle Root

cc2d97dc3944faad4b58dc4feaed110003c60eafc85a1abdd6fe49b999a4d71d
Transactions (3)
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.380 × 10¹⁰³(104-digit number)
53800169280770420755…27706089946163394961
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.380 × 10¹⁰³(104-digit number)
53800169280770420755…27706089946163394961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.076 × 10¹⁰⁴(105-digit number)
10760033856154084151…55412179892326789921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.152 × 10¹⁰⁴(105-digit number)
21520067712308168302…10824359784653579841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.304 × 10¹⁰⁴(105-digit number)
43040135424616336604…21648719569307159681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.608 × 10¹⁰⁴(105-digit number)
86080270849232673208…43297439138614319361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.721 × 10¹⁰⁵(106-digit number)
17216054169846534641…86594878277228638721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.443 × 10¹⁰⁵(106-digit number)
34432108339693069283…73189756554457277441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.886 × 10¹⁰⁵(106-digit number)
68864216679386138566…46379513108914554881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.377 × 10¹⁰⁶(107-digit number)
13772843335877227713…92759026217829109761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.754 × 10¹⁰⁶(107-digit number)
27545686671754455426…85518052435658219521
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,853,012 XPM·at block #6,826,110 · 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