Block #275,550

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/26/2013, 6:19:32 PM · Difficulty 9.9611 · 6,541,275 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
35a55bfa045dca823f02fb16397b8bd191677c406a8f36919ccfec8640f77d6e

Height

#275,550

Difficulty

9.961092

Transactions

3

Size

1.83 KB

Version

2

Bits

09f60a1b

Nonce

9,265

Timestamp

11/26/2013, 6:19:32 PM

Confirmations

6,541,275

Merkle Root

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

2.129 × 10¹⁰⁵(106-digit number)
21295122860364808648…68519916777583667201
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
2.129 × 10¹⁰⁵(106-digit number)
21295122860364808648…68519916777583667201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.259 × 10¹⁰⁵(106-digit number)
42590245720729617297…37039833555167334401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.518 × 10¹⁰⁵(106-digit number)
85180491441459234595…74079667110334668801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.703 × 10¹⁰⁶(107-digit number)
17036098288291846919…48159334220669337601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.407 × 10¹⁰⁶(107-digit number)
34072196576583693838…96318668441338675201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.814 × 10¹⁰⁶(107-digit number)
68144393153167387676…92637336882677350401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.362 × 10¹⁰⁷(108-digit number)
13628878630633477535…85274673765354700801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.725 × 10¹⁰⁷(108-digit number)
27257757261266955070…70549347530709401601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.451 × 10¹⁰⁷(108-digit number)
54515514522533910140…41098695061418803201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.090 × 10¹⁰⁸(109-digit number)
10903102904506782028…82197390122837606401
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,778,640 XPM·at block #6,816,824 · 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