Block #386,399

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/2/2014, 10:53:53 AM · Difficulty 10.4074 · 6,420,505 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f4d54380b6b4b4b2addbfe5eff32f59459ef2d5148beb5a2771471d812e735d3

Height

#386,399

Difficulty

10.407409

Transactions

13

Size

3.28 KB

Version

2

Bits

0a684bf8

Nonce

222,937

Timestamp

2/2/2014, 10:53:53 AM

Confirmations

6,420,505

Merkle Root

018da90cfd4b50b2b71851d26efa5585639151c936e1b8b6ba1e60fe966376f4
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.

7.450 × 10¹⁰⁰(101-digit number)
74502916147751274810…97903262122873115759
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
7.450 × 10¹⁰⁰(101-digit number)
74502916147751274810…97903262122873115759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.490 × 10¹⁰¹(102-digit number)
14900583229550254962…95806524245746231519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.980 × 10¹⁰¹(102-digit number)
29801166459100509924…91613048491492463039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.960 × 10¹⁰¹(102-digit number)
59602332918201019848…83226096982984926079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.192 × 10¹⁰²(103-digit number)
11920466583640203969…66452193965969852159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.384 × 10¹⁰²(103-digit number)
23840933167280407939…32904387931939704319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.768 × 10¹⁰²(103-digit number)
47681866334560815878…65808775863879408639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.536 × 10¹⁰²(103-digit number)
95363732669121631757…31617551727758817279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.907 × 10¹⁰³(104-digit number)
19072746533824326351…63235103455517634559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.814 × 10¹⁰³(104-digit number)
38145493067648652703…26470206911035269119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.629 × 10¹⁰³(104-digit number)
76290986135297305406…52940413822070538239
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,699,342 XPM·at block #6,806,903 · 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