Block #431,962

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/6/2014, 1:36:43 PM · Difficulty 10.3443 · 6,378,757 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
123299c4b1ad465b9fbfac900967468cbefbee02d6776e9886cb83b31bb7fdb6

Height

#431,962

Difficulty

10.344289

Transactions

4

Size

1.69 KB

Version

2

Bits

0a582358

Nonce

206,101

Timestamp

3/6/2014, 1:36:43 PM

Confirmations

6,378,757

Merkle Root

051bd220e70a40075d91c174eb29d4aac49003580128d8e9949e585327324cf1
Transactions (4)
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.

1.974 × 10⁹⁵(96-digit number)
19743644349701954139…73450495382796472319
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
1.974 × 10⁹⁵(96-digit number)
19743644349701954139…73450495382796472319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.948 × 10⁹⁵(96-digit number)
39487288699403908279…46900990765592944639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.897 × 10⁹⁵(96-digit number)
78974577398807816558…93801981531185889279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.579 × 10⁹⁶(97-digit number)
15794915479761563311…87603963062371778559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.158 × 10⁹⁶(97-digit number)
31589830959523126623…75207926124743557119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.317 × 10⁹⁶(97-digit number)
63179661919046253246…50415852249487114239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.263 × 10⁹⁷(98-digit number)
12635932383809250649…00831704498974228479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.527 × 10⁹⁷(98-digit number)
25271864767618501298…01663408997948456959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.054 × 10⁹⁷(98-digit number)
50543729535237002597…03326817995896913919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.010 × 10⁹⁸(99-digit number)
10108745907047400519…06653635991793827839
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,729,840 XPM·at block #6,810,718 · 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