Block #380,368

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/29/2014, 5:28:11 AM · Difficulty 10.4119 · 6,429,490 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
da47139f13c70523f203bca5fcf14dd15dc1f8ef51ac4a479757d57b6a97fbf7

Height

#380,368

Difficulty

10.411916

Transactions

2

Size

433 B

Version

2

Bits

0a69735c

Nonce

50,334,799

Timestamp

1/29/2014, 5:28:11 AM

Confirmations

6,429,490

Merkle Root

03b19ce4c2732fca91a978f17be246d81b3d74d7e8221716ea9303d138220153
Transactions (2)
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.504 × 10⁹⁵(96-digit number)
75047783701970865403…33199261436277706239
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.504 × 10⁹⁵(96-digit number)
75047783701970865403…33199261436277706239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.500 × 10⁹⁶(97-digit number)
15009556740394173080…66398522872555412479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.001 × 10⁹⁶(97-digit number)
30019113480788346161…32797045745110824959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.003 × 10⁹⁶(97-digit number)
60038226961576692322…65594091490221649919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.200 × 10⁹⁷(98-digit number)
12007645392315338464…31188182980443299839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.401 × 10⁹⁷(98-digit number)
24015290784630676928…62376365960886599679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.803 × 10⁹⁷(98-digit number)
48030581569261353857…24752731921773199359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.606 × 10⁹⁷(98-digit number)
96061163138522707715…49505463843546398719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.921 × 10⁹⁸(99-digit number)
19212232627704541543…99010927687092797439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.842 × 10⁹⁸(99-digit number)
38424465255409083086…98021855374185594879
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,722,952 XPM·at block #6,809,857 · 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