Block #397,120

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/9/2014, 8:48:59 PM · Difficulty 10.4163 · 6,417,236 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
75bb539846bbde961cd176d3a8947c1b51ba466724cbd853800a4b4ed372c31d

Height

#397,120

Difficulty

10.416332

Transactions

2

Size

416 B

Version

2

Bits

0a6a94bb

Nonce

15,347

Timestamp

2/9/2014, 8:48:59 PM

Confirmations

6,417,236

Merkle Root

1a7795966b583bd00553e39069666ad18d2be48000707d72d7573a16860cec1f
Transactions (2)
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.

3.833 × 10⁹⁸(99-digit number)
38337823901959617392…05740250412410982399
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
3.833 × 10⁹⁸(99-digit number)
38337823901959617392…05740250412410982399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.667 × 10⁹⁸(99-digit number)
76675647803919234784…11480500824821964799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.533 × 10⁹⁹(100-digit number)
15335129560783846956…22961001649643929599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.067 × 10⁹⁹(100-digit number)
30670259121567693913…45922003299287859199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.134 × 10⁹⁹(100-digit number)
61340518243135387827…91844006598575718399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.226 × 10¹⁰⁰(101-digit number)
12268103648627077565…83688013197151436799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.453 × 10¹⁰⁰(101-digit number)
24536207297254155131…67376026394302873599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.907 × 10¹⁰⁰(101-digit number)
49072414594508310262…34752052788605747199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.814 × 10¹⁰⁰(101-digit number)
98144829189016620524…69504105577211494399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.962 × 10¹⁰¹(102-digit number)
19628965837803324104…39008211154422988799
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,758,913 XPM·at block #6,814,355 · 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