Block #341,592

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/3/2014, 1:23:26 PM · Difficulty 10.1413 · 6,466,018 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5cc259e7caa55235f7afcfa6c8b4d556048940897b85f36321edf5ecf11f44cd

Height

#341,592

Difficulty

10.141326

Transactions

16

Size

16.21 KB

Version

2

Bits

0a242dea

Nonce

93,569

Timestamp

1/3/2014, 1:23:26 PM

Confirmations

6,466,018

Merkle Root

2dc4572ac495e72a69753184706ccf43663d6c0765bbe7724a5b90b8f4c04b84
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.443 × 10¹⁰⁰(101-digit number)
34435789801519683700…77185796177236948479
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.443 × 10¹⁰⁰(101-digit number)
34435789801519683700…77185796177236948479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.887 × 10¹⁰⁰(101-digit number)
68871579603039367400…54371592354473896959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.377 × 10¹⁰¹(102-digit number)
13774315920607873480…08743184708947793919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.754 × 10¹⁰¹(102-digit number)
27548631841215746960…17486369417895587839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.509 × 10¹⁰¹(102-digit number)
55097263682431493920…34972738835791175679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.101 × 10¹⁰²(103-digit number)
11019452736486298784…69945477671582351359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.203 × 10¹⁰²(103-digit number)
22038905472972597568…39890955343164702719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.407 × 10¹⁰²(103-digit number)
44077810945945195136…79781910686329405439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.815 × 10¹⁰²(103-digit number)
88155621891890390272…59563821372658810879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.763 × 10¹⁰³(104-digit number)
17631124378378078054…19127642745317621759
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,704,910 XPM·at block #6,807,609 · 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