Block #523,701

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/3/2014, 6:15:01 PM · Difficulty 10.8732 · 6,300,931 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
261b9fc915cc59b41798a649b82c539e571ea4c2266e6f51929e35fb4fc0d764

Height

#523,701

Difficulty

10.873177

Transactions

5

Size

1.09 KB

Version

2

Bits

0adf8881

Nonce

128,986,886

Timestamp

5/3/2014, 6:15:01 PM

Confirmations

6,300,931

Merkle Root

2d84e1d68597f7279c7d4ac3073afaf014f22a5376f80961a9349849b9ec21f7
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.282 × 10¹⁰⁰(101-digit number)
12825480744803758276…33634014949310896641
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.282 × 10¹⁰⁰(101-digit number)
12825480744803758276…33634014949310896641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.565 × 10¹⁰⁰(101-digit number)
25650961489607516553…67268029898621793281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.130 × 10¹⁰⁰(101-digit number)
51301922979215033106…34536059797243586561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.026 × 10¹⁰¹(102-digit number)
10260384595843006621…69072119594487173121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.052 × 10¹⁰¹(102-digit number)
20520769191686013242…38144239188974346241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.104 × 10¹⁰¹(102-digit number)
41041538383372026485…76288478377948692481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.208 × 10¹⁰¹(102-digit number)
82083076766744052970…52576956755897384961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.641 × 10¹⁰²(103-digit number)
16416615353348810594…05153913511794769921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.283 × 10¹⁰²(103-digit number)
32833230706697621188…10307827023589539841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.566 × 10¹⁰²(103-digit number)
65666461413395242376…20615654047179079681
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,841,119 XPM·at block #6,824,631 · 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