Block #326,074

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/23/2013, 12:46:34 PM · Difficulty 10.1957 · 6,491,792 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
827fb308a98afba0456fe346dff42ea010a11cc709ef7a01fbadc8425b2d4e19

Height

#326,074

Difficulty

10.195682

Transactions

8

Size

2.03 KB

Version

2

Bits

0a32183b

Nonce

451,317

Timestamp

12/23/2013, 12:46:34 PM

Confirmations

6,491,792

Merkle Root

dee989fa384a0c4a2b3588a5e0d1b5f09ee072c2207b53e6693e9db0185735c3
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.852 × 10⁹⁴(95-digit number)
38523283144997429215…67863914897425454079
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.852 × 10⁹⁴(95-digit number)
38523283144997429215…67863914897425454079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.704 × 10⁹⁴(95-digit number)
77046566289994858431…35727829794850908159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.540 × 10⁹⁵(96-digit number)
15409313257998971686…71455659589701816319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.081 × 10⁹⁵(96-digit number)
30818626515997943372…42911319179403632639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.163 × 10⁹⁵(96-digit number)
61637253031995886745…85822638358807265279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.232 × 10⁹⁶(97-digit number)
12327450606399177349…71645276717614530559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.465 × 10⁹⁶(97-digit number)
24654901212798354698…43290553435229061119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.930 × 10⁹⁶(97-digit number)
49309802425596709396…86581106870458122239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.861 × 10⁹⁶(97-digit number)
98619604851193418792…73162213740916244479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.972 × 10⁹⁷(98-digit number)
19723920970238683758…46324427481832488959
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,786,995 XPM·at block #6,817,865 · 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