Block #405,301

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/15/2014, 11:36:45 AM · Difficulty 10.4303 · 6,419,405 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
47411d72051f9d6a309d7699f84a784d0ec927d132186f1330157ae39e705478

Height

#405,301

Difficulty

10.430335

Transactions

3

Size

1.23 KB

Version

2

Bits

0a6e2a6d

Nonce

37,396

Timestamp

2/15/2014, 11:36:45 AM

Confirmations

6,419,405

Merkle Root

70b715c3252f93f10aa43d2b0b7f7db85bc0214ac77d015b8e3998f972cba4bd
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.365 × 10¹⁰³(104-digit number)
13656737847811365624…55374926776270675619
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.365 × 10¹⁰³(104-digit number)
13656737847811365624…55374926776270675619
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.731 × 10¹⁰³(104-digit number)
27313475695622731248…10749853552541351239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.462 × 10¹⁰³(104-digit number)
54626951391245462497…21499707105082702479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.092 × 10¹⁰⁴(105-digit number)
10925390278249092499…42999414210165404959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.185 × 10¹⁰⁴(105-digit number)
21850780556498184999…85998828420330809919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.370 × 10¹⁰⁴(105-digit number)
43701561112996369998…71997656840661619839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.740 × 10¹⁰⁴(105-digit number)
87403122225992739996…43995313681323239679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.748 × 10¹⁰⁵(106-digit number)
17480624445198547999…87990627362646479359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.496 × 10¹⁰⁵(106-digit number)
34961248890397095998…75981254725292958719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.992 × 10¹⁰⁵(106-digit number)
69922497780794191997…51962509450585917439
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,841,714 XPM·at block #6,824,705 · 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