Block #365,842

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/19/2014, 12:50:59 AM · Difficulty 10.4253 · 6,450,601 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4774ee22155f9f679e0e84ead15b21cda6c158e22721ec55db179cd001502021

Height

#365,842

Difficulty

10.425284

Transactions

2

Size

462 B

Version

2

Bits

0a6cdf70

Nonce

174,807

Timestamp

1/19/2014, 12:50:59 AM

Confirmations

6,450,601

Merkle Root

f3cd6d32a723da8fb7526e48f1506b100a0f9ab5d064363acb6a669aa0d19c28
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.313 × 10⁹⁸(99-digit number)
53132286968882239582…63609253676242963599
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.313 × 10⁹⁸(99-digit number)
53132286968882239582…63609253676242963599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.062 × 10⁹⁹(100-digit number)
10626457393776447916…27218507352485927199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.125 × 10⁹⁹(100-digit number)
21252914787552895833…54437014704971854399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.250 × 10⁹⁹(100-digit number)
42505829575105791666…08874029409943708799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.501 × 10⁹⁹(100-digit number)
85011659150211583332…17748058819887417599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.700 × 10¹⁰⁰(101-digit number)
17002331830042316666…35496117639774835199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.400 × 10¹⁰⁰(101-digit number)
34004663660084633332…70992235279549670399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.800 × 10¹⁰⁰(101-digit number)
68009327320169266665…41984470559099340799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.360 × 10¹⁰¹(102-digit number)
13601865464033853333…83968941118198681599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.720 × 10¹⁰¹(102-digit number)
27203730928067706666…67937882236397363199
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,775,670 XPM·at block #6,816,442 · 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