Block #409,791

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/18/2014, 3:01:10 PM · Difficulty 10.4286 · 6,406,340 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
55767242ae85ce56d97f79416fbc41c4d6f967a2d96f4c8e57d27240a5d4968b

Height

#409,791

Difficulty

10.428636

Transactions

9

Size

2.79 KB

Version

2

Bits

0a6dbb19

Nonce

205,360

Timestamp

2/18/2014, 3:01:10 PM

Confirmations

6,406,340

Merkle Root

506c730646f6a053b73149fb891a434c557043763186332042ba082acf72ab27
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.810 × 10¹⁰¹(102-digit number)
18107110276041404912…24321361333896799361
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.810 × 10¹⁰¹(102-digit number)
18107110276041404912…24321361333896799361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.621 × 10¹⁰¹(102-digit number)
36214220552082809825…48642722667793598721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.242 × 10¹⁰¹(102-digit number)
72428441104165619650…97285445335587197441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.448 × 10¹⁰²(103-digit number)
14485688220833123930…94570890671174394881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.897 × 10¹⁰²(103-digit number)
28971376441666247860…89141781342348789761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.794 × 10¹⁰²(103-digit number)
57942752883332495720…78283562684697579521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.158 × 10¹⁰³(104-digit number)
11588550576666499144…56567125369395159041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.317 × 10¹⁰³(104-digit number)
23177101153332998288…13134250738790318081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.635 × 10¹⁰³(104-digit number)
46354202306665996576…26268501477580636161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.270 × 10¹⁰³(104-digit number)
92708404613331993152…52537002955161272321
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,773,174 XPM·at block #6,816,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