Block #290,856

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/2/2013, 9:35:30 PM · Difficulty 9.9895 · 6,526,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
3e337080c96caea6ab630254f17c59c9e1d872927d6a884809a0e42fa61348d4

Height

#290,856

Difficulty

9.989509

Transactions

2

Size

423 B

Version

2

Bits

09fd5073

Nonce

125,993

Timestamp

12/2/2013, 9:35:30 PM

Confirmations

6,526,275

Merkle Root

48084de76e49131b81c420bfd314f7a72802962a6ed51d7d8723a1645e5f1022
Transactions (2)
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.721 × 10⁹⁰(91-digit number)
27216277181857782920…18209085298066763201
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.721 × 10⁹⁰(91-digit number)
27216277181857782920…18209085298066763201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.443 × 10⁹⁰(91-digit number)
54432554363715565840…36418170596133526401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.088 × 10⁹¹(92-digit number)
10886510872743113168…72836341192267052801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.177 × 10⁹¹(92-digit number)
21773021745486226336…45672682384534105601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.354 × 10⁹¹(92-digit number)
43546043490972452672…91345364769068211201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.709 × 10⁹¹(92-digit number)
87092086981944905344…82690729538136422401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.741 × 10⁹²(93-digit number)
17418417396388981068…65381459076272844801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.483 × 10⁹²(93-digit number)
34836834792777962137…30762918152545689601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.967 × 10⁹²(93-digit number)
69673669585555924275…61525836305091379201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.393 × 10⁹³(94-digit number)
13934733917111184855…23051672610182758401
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,781,082 XPM·at block #6,817,130 · 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