Block #364,464

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/18/2014, 2:21:27 AM · Difficulty 10.4212 · 6,472,188 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
53af791a468bfed72c6dddcc480a2bef22800e3d8cce7b5bce5a894d9f2364f8

Height

#364,464

Difficulty

10.421206

Transactions

3

Size

970 B

Version

2

Bits

0a6bd42f

Nonce

26,616

Timestamp

1/18/2014, 2:21:27 AM

Confirmations

6,472,188

Merkle Root

b6d26005131d40aea96834ac4b0df65051076efd70fcfb474985cb51097d03c8
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.273 × 10⁹⁷(98-digit number)
22735856141411885241…56496399361497230561
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.273 × 10⁹⁷(98-digit number)
22735856141411885241…56496399361497230561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.547 × 10⁹⁷(98-digit number)
45471712282823770483…12992798722994461121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.094 × 10⁹⁷(98-digit number)
90943424565647540966…25985597445988922241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.818 × 10⁹⁸(99-digit number)
18188684913129508193…51971194891977844481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.637 × 10⁹⁸(99-digit number)
36377369826259016386…03942389783955688961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.275 × 10⁹⁸(99-digit number)
72754739652518032773…07884779567911377921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.455 × 10⁹⁹(100-digit number)
14550947930503606554…15769559135822755841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.910 × 10⁹⁹(100-digit number)
29101895861007213109…31539118271645511681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.820 × 10⁹⁹(100-digit number)
58203791722014426218…63078236543291023361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.164 × 10¹⁰⁰(101-digit number)
11640758344402885243…26156473086582046721
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,937,491 XPM·at block #6,836,651 · 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