mirror of https://github.com/oxen-io/lokinet
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
206 lines
4.9 KiB
C++
206 lines
4.9 KiB
C++
5 years ago
|
#include <service/intro_set.hpp>
|
||
6 years ago
|
|
||
6 years ago
|
#include <path/path.hpp>
|
||
6 years ago
|
|
||
|
namespace llarp
|
||
|
{
|
||
|
namespace service
|
||
|
{
|
||
6 years ago
|
util::StatusObject
|
||
|
IntroSet::ExtractStatus() const
|
||
6 years ago
|
{
|
||
6 years ago
|
util::StatusObject obj{{"published", T}};
|
||
|
std::vector< util::StatusObject > introsObjs;
|
||
|
std::transform(I.begin(), I.end(), std::back_inserter(introsObjs),
|
||
|
[](const auto& intro) -> util::StatusObject {
|
||
|
return intro.ExtractStatus();
|
||
|
});
|
||
|
obj.Put("intros", introsObjs);
|
||
6 years ago
|
if(!topic.IsZero())
|
||
6 years ago
|
obj.Put("topic", topic.ToString());
|
||
|
return obj;
|
||
6 years ago
|
}
|
||
|
|
||
6 years ago
|
bool
|
||
6 years ago
|
IntroSet::DecodeKey(const llarp_buffer_t& key, llarp_buffer_t* buf)
|
||
6 years ago
|
{
|
||
|
bool read = false;
|
||
|
if(!BEncodeMaybeReadDictEntry("a", A, read, key, buf))
|
||
|
return false;
|
||
|
|
||
6 years ago
|
if(key == "i")
|
||
6 years ago
|
{
|
||
|
return BEncodeReadList(I, buf);
|
||
|
}
|
||
|
if(!BEncodeMaybeReadDictEntry("k", K, read, key, buf))
|
||
|
return false;
|
||
|
|
||
|
if(!BEncodeMaybeReadDictEntry("n", topic, read, key, buf))
|
||
|
return false;
|
||
|
|
||
|
if(!BEncodeMaybeReadDictInt("t", T, read, key, buf))
|
||
|
return false;
|
||
|
|
||
6 years ago
|
if(key == "w")
|
||
6 years ago
|
{
|
||
5 years ago
|
W = std::make_unique< PoW >();
|
||
6 years ago
|
return W->BDecode(buf);
|
||
|
}
|
||
|
|
||
|
if(!BEncodeMaybeReadDictInt("v", version, read, key, buf))
|
||
|
return false;
|
||
|
|
||
|
if(!BEncodeMaybeReadDictEntry("z", Z, read, key, buf))
|
||
|
return false;
|
||
|
|
||
|
return read;
|
||
|
}
|
||
|
|
||
|
bool
|
||
|
IntroSet::BEncode(llarp_buffer_t* buf) const
|
||
|
{
|
||
|
if(!bencode_start_dict(buf))
|
||
|
return false;
|
||
|
if(!BEncodeWriteDictEntry("a", A, buf))
|
||
|
return false;
|
||
|
// start introduction list
|
||
|
if(!bencode_write_bytestring(buf, "i", 1))
|
||
|
return false;
|
||
|
if(!BEncodeWriteList(I.begin(), I.end(), buf))
|
||
|
return false;
|
||
|
// end introduction list
|
||
|
|
||
|
// pq pubkey
|
||
|
if(!BEncodeWriteDictEntry("k", K, buf))
|
||
|
return false;
|
||
|
|
||
|
// topic tag
|
||
|
if(topic.ToString().size())
|
||
|
{
|
||
|
if(!BEncodeWriteDictEntry("n", topic, buf))
|
||
|
return false;
|
||
|
}
|
||
|
// Timestamp published
|
||
|
if(!BEncodeWriteDictInt("t", T, buf))
|
||
|
return false;
|
||
|
|
||
|
// write version
|
||
|
if(!BEncodeWriteDictInt("v", version, buf))
|
||
|
return false;
|
||
|
if(W)
|
||
|
{
|
||
|
if(!BEncodeWriteDictEntry("w", *W, buf))
|
||
|
return false;
|
||
|
}
|
||
|
if(!BEncodeWriteDictEntry("z", Z, buf))
|
||
|
return false;
|
||
|
|
||
|
return bencode_end(buf);
|
||
|
}
|
||
|
|
||
|
bool
|
||
|
IntroSet::HasExpiredIntros(llarp_time_t now) const
|
||
|
{
|
||
|
for(const auto& i : I)
|
||
|
if(now >= i.expiresAt)
|
||
|
return true;
|
||
|
return false;
|
||
|
}
|
||
|
|
||
|
bool
|
||
|
IntroSet::IsExpired(llarp_time_t now) const
|
||
|
{
|
||
|
return GetNewestIntroExpiration() < now;
|
||
|
}
|
||
|
|
||
|
bool
|
||
5 years ago
|
IntroSet::Verify(Crypto* crypto, llarp_time_t now) const
|
||
6 years ago
|
{
|
||
6 years ago
|
std::array< byte_t, MAX_INTROSET_SIZE > tmp;
|
||
|
llarp_buffer_t buf(tmp);
|
||
6 years ago
|
IntroSet copy;
|
||
|
copy = *this;
|
||
|
copy.Z.Zero();
|
||
|
if(!copy.BEncode(&buf))
|
||
6 years ago
|
{
|
||
6 years ago
|
return false;
|
||
6 years ago
|
}
|
||
6 years ago
|
// rewind and resize buffer
|
||
|
buf.sz = buf.cur - buf.base;
|
||
|
buf.cur = buf.base;
|
||
|
if(!A.Verify(crypto, buf, Z))
|
||
6 years ago
|
{
|
||
6 years ago
|
return false;
|
||
6 years ago
|
}
|
||
6 years ago
|
// validate PoW
|
||
6 years ago
|
using namespace std::placeholders;
|
||
|
if(W && !W->IsValid(std::bind(&Crypto::shorthash, crypto, _1, _2), now))
|
||
6 years ago
|
{
|
||
6 years ago
|
return false;
|
||
6 years ago
|
}
|
||
6 years ago
|
// valid timestamps
|
||
|
// add max clock skew
|
||
|
now += MAX_INTROSET_TIME_DELTA;
|
||
|
for(const auto& intro : I)
|
||
|
{
|
||
|
if(intro.expiresAt > now
|
||
5 years ago
|
&& intro.expiresAt - now > path::default_lifetime)
|
||
6 years ago
|
{
|
||
5 years ago
|
if(W
|
||
|
&& intro.expiresAt - W->extendedLifetime > path::default_lifetime)
|
||
5 years ago
|
{
|
||
6 years ago
|
return false;
|
||
5 years ago
|
}
|
||
6 years ago
|
else if(W == nullptr)
|
||
|
{
|
||
5 years ago
|
LogWarn("intro has too high expire time");
|
||
6 years ago
|
return false;
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
if(IsExpired(now))
|
||
|
{
|
||
5 years ago
|
LogWarn("introset expired: ", *this);
|
||
6 years ago
|
return false;
|
||
|
}
|
||
|
return true;
|
||
|
}
|
||
|
|
||
|
llarp_time_t
|
||
|
IntroSet::GetNewestIntroExpiration() const
|
||
|
{
|
||
|
llarp_time_t t = 0;
|
||
|
for(const auto& intro : I)
|
||
|
t = std::max(intro.expiresAt, t);
|
||
|
return t;
|
||
|
}
|
||
6 years ago
|
|
||
|
std::ostream&
|
||
|
IntroSet::print(std::ostream& stream, int level, int spaces) const
|
||
|
{
|
||
|
Printer printer(stream, level, spaces);
|
||
|
printer.printAttribute("A", A);
|
||
|
printer.printAttribute("I", I);
|
||
|
printer.printAttribute("K", K);
|
||
|
|
||
|
std::string _topic = topic.ToString();
|
||
|
|
||
|
if(!_topic.empty())
|
||
|
{
|
||
|
printer.printAttribute("topic", _topic);
|
||
|
}
|
||
|
else
|
||
|
{
|
||
|
printer.printAttribute("topic", topic);
|
||
|
}
|
||
|
|
||
|
printer.printAttribute("T", T);
|
||
5 years ago
|
printer.printAttribute("W", W.get());
|
||
6 years ago
|
printer.printAttribute("V", version);
|
||
|
printer.printAttribute("Z", Z);
|
||
|
|
||
|
return stream;
|
||
|
}
|
||
6 years ago
|
} // namespace service
|
||
|
} // namespace llarp
|