Block #464,475

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/28/2014, 7:25:39 PM · Difficulty 10.4228 · 6,360,555 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
981efa27a3f63c69bc86c934959ffb0b69864713e79345a0fe61adbef595be99

Height

#464,475

Difficulty

10.422800

Transactions

1

Size

970 B

Version

2

Bits

0a6c3c9b

Nonce

14,597

Timestamp

3/28/2014, 7:25:39 PM

Confirmations

6,360,555

Merkle Root

7361afc16a4e228f5eb28f1b46738993df882b721e80a2338482db6d7d0d1bd6
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.

7.657 × 10⁹⁶(97-digit number)
76575666095774919413…01484275411664445901
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
7.657 × 10⁹⁶(97-digit number)
76575666095774919413…01484275411664445901
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.531 × 10⁹⁷(98-digit number)
15315133219154983882…02968550823328891801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.063 × 10⁹⁷(98-digit number)
30630266438309967765…05937101646657783601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.126 × 10⁹⁷(98-digit number)
61260532876619935530…11874203293315567201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.225 × 10⁹⁸(99-digit number)
12252106575323987106…23748406586631134401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.450 × 10⁹⁸(99-digit number)
24504213150647974212…47496813173262268801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.900 × 10⁹⁸(99-digit number)
49008426301295948424…94993626346524537601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.801 × 10⁹⁸(99-digit number)
98016852602591896848…89987252693049075201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.960 × 10⁹⁹(100-digit number)
19603370520518379369…79974505386098150401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.920 × 10⁹⁹(100-digit number)
39206741041036758739…59949010772196300801
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,844,323 XPM·at block #6,825,029 · 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