Block #297,923

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/6/2013, 10:40:24 PM · Difficulty 9.9920 · 6,516,253 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2d930ae0f965589161c3862ccfb8a2b77b9534e12c7b87e6fb2a5858d6b95b3e

Height

#297,923

Difficulty

9.992013

Transactions

4

Size

2.27 KB

Version

2

Bits

09fdf48c

Nonce

6,838

Timestamp

12/6/2013, 10:40:24 PM

Confirmations

6,516,253

Merkle Root

9e11696239509532bad09d6b6843406fa7efd0ad9bfc9f28011033df630911cd
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.641 × 10⁹⁵(96-digit number)
26416318104115839481…57508932244111171839
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.641 × 10⁹⁵(96-digit number)
26416318104115839481…57508932244111171839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.283 × 10⁹⁵(96-digit number)
52832636208231678962…15017864488222343679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.056 × 10⁹⁶(97-digit number)
10566527241646335792…30035728976444687359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.113 × 10⁹⁶(97-digit number)
21133054483292671585…60071457952889374719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.226 × 10⁹⁶(97-digit number)
42266108966585343170…20142915905778749439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.453 × 10⁹⁶(97-digit number)
84532217933170686340…40285831811557498879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.690 × 10⁹⁷(98-digit number)
16906443586634137268…80571663623114997759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.381 × 10⁹⁷(98-digit number)
33812887173268274536…61143327246229995519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.762 × 10⁹⁷(98-digit number)
67625774346536549072…22286654492459991039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.352 × 10⁹⁸(99-digit number)
13525154869307309814…44573308984919982079
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,480 XPM·at block #6,814,175 · 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