Block #272,292

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/25/2013, 4:28:10 AM · Difficulty 9.9526 · 6,537,240 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4e16b6f151710f1bae07de844dd1ea279ab01b0b47a6b584d6e5178d72367250

Height

#272,292

Difficulty

9.952575

Transactions

6

Size

3.73 KB

Version

2

Bits

09f3dbf6

Nonce

6,662

Timestamp

11/25/2013, 4:28:10 AM

Confirmations

6,537,240

Merkle Root

f46645eb12a9ddf2c653c443409671b7600283ca2f67eec9127e4051d57b92f6
Transactions (6)
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.

7.426 × 10¹⁰²(103-digit number)
74263491157664838458…81842712178310429321
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
7.426 × 10¹⁰²(103-digit number)
74263491157664838458…81842712178310429321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.485 × 10¹⁰³(104-digit number)
14852698231532967691…63685424356620858641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.970 × 10¹⁰³(104-digit number)
29705396463065935383…27370848713241717281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.941 × 10¹⁰³(104-digit number)
59410792926131870766…54741697426483434561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.188 × 10¹⁰⁴(105-digit number)
11882158585226374153…09483394852966869121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.376 × 10¹⁰⁴(105-digit number)
23764317170452748306…18966789705933738241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.752 × 10¹⁰⁴(105-digit number)
47528634340905496613…37933579411867476481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.505 × 10¹⁰⁴(105-digit number)
95057268681810993226…75867158823734952961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.901 × 10¹⁰⁵(106-digit number)
19011453736362198645…51734317647469905921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.802 × 10¹⁰⁵(106-digit number)
38022907472724397290…03468635294939811841
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,720,334 XPM·at block #6,809,531 · 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