Block #270,558

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/24/2013, 12:56:24 AM · Difficulty 9.9517 · 6,574,272 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5789a014f3c7e1ce065ab1ec68368d20a6cc75af44c6ba855f52d948dd1747b8

Height

#270,558

Difficulty

9.951711

Transactions

1

Size

1.84 KB

Version

2

Bits

09f3a35c

Nonce

43,222

Timestamp

11/24/2013, 12:56:24 AM

Confirmations

6,574,272

Merkle Root

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

4.418 × 10⁹⁰(91-digit number)
44180546448868159433…03911134230537178881
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
4.418 × 10⁹⁰(91-digit number)
44180546448868159433…03911134230537178881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.836 × 10⁹⁰(91-digit number)
88361092897736318867…07822268461074357761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.767 × 10⁹¹(92-digit number)
17672218579547263773…15644536922148715521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.534 × 10⁹¹(92-digit number)
35344437159094527546…31289073844297431041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.068 × 10⁹¹(92-digit number)
70688874318189055093…62578147688594862081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.413 × 10⁹²(93-digit number)
14137774863637811018…25156295377189724161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.827 × 10⁹²(93-digit number)
28275549727275622037…50312590754379448321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.655 × 10⁹²(93-digit number)
56551099454551244075…00625181508758896641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.131 × 10⁹³(94-digit number)
11310219890910248815…01250363017517793281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.262 × 10⁹³(94-digit number)
22620439781820497630…02500726035035586561
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:58,003,049 XPM·at block #6,844,829 · 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