Block #369,739

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/21/2014, 2:38:49 PM · Difficulty 10.4474 · 6,446,989 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
51b4cb1371fc74df09ab8947a6549aff5d5d07017aa796dd6e1ac7a8acaebcc3

Height

#369,739

Difficulty

10.447383

Transactions

1

Size

1004 B

Version

2

Bits

0a7287b2

Nonce

13,431

Timestamp

1/21/2014, 2:38:49 PM

Confirmations

6,446,989

Merkle Root

cd40de5c99d59159d24757f379a80ce4f40c293e88b05aef8b0f351156672759
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.

4.529 × 10⁹⁷(98-digit number)
45293945049402385650…22584352944536601599
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
4.529 × 10⁹⁷(98-digit number)
45293945049402385650…22584352944536601599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.058 × 10⁹⁷(98-digit number)
90587890098804771301…45168705889073203199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.811 × 10⁹⁸(99-digit number)
18117578019760954260…90337411778146406399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.623 × 10⁹⁸(99-digit number)
36235156039521908520…80674823556292812799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.247 × 10⁹⁸(99-digit number)
72470312079043817041…61349647112585625599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.449 × 10⁹⁹(100-digit number)
14494062415808763408…22699294225171251199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.898 × 10⁹⁹(100-digit number)
28988124831617526816…45398588450342502399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.797 × 10⁹⁹(100-digit number)
57976249663235053633…90797176900685004799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.159 × 10¹⁰⁰(101-digit number)
11595249932647010726…81594353801370009599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.319 × 10¹⁰⁰(101-digit number)
23190499865294021453…63188707602740019199
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,777,859 XPM·at block #6,816,727 · 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