Block #341,866

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/3/2014, 5:28:05 PM · Difficulty 10.1464 · 6,472,256 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ae0d3a3b45283fc99d71f1a4f15f6dd9e29a284d2f7cca568fbae00d587c8331

Height

#341,866

Difficulty

10.146410

Transactions

18

Size

6.17 KB

Version

2

Bits

0a257b28

Nonce

71,395

Timestamp

1/3/2014, 5:28:05 PM

Confirmations

6,472,256

Merkle Root

6d26e51944c80912b00afbfc1ba6975548b0ef2190e6664e036760dc11761920
Transactions (18)
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.034 × 10⁹⁶(97-digit number)
10346126547382313696…98508014550451883679
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.034 × 10⁹⁶(97-digit number)
10346126547382313696…98508014550451883679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.069 × 10⁹⁶(97-digit number)
20692253094764627393…97016029100903767359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.138 × 10⁹⁶(97-digit number)
41384506189529254786…94032058201807534719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.276 × 10⁹⁶(97-digit number)
82769012379058509572…88064116403615069439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.655 × 10⁹⁷(98-digit number)
16553802475811701914…76128232807230138879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.310 × 10⁹⁷(98-digit number)
33107604951623403828…52256465614460277759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.621 × 10⁹⁷(98-digit number)
66215209903246807657…04512931228920555519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.324 × 10⁹⁸(99-digit number)
13243041980649361531…09025862457841111039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.648 × 10⁹⁸(99-digit number)
26486083961298723063…18051724915682222079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.297 × 10⁹⁸(99-digit number)
52972167922597446126…36103449831364444159
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,757,060 XPM·at block #6,814,121 · 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