Block #341,297

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/3/2014, 9:01:41 AM · Difficulty 10.1357 · 6,469,354 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
db2fc9fab7b5814e892618ded93811d17a404980e54ade95f4da56fb9977cb09

Height

#341,297

Difficulty

10.135720

Transactions

20

Size

7.75 KB

Version

2

Bits

0a22be85

Nonce

211,515

Timestamp

1/3/2014, 9:01:41 AM

Confirmations

6,469,354

Merkle Root

7d9aa64d9b74dcee3c2d8f3127db06109eeada889ec6c2e7740884f377c52fc0
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.170 × 10⁹⁹(100-digit number)
21706984033211077649…44624559391444286399
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.170 × 10⁹⁹(100-digit number)
21706984033211077649…44624559391444286399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.341 × 10⁹⁹(100-digit number)
43413968066422155299…89249118782888572799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.682 × 10⁹⁹(100-digit number)
86827936132844310598…78498237565777145599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.736 × 10¹⁰⁰(101-digit number)
17365587226568862119…56996475131554291199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.473 × 10¹⁰⁰(101-digit number)
34731174453137724239…13992950263108582399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.946 × 10¹⁰⁰(101-digit number)
69462348906275448478…27985900526217164799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.389 × 10¹⁰¹(102-digit number)
13892469781255089695…55971801052434329599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.778 × 10¹⁰¹(102-digit number)
27784939562510179391…11943602104868659199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.556 × 10¹⁰¹(102-digit number)
55569879125020358783…23887204209737318399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.111 × 10¹⁰²(103-digit number)
11113975825004071756…47774408419474636799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.222 × 10¹⁰²(103-digit number)
22227951650008143513…95548816838949273599
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,729,298 XPM·at block #6,810,650 · 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