Block #345,383

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/5/2014, 9:44:21 PM · Difficulty 10.2093 · 6,463,623 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ca65926b48510337721bb7a57dc0eea3563ccf4a49d86b59411c290b160bf714

Height

#345,383

Difficulty

10.209304

Transactions

2

Size

414 B

Version

2

Bits

0a3594f5

Nonce

47,435

Timestamp

1/5/2014, 9:44:21 PM

Confirmations

6,463,623

Merkle Root

406b5ea6d68f144efed161375901b340ff297311018b3ef7e855818b7cb2c1a2
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.

2.340 × 10⁹²(93-digit number)
23405045060211533222…39744242869168826179
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.340 × 10⁹²(93-digit number)
23405045060211533222…39744242869168826179
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.681 × 10⁹²(93-digit number)
46810090120423066445…79488485738337652359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.362 × 10⁹²(93-digit number)
93620180240846132891…58976971476675304719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.872 × 10⁹³(94-digit number)
18724036048169226578…17953942953350609439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.744 × 10⁹³(94-digit number)
37448072096338453156…35907885906701218879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.489 × 10⁹³(94-digit number)
74896144192676906313…71815771813402437759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.497 × 10⁹⁴(95-digit number)
14979228838535381262…43631543626804875519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.995 × 10⁹⁴(95-digit number)
29958457677070762525…87263087253609751039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.991 × 10⁹⁴(95-digit number)
59916915354141525050…74526174507219502079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.198 × 10⁹⁵(96-digit number)
11983383070828305010…49052349014439004159
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,716,109 XPM·at block #6,809,005 · 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