Block #343,310

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/4/2014, 2:52:45 PM · Difficulty 10.1735 · 6,466,150 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b7d7356dacb07f9447fb61fe469e01455aafd908da472b85f7357471a44c27ae

Height

#343,310

Difficulty

10.173504

Transactions

21

Size

6.39 KB

Version

2

Bits

0a2c6ac8

Nonce

399,880

Timestamp

1/4/2014, 2:52:45 PM

Confirmations

6,466,150

Merkle Root

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

2.181 × 10⁹⁸(99-digit number)
21817741585384286237…75422745248069402849
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
2.181 × 10⁹⁸(99-digit number)
21817741585384286237…75422745248069402849
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.363 × 10⁹⁸(99-digit number)
43635483170768572475…50845490496138805699
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.727 × 10⁹⁸(99-digit number)
87270966341537144951…01690980992277611399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.745 × 10⁹⁹(100-digit number)
17454193268307428990…03381961984555222799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.490 × 10⁹⁹(100-digit number)
34908386536614857980…06763923969110445599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.981 × 10⁹⁹(100-digit number)
69816773073229715961…13527847938220891199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.396 × 10¹⁰⁰(101-digit number)
13963354614645943192…27055695876441782399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.792 × 10¹⁰⁰(101-digit number)
27926709229291886384…54111391752883564799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.585 × 10¹⁰⁰(101-digit number)
55853418458583772769…08222783505767129599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.117 × 10¹⁰¹(102-digit number)
11170683691716754553…16445567011534259199
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,719,752 XPM·at block #6,809,459 · 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