Block #276,453

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/27/2013, 4:45:30 AM · Difficulty 9.9632 · 6,534,362 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
21936769147f79b77bd2269f7f4a9adcc02d1de89ef07731db43d4f70a3c6d4e

Height

#276,453

Difficulty

9.963198

Transactions

4

Size

1.57 KB

Version

2

Bits

09f69425

Nonce

7,564

Timestamp

11/27/2013, 4:45:30 AM

Confirmations

6,534,362

Merkle Root

1c5d8a84a70f8990f15ae53ee41c0f09b67bc78120118d9b70a2d066c8a36f55
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.335 × 10¹⁰²(103-digit number)
13350328842315357153…56851768650813278341
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.335 × 10¹⁰²(103-digit number)
13350328842315357153…56851768650813278341
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.670 × 10¹⁰²(103-digit number)
26700657684630714306…13703537301626556681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.340 × 10¹⁰²(103-digit number)
53401315369261428613…27407074603253113361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.068 × 10¹⁰³(104-digit number)
10680263073852285722…54814149206506226721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.136 × 10¹⁰³(104-digit number)
21360526147704571445…09628298413012453441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.272 × 10¹⁰³(104-digit number)
42721052295409142891…19256596826024906881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.544 × 10¹⁰³(104-digit number)
85442104590818285782…38513193652049813761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.708 × 10¹⁰⁴(105-digit number)
17088420918163657156…77026387304099627521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.417 × 10¹⁰⁴(105-digit number)
34176841836327314312…54052774608199255041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.835 × 10¹⁰⁴(105-digit number)
68353683672654628625…08105549216398510081
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,730,621 XPM·at block #6,810,814 · 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.

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