Block #320,991

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/20/2013, 1:01:14 AM · Difficulty 10.1850 · 6,490,000 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
75a0d4057db47c8bb039ca4fee81f036cfd9fca8697ed4a1f19a6a64d3897658

Height

#320,991

Difficulty

10.185047

Transactions

1

Size

1.05 KB

Version

2

Bits

0a2f5f3f

Nonce

487,210

Timestamp

12/20/2013, 1:01:14 AM

Confirmations

6,490,000

Merkle Root

2f56714971cfdbb1a6075ef6644a4d7f9a5ee9e0357aafb79551eed3ce1c6b09
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.272 × 10⁹⁸(99-digit number)
22726429689747696544…05065795599776934489
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.272 × 10⁹⁸(99-digit number)
22726429689747696544…05065795599776934489
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.545 × 10⁹⁸(99-digit number)
45452859379495393088…10131591199553868979
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.090 × 10⁹⁸(99-digit number)
90905718758990786177…20263182399107737959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.818 × 10⁹⁹(100-digit number)
18181143751798157235…40526364798215475919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.636 × 10⁹⁹(100-digit number)
36362287503596314471…81052729596430951839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.272 × 10⁹⁹(100-digit number)
72724575007192628942…62105459192861903679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.454 × 10¹⁰⁰(101-digit number)
14544915001438525788…24210918385723807359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.908 × 10¹⁰⁰(101-digit number)
29089830002877051576…48421836771447614719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.817 × 10¹⁰⁰(101-digit number)
58179660005754103153…96843673542895229439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.163 × 10¹⁰¹(102-digit number)
11635932001150820630…93687347085790458879
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,732,032 XPM·at block #6,810,990 · 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