Block #272,795

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/25/2013, 11:19:01 AM · Difficulty 9.9534 · 6,540,041 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c3e187833b18101d7e2de1ac420c6e0eb89434d629ce4ca49b47f2029c5ae741

Height

#272,795

Difficulty

9.953448

Transactions

6

Size

14.02 KB

Version

2

Bits

09f4152e

Nonce

20,899

Timestamp

11/25/2013, 11:19:01 AM

Confirmations

6,540,041

Merkle Root

3c70392ee0f60f0d5ac1ccbb07f659d076f9c5469de34a5233b5dc56494cd649
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.

9.015 × 10¹⁰²(103-digit number)
90156607134678710722…18843490332572410361
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
9.015 × 10¹⁰²(103-digit number)
90156607134678710722…18843490332572410361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.803 × 10¹⁰³(104-digit number)
18031321426935742144…37686980665144820721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.606 × 10¹⁰³(104-digit number)
36062642853871484288…75373961330289641441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.212 × 10¹⁰³(104-digit number)
72125285707742968577…50747922660579282881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.442 × 10¹⁰⁴(105-digit number)
14425057141548593715…01495845321158565761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.885 × 10¹⁰⁴(105-digit number)
28850114283097187431…02991690642317131521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.770 × 10¹⁰⁴(105-digit number)
57700228566194374862…05983381284634263041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.154 × 10¹⁰⁵(106-digit number)
11540045713238874972…11966762569268526081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.308 × 10¹⁰⁵(106-digit number)
23080091426477749944…23933525138537052161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.616 × 10¹⁰⁵(106-digit number)
46160182852955499889…47867050277074104321
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,746,733 XPM·at block #6,812,835 · 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