Block #344,453

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/5/2014, 7:59:16 AM · Difficulty 10.1927 · 6,480,577 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5392c3d1eefd07d5af23a8ff2a06eabb5984a27052b865e858bbe3583a279b74

Height

#344,453

Difficulty

10.192737

Transactions

5

Size

1.08 KB

Version

2

Bits

0a31573c

Nonce

64,943

Timestamp

1/5/2014, 7:59:16 AM

Confirmations

6,480,577

Merkle Root

273b924c32e5a256f61d39562f7e17f406606b45bfb9a3de1c189b81b12f6f03
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.

3.800 × 10⁹⁷(98-digit number)
38002204428252754183…16583194359539507199
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
3.800 × 10⁹⁷(98-digit number)
38002204428252754183…16583194359539507199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.600 × 10⁹⁷(98-digit number)
76004408856505508367…33166388719079014399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.520 × 10⁹⁸(99-digit number)
15200881771301101673…66332777438158028799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.040 × 10⁹⁸(99-digit number)
30401763542602203346…32665554876316057599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.080 × 10⁹⁸(99-digit number)
60803527085204406693…65331109752632115199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.216 × 10⁹⁹(100-digit number)
12160705417040881338…30662219505264230399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.432 × 10⁹⁹(100-digit number)
24321410834081762677…61324439010528460799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.864 × 10⁹⁹(100-digit number)
48642821668163525355…22648878021056921599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.728 × 10⁹⁹(100-digit number)
97285643336327050710…45297756042113843199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.945 × 10¹⁰⁰(101-digit number)
19457128667265410142…90595512084227686399
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,844,323 XPM·at block #6,825,029 · 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