Block #390,733

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/5/2014, 8:45:50 AM · Difficulty 10.4255 · 6,417,342 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
09d0dddefc5906616ce4089e9246fba503a2528ada7e8e1535f158972efae392

Height

#390,733

Difficulty

10.425514

Transactions

10

Size

60.38 KB

Version

2

Bits

0a6cee82

Nonce

143,519

Timestamp

2/5/2014, 8:45:50 AM

Confirmations

6,417,342

Merkle Root

96a492a432df0f20fb7b525732d3f2934cfb269aa715351baa30779d7b5fda17
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.589 × 10⁹⁹(100-digit number)
25890897119495965639…74315428455111521279
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.589 × 10⁹⁹(100-digit number)
25890897119495965639…74315428455111521279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.178 × 10⁹⁹(100-digit number)
51781794238991931279…48630856910223042559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.035 × 10¹⁰⁰(101-digit number)
10356358847798386255…97261713820446085119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.071 × 10¹⁰⁰(101-digit number)
20712717695596772511…94523427640892170239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.142 × 10¹⁰⁰(101-digit number)
41425435391193545023…89046855281784340479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.285 × 10¹⁰⁰(101-digit number)
82850870782387090047…78093710563568680959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.657 × 10¹⁰¹(102-digit number)
16570174156477418009…56187421127137361919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.314 × 10¹⁰¹(102-digit number)
33140348312954836018…12374842254274723839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.628 × 10¹⁰¹(102-digit number)
66280696625909672037…24749684508549447679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.325 × 10¹⁰²(103-digit number)
13256139325181934407…49499369017098895359
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,708,647 XPM·at block #6,808,074 · 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