Block #366,379

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/19/2014, 9:05:59 AM · Difficulty 10.4303 · 6,448,011 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ef51dec9fdaf593ccbacfd7fa370ccfda63151d951923fe0d0a88a54688abe5b

Height

#366,379

Difficulty

10.430350

Transactions

7

Size

3.11 KB

Version

2

Bits

0a6e2b68

Nonce

2,836

Timestamp

1/19/2014, 9:05:59 AM

Confirmations

6,448,011

Merkle Root

445172d285129f83e289e4253e40422a679a7b6dc7c206205382fa7b83553a01
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.

5.407 × 10¹⁰⁰(101-digit number)
54076452656942357168…53536066392313696639
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
5.407 × 10¹⁰⁰(101-digit number)
54076452656942357168…53536066392313696639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.081 × 10¹⁰¹(102-digit number)
10815290531388471433…07072132784627393279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.163 × 10¹⁰¹(102-digit number)
21630581062776942867…14144265569254786559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.326 × 10¹⁰¹(102-digit number)
43261162125553885734…28288531138509573119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.652 × 10¹⁰¹(102-digit number)
86522324251107771469…56577062277019146239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.730 × 10¹⁰²(103-digit number)
17304464850221554293…13154124554038292479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.460 × 10¹⁰²(103-digit number)
34608929700443108587…26308249108076584959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.921 × 10¹⁰²(103-digit number)
69217859400886217175…52616498216153169919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.384 × 10¹⁰³(104-digit number)
13843571880177243435…05232996432306339839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.768 × 10¹⁰³(104-digit number)
27687143760354486870…10465992864612679679
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,759,181 XPM·at block #6,814,389 · 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