Block #323,710

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/21/2013, 8:13:09 PM · Difficulty 10.2059 · 6,503,276 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3441fbc7a994dd30bf3e4de32e261f36c651f14c74e4e13dc71176d50bee253c

Height

#323,710

Difficulty

10.205916

Transactions

12

Size

2.63 KB

Version

2

Bits

0a34b6e3

Nonce

260,151

Timestamp

12/21/2013, 8:13:09 PM

Confirmations

6,503,276

Merkle Root

25cc734b30d0cbe9be10f140f53936a233fc9f143d45ba272a0e2e14bca213fe
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.073 × 10⁹⁷(98-digit number)
10736469905754646572…61656498414904570879
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.073 × 10⁹⁷(98-digit number)
10736469905754646572…61656498414904570879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.147 × 10⁹⁷(98-digit number)
21472939811509293145…23312996829809141759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.294 × 10⁹⁷(98-digit number)
42945879623018586290…46625993659618283519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.589 × 10⁹⁷(98-digit number)
85891759246037172580…93251987319236567039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.717 × 10⁹⁸(99-digit number)
17178351849207434516…86503974638473134079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.435 × 10⁹⁸(99-digit number)
34356703698414869032…73007949276946268159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.871 × 10⁹⁸(99-digit number)
68713407396829738064…46015898553892536319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.374 × 10⁹⁹(100-digit number)
13742681479365947612…92031797107785072639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.748 × 10⁹⁹(100-digit number)
27485362958731895225…84063594215570145279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.497 × 10⁹⁹(100-digit number)
54970725917463790451…68127188431140290559
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,860,063 XPM·at block #6,826,985 · 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