Block #341,804

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/3/2014, 4:35:26 PM · Difficulty 10.1448 · 6,482,833 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
57cc7fca5d173e39df1dab468890997f8ec6289fce8c2a5f092e1c77b4b13046

Height

#341,804

Difficulty

10.144830

Transactions

18

Size

7.72 KB

Version

2

Bits

0a251398

Nonce

142,836

Timestamp

1/3/2014, 4:35:26 PM

Confirmations

6,482,833

Merkle Root

f2e42fbe6942ce5dcb688adf9ad2cb678904a2f0e9cbc4094c10891f469eaf20
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.

1.831 × 10⁹⁷(98-digit number)
18319845264245097091…24873374189947066879
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
1.831 × 10⁹⁷(98-digit number)
18319845264245097091…24873374189947066879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.663 × 10⁹⁷(98-digit number)
36639690528490194182…49746748379894133759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.327 × 10⁹⁷(98-digit number)
73279381056980388365…99493496759788267519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.465 × 10⁹⁸(99-digit number)
14655876211396077673…98986993519576535039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.931 × 10⁹⁸(99-digit number)
29311752422792155346…97973987039153070079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.862 × 10⁹⁸(99-digit number)
58623504845584310692…95947974078306140159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.172 × 10⁹⁹(100-digit number)
11724700969116862138…91895948156612280319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.344 × 10⁹⁹(100-digit number)
23449401938233724276…83791896313224560639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.689 × 10⁹⁹(100-digit number)
46898803876467448553…67583792626449121279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.379 × 10⁹⁹(100-digit number)
93797607752934897107…35167585252898242559
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,841,160 XPM·at block #6,824,636 · 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