Block #464,826

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/29/2014, 1:16:53 AM · Difficulty 10.4231 · 6,351,521 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b2e3be6fbbfb642e5b8c7557c40e493147f1dd2419f66fd6e29d7c8ff7a5ba7f

Height

#464,826

Difficulty

10.423102

Transactions

8

Size

1.93 KB

Version

2

Bits

0a6c5070

Nonce

1,594,305

Timestamp

3/29/2014, 1:16:53 AM

Confirmations

6,351,521

Merkle Root

7c27ea0305e8c8b4c20d95b4f6d8d7dbbbc8ce533f86c8766eac1e50a73d7be9
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.

5.784 × 10⁹⁶(97-digit number)
57849153017786101182…28668441876241793759
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
5.784 × 10⁹⁶(97-digit number)
57849153017786101182…28668441876241793759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.156 × 10⁹⁷(98-digit number)
11569830603557220236…57336883752483587519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.313 × 10⁹⁷(98-digit number)
23139661207114440472…14673767504967175039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.627 × 10⁹⁷(98-digit number)
46279322414228880945…29347535009934350079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.255 × 10⁹⁷(98-digit number)
92558644828457761891…58695070019868700159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.851 × 10⁹⁸(99-digit number)
18511728965691552378…17390140039737400319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.702 × 10⁹⁸(99-digit number)
37023457931383104756…34780280079474800639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.404 × 10⁹⁸(99-digit number)
74046915862766209513…69560560158949601279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.480 × 10⁹⁹(100-digit number)
14809383172553241902…39121120317899202559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.961 × 10⁹⁹(100-digit number)
29618766345106483805…78242240635798405119
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,774,900 XPM·at block #6,816,346 · 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